Home Page

Papers

Submissions

News

Scope

Editorial Board

Announcements

Proceedings

Open Source Software

Search

Login



RSS Feed

Learning Optimally Sparse Support Vector Machines

Andrew Cotter, Shai Shalev-Shwartz, Nati Srebro
;
JMLR W&CP 28 (1) : 266–274, 2013

Abstract

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.

Related Material