288 pp. per issue
6 x 9, illustrated
2014 Impact factor:

Neural Computation

June 1, 2002, Vol. 14, No. 6, Pages 1267-1281
(doi: 10.1162/089976602753712936)
© 2002 Massachusetts Institute of Technology
A Note on the Decomposition Methods for Support Vector Regression
Article PDF (213.66 KB)

The dual formulation of support vector regression involves two closely related sets of variables. When the decomposition method is used, many existing approaches use pairs of indices from these two sets as the working set. Basically, they select a base set first and then expand it so all indices are pairs. This makes the implementation different from that for support vector classification. In addition, a larger optimization subproblem has to be solved in each iteration. We provide theoretical proofs and conduct experiments to show that using the base set as the working set leads to similar convergence (number of iterations). Therefore, by using a smaller working set while keeping a similar number of iterations, the program can be simpler and more efficient.