.png){kind=icon}
.png){kind=icon}
Return
Kernelized Elastic Net Regularization based on Markov selective sampling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2018.08.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper extends Kernelized Elastic Net Regularization (KENReg) algorithm from the assumption of independent and identically distributed (i.i.d.) samples to the case of non-i.i.d. samples. We first establish the generalization bounds of KENReg algorithm with uniformly ergodic Markov chain samples, then we prove that the KENReg algorithm with uniformly ergodic Markov chain samples is consistent and obtain the fast learning rate of KENReg algorithm with uniformly ergodic Markov chain samples. We also introduce the KENReg algorithm based on Markov selective sampling. Based on Gaussian kernels, the advantages of KENReg algorithm against the traditional one with i.i.d. samples are demonstrated on various real-world datasets. Compared to randomly independent sampling, experimental results show that the KENReg algorithm based on Markov selective sampling not only has much higher prediction accuracy in terms of mean square errors and generates simpler models in terms of the number of non-zero regression coefficients, but also has shorter total time of sampling and training. We compare the algorithm proposed in this paper with these known regularization algorithms, like kernelized Ridge regression and kernelized Least absolute shrinkage and selection operator (Lasso). (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Kernelized Elastic Net Regularization
Markov selective sampling
Uniformly ergodic Markov chain
Sparseness
Learning performance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
View more organizations