.png){kind=icon}
返回
Modified Frank-Wolfe algorithm for enhanced sparsity in support vector machine classifiers
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2018.08.049.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work proposes a new algorithm for training a re-weighted l(2) Support Vector Machine (SVM), inspired on the re-weighted Lasso algorithm of Candes et al. and on the equivalence between Lasso and SVM shown recently by Jaggi. In particular, the margin required for each training vector is set independently, defining a new weighted SVM model. These weights are selected to be binary, and they are automatically adapted during the training of the model, resulting in a variation of the Frank-Wolfe optimization algorithm with essentially the same computational complexity as the original algorithm. As shown experimentally, this algorithm is computationally cheaper to apply since it requires less iterations to converge, and it produces models with a sparser representation in terms of support vectors and which are more stable with respect to the selection of the regularization hyper-parameter. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Support Vector Machines
Sparsity
Frank-Wolfe
Lasso
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Effects of Boric Acid Concentration and Shading on Growth, Leaf Physiology, and Anatomy of Guzmania.png)
HortScience
OAAI
HortScienceIF0
OAAI分享收藏Learning using privileged information: SVM plus and weighted SVM使用特权信息学习: SVM plus和加权SVMNEURAL NETWORKSOAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏
查看更多内容