.png){kind=icon}
Return
SPARSITY IN MULTIPLE KERNEL LEARNING
.png){kind=icon}
OA
AI
DOI：10.1214/10-AOS825.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of multiple kernel learning based on penalized empirical risk minimization is discussed. The complexity penalty is determined jointly by the empirical L-2 norms and the reproducing kernel Hilbert space (RKHS) norms induced by the kernels with a data-driven choice of regularization parameters. The main focus is on the case when the total number of kernels is large, but only a relatively small number of them is needed to represent the target function, so that the problem is sparse. The goal is to establish oracle inequalities for the excess risk of the resulting prediction rule showing that the method is adaptive both to the unknown design distribution and to the sparsity of the problem.
Keywords:
High dimensionality
multiple kernel learning
oracle inequality
reproducing kernel Hilbert spaces
restricted isometry
sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
Cited Papers
ShareSaveShareSaveShareSaveComponent selection and smoothing in multivariate nonparametric regression.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAIShareSave
ShareSave
View more