返回
Quasi-newton method for Lp multiple kernel learning
DOI:10.1016/j.neucom.2016.01.079.png)
摘要
En 中文
Multiple kernel learning method has more advantages over the single one on the model's interpretability and generalization performance. The existing multiple kernel learning methods usually solve SVM in the dual which is equivalent to the primal optimization. Research shows solving in the primal achieves faster convergence rate than solving in the dual. This paper provides a novel L-p-norm(P > 1) constraint non spare multiple kernel learning method which optimizes the objective function in the primal. Subgradient and Quasi-Newton approach are used to solve standard SVM which possesses superlinear convergence property and acquires inverse Hessian without computing a second derivative, leading to a preferable convergence speed. Alternating optimization method is used to solve SVM and to learn the base kernel weights. Experiments show that the proposed algorithm converges rapidly and that its efficiency compares favorably to other multiple kernel learning algorithms. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Multiple kernel learning
Quasi-Newton method
Alternating optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
On the Development and Applications of Cellulosic Nanofibrillar and Nanocrystalline Materials纤维素纳米原纤和纳米晶材料的发展与应用
Tissue-type plasminogen activator and the low-density lipoprotein receptor–related protein induce Akt phosphorylation in the ischemic brain
Blood
IF0

