Efficient large scale linear programming support vector machines

This paper presents a decomposition method for efficiently constructing ℓ₁-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many desirable properties. For example, it is provably convergent, scales well to large datasets, is easy to implement, and can be extended to handle support vector regression and other SVM variants. We demonstrate the efficiency of our algorithm by training on (dense) synthetic datasets of sizes up to 20 million points (in ℝ³²). The results show our algorithm to be several orders of magnitude faster than a previously published method for the same task. We also present experimental results on real data sets - our method is seen to be not only very fast, but also highly competitive against the leading SVM implementations.