Applications of Regularized Least Squares to Classification Problems
Abstract
We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior of these family of learning algorithms is analyzed in both the statistical and the worst-case (individual sequence) data-generating models.
Cite
Text
Cesa-Bianchi. "Applications of Regularized Least Squares to Classification Problems." International Conference on Algorithmic Learning Theory, 2004. doi:10.1007/978-3-540-30215-5_2Markdown
[Cesa-Bianchi. "Applications of Regularized Least Squares to Classification Problems." International Conference on Algorithmic Learning Theory, 2004.](https://mlanthology.org/alt/2004/cesabianchi2004alt-applications/) doi:10.1007/978-3-540-30215-5_2BibTeX
@inproceedings{cesabianchi2004alt-applications,
title = {{Applications of Regularized Least Squares to Classification Problems}},
author = {Cesa-Bianchi, Nicolò},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2004},
pages = {14-18},
doi = {10.1007/978-3-540-30215-5_2},
url = {https://mlanthology.org/alt/2004/cesabianchi2004alt-applications/}
}