Abstract

Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large learning tasks with many training examples, off-the-shelf optimization techniques for general quadratic programs quickly become intractable in their memory and time requirements. SV M light1 is an implementation of an SVM learner which addresses the problem of large tasks. This chapter presents algorithmic and computational results developed for SV M light V2.0, which make large-scale SVM training more practical. The results give guidelines for the application of SVMs to large domains.

Citations

6696	Statistical Learning Theory - Vapnik - 1998
1366	Text categorization with support vector machines: learning with many relevant features - Joachims - 1998
1126	Practical Optimization - Gill, Murray, et al. - 1981
936	A training algorithm for optimal margin classifiers - Boser, Guyon, et al. - 1992
454	Training support vector machines: an application to face detection - Osuna, Freund, et al. - 1997
207	Sequential Minimal Optimization: A Fast Algorith for Training Support Vector Machines. Microsoft Research Tech Rep MSR-TR-98-14 - Platt - 1998
203	Girosi F: An improved training algorithm for support vector machines - Osuna, Freund - 1997
145	Support vector machines: Training and applications - Osuna, Freund, et al. - 1996
130	LOQO: An interior point code for quadratic programming - Vanderbei - 1994
6	Optimization Theory and Applications - Werner - 1984