Computing the Solution Path for the Regularized Support Vector Regression
Abstract
In this paper we derive an algorithm that computes the entire solu- tion 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.
Cite
Text
Gunter and Zhu. "Computing the Solution Path for the Regularized Support Vector Regression." Neural Information Processing Systems, 2005.Markdown
[Gunter and Zhu. "Computing the Solution Path for the Regularized Support Vector Regression." Neural Information Processing Systems, 2005.](https://mlanthology.org/neurips/2005/gunter2005neurips-computing/)BibTeX
@inproceedings{gunter2005neurips-computing,
title = {{Computing the Solution Path for the Regularized Support Vector Regression}},
author = {Gunter, Lacey and Zhu, Ji},
booktitle = {Neural Information Processing Systems},
year = {2005},
pages = {483-490},
url = {https://mlanthology.org/neurips/2005/gunter2005neurips-computing/}
}