.png){kind=icon}
Return
Optimizing Top-k Multiclass SVM via Semismooth Newton Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2018.2826039.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Top-k performance has recently received increasing attention in large data categories. Advances, like a top-k multiclass support vector machine (SVM), have consistently improved the top-k accuracy. However, the key ingredient in the state-of-the-art optimization scheme based upon stochastic dual coordinate ascent relies on the sorting method, which yields O(d log d) complexity. In this paper, we leverage the semismooth-ness of the problem and propose an optimized top-k multiclass SVM algorithm, which employs semismooth Newton algorithm for the key building block to improve the training speed. Our method enjoys a local superlinear convergence rate in theory. In practice, experimental results confirm the validity. Our algorithm is four times faster than the existing method in large synthetic problems; Moreover, on real-world data sets it also shows significant improvement in training time.
Keywords:
Multiclass support vector machine (SVM)
root finding
semismooth Newton method
stochastic dual coordinate ascent (SDCA) optimization
top-k error
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.6K
Citations:
7.2W
Organization
Cited Papers
Dual coordinate descent methods for logistic regression and maximum entropy models.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAIShareSaveShareSaveIntegrated Optimization Design of Combined Cooling, Heating, and Power System Coupled with Solar and Biomass EnergyEnergies
OAAI
EnergiesIF0
OAAIShareSaveShareSave
View more