An explicit algorithm for training support vector machines

The support vector machine (SVM) constitutes one of the most powerful methods for constructing a mathematical model on the basis of a given number of training examples. SVM training requires that we solve a quadratic optimization problem; this step is usually performed by means of existing software packages. Such a black-box approach may be undesirable. In this paper we introduce a simple iterative algorithm for SVM training which compares well with some typical software packages, can be simply implemented, and has minimal memory requirements. It addresses the problem of regression estimation and utilizes ideas similar to those proposed by J. Platt (1998) for training binary SVM.

[1]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[2]  Federico Girosi,et al.  An improved training algorithm for support vector machines , 1997, Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop.

[3]  J. Platt.  Sequential Minimal Optimization : A Fast Algorithm for Training Support Vector Machines , 1998 .

[4]  Simon Haykin,et al.  Support vector machines for dynamic reconstruction of a chaotic system , 1999 .

[5]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.