arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.00783math.OC
收藏

稀疏多核学习:基于镜像分层的支持度识别

Sparse Multiple Kernel Learning: Support Identification via Mirror Stratifiability

Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa

摘要:

在统计机器学习中,核方法允许考虑无限维的特征空间,其计算成本仅取决于观测的数量。这通常通过根据数据拟合项和合适的正则化器来求解最优化问题来完成。在本文中,我们考虑的特征图是一个固定的,可能是大的,一组简单的特征图的串联。惩罚是一个稀疏诱导,促进解决方案只依赖于一个小的子集的功能。群套索问题是这种更一般的设置的特殊情况。我们表明,最流行的优化算法之一,以解决正则化的目标函数,向前向后分裂的方法,允许以稳定的方式进行特征选择。特别是,我们证明了一组相关的功能是确定的算法经过有限的迭代次数,如果一个合适的资格条件成立。证明中使用的主要工具是分层和镜像分层的概念。

英文摘要:

In statistical machine learning, kernel methods allow to consider infinite dimensional feature spaces with a computational cost that only depends on the number of observations. This is usually done by solving an optimization problem depending on a data fit term and a suitable regularizer. In this paper we consider feature maps which are the concatenation of a fixed, possibly large, set of simpler feature maps. The penalty is a sparsity inducing one, promoting solutions depending only on a small subset of the features. The group lasso problem is a special case of this more general setting. We show that one of the most popular optimization algorithms to solve the regularized objective function, the forward-backward splitting method, allows to perform feature selection in a stable manner. In particular, we prove that the set of relevant features is identified by the algorithm after a finite number of iterations if a suitable qualification condition holds. The main tools used in the proofs are the notions of stratification and mirror stratifiability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑