Computing the Solution Path for the Regularized Support Vector Regression

In this paper we derive an algorithm that computes the entire solution path of the support vector regression, with essentially the same computational cost as fitting one SVR model. We also propose an unbiased estimate for the degrees of freedom of the SVR model, which allows convenient selection of the regularization parameter.

[1]  G. Wahba.  Smoothing noisy data with spline functions , 1975 .

[2]  Peter Craven,et al.  Smoothing noisy data with spline functions , 1978 .

[3]  C. Stein.  Estimation of the Mean of a Multivariate Normal Distribution , 1981 .

[4]  J. Freidman,et al.  Multivariate adaptive regression splines , 1991 .

[5]  Alexander J. Smola,et al.  Support Vector Method for Function Approximation, Regression Estimation and Signal Processing , 1996, NIPS.

[6]  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.

[7]  Gunnar Rätsch,et al.  Predicting Time Series with Support Vector Machines , 1997, ICANN.

[8]  Thorsten Joachims,et al.  Making large scale SVM learning practical , 1998 .

[9]  John C. Platt,et al.  Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .

[10]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .

[11]  S. Sathiya Keerthi,et al.  Improvements to Platt's SMO Algorithm for SVM Classifier Design , 2001, Neural Computation.

[12]  Bernhard Schölkopf,et al.  A tutorial on support vector regression , 2004, Stat. Comput..

[13]  Robert Tibshirani,et al.  The Entire Regularization Path for the Support Vector Machine , 2004, J. Mach. Learn. Res..

[14]  José del R. Millán,et al.  A Temporal Kernel-Based Model for Tracking Hand Movements from Neural Activities , 2007 .