Learning Optimally Sparse Support Vector Machines

Andrew Cotter, Shai Shalev‐Shwartz, Nathan Srebro · 2013

We show how to train SVMs with an optimal guarantee on the number of support vectors (up to constants), and with sample complexity and training runtime bounds matching the best known for kernel SVM optimization (i.e. without any additional asymptotic cost beyond standard SVM training). Our method is simple to implement and works well in practice. 1.

Cited by 39 works.

Authors

References