Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
Abstract
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning tasks whose solutions use a boosting technique.
Cite
Text
Gavinsky. "Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning." Journal of Machine Learning Research, 2003.Markdown
[Gavinsky. "Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning." Journal of Machine Learning Research, 2003.](https://mlanthology.org/jmlr/2003/gavinsky2003jmlr-optimallysmooth/)BibTeX
@article{gavinsky2003jmlr-optimallysmooth,
title = {{Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning}},
author = {Gavinsky, Dmitry},
journal = {Journal of Machine Learning Research},
year = {2003},
pages = {101-117},
volume = {4},
url = {https://mlanthology.org/jmlr/2003/gavinsky2003jmlr-optimallysmooth/}
}