Fast learning rate of multiple kernel learning: Trade-off between sparsity and smoothness
多核学习的快速学习率:稀疏性与光滑性的权衡AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于一般机器学习收敛率理论,没有明确的因果、宏观预测或金融预测应用依据。
多核学习的快速学习率:稀疏性与光滑性的权衡AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We investigate the learning rate of multiple kernel learning (MKL) with $\ell_{1}$ and elastic-net regularizations. The elastic-net regularization is a composition of an $\ell_{1}$-regularizer for inducing the sparsity and an $\ell_{2}$-regularizer for controlling the smoothness. We focus on a sparse setting where the total number of kernels is large, but the number of nonzero components of the ground truth is relatively small, and show sharper convergence rates than the learning rates have ever shown for both $\ell_{1}$ and elastic-net regularizations. Our analysis reveals some relations between the choice of a regularization function and the performance. If the ground truth is smooth, we show a faster convergence rate for the elastic-net regularization with less conditions than $\ell_{1}$-regularization; otherwise, a faster convergence rate for the $\ell_{1}$-regularization is shown.