.png){kind=icon}
返回
Sample-based online learning for bi-regular hinge loss
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-020-01272-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Support vector machine (SVM), a state-of-the-art classifier for supervised classification task, is famous for its strong generalization guarantees derived from the max-margin property. In this paper, we focus on the maximum margin classification problem cast by SVM and study the bi-regular hinge loss model, which not only performs feature selection but tends to select highly correlated features together. To solve this model, we propose an online learning algorithm that aims at solving a non-smooth minimization problem by alternating iterative mechanism. Basically, the proposed algorithm alternates between intrusion samples detection and iterative optimization, and at each iteration it obtains a closed-form solution to the model. In theory, we prove that the proposed algorithm achieves O(1/root T) convergence rate under some mild conditions, where T is the number of training samples received in online learning. Experimental results on synthetic data and benchmark datasets demonstrate the effectiveness and performance of our approach in comparison with several popular algorithms, such as LIBSVM, SGD, PEGASOS, SVRG, etc.
Keyword:
SVM
Max-margin classification
Hinge loss
Elastic net
Online learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers
PREAI
分享收藏Effect of Chemical Treatments on the Physical Properties of Non-woven Jute/PLA Biocomposites化学处理对非织造黄麻/PLA生物复合材料物理性能的影响.png)
BioResources
OAAI
BioResourcesIF0
OAAI分享收藏
查看更多内容