.png){kind=icon}
返回
SPARSITY IN MULTIPLE KERNEL LEARNING
.png){kind=icon}
OA
AI
DOI：10.1214/10-AOS825.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
High dimensionality
multiple kernel learning
oracle inequality
reproducing kernel Hilbert spaces
restricted isometry
sparsity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
Future Visions for Higher Education: An Investigation of the Benefits of Virtual Reality for Teaching University Students高等教育的未来愿景: 虚拟现实对大学生教学的好处的调查
PREAI
分享收藏Component selection and smoothing in multivariate nonparametric regression多元非参数回归中的成分选择与平滑.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏
查看更多内容