1 Making Large-scale Svm Learning Practical

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, oo-the-shelf optimization techniques for general quadratic programs quickly become intractable in their memory and time requirements. SVM light1 is an implementation of an SVM learner which addresses the problem of large tasks. This chapter presents algorithmic and computational results developed for SVM light V2.0, which make large-scale SVM training more practical. The results give guidelines for the application of SVMs to large domains. 11.1 Introduction Chapter 1 and Vapnik 1995 show h o w training a support vector machine for the pattern recognition problem leads to the following quadratic optimization problem QP OP1.

Extracted Key Phrases

6 Figures and Tables

Showing 1-10 of 12 references

Support vector machines: Training and applications. A.I. Memo in press

  • E Osuna, R Freund, F Girosi
  • 1996
Highly Influential
1 Excerpt

Methods of Feasible Directions: a Study in Linear and Non-linear Programming

  • G Zoutendijk
  • 1970
2 Excerpts
Showing 1-10 of 3,547 extracted citations
0200400600'99'01'03'05'07'09'11'13'15'17
Citations per Year

8,300 Citations

Semantic Scholar estimates that this publication has received between 7,760 and 8,873 citations based on the available data.

See our FAQ for additional information.