.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
SVM
Max-margin classification
Hinge loss
Elastic net
Online learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
Cited Papers
ShareSaveShareSaveIndividual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers
PREAI
ShareSaveShareSaveEffect of Chemical Treatments on the Physical Properties of Non-woven Jute/PLA Biocomposites.png)
BioResources
OAAI
BioResourcesIF0
OAAIShareSaveShareSave
View more