Some Theory for Generalized Boosting Algorithms
Peter J. Bickel, Ya'acov Ritov, Alon Zakai; 7(25):705−732, 2006.
Abstract
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. We consider the population version of the boosting algorithm and prove its convergence to the Bayes classifier as a corollary of a general result about Gauss-Southwell optimization in Hilbert space. We then investigate the algorithmic convergence of the sample version, and give bounds to the time until perfect separation of the sample. We conclude by some results on the statistical optimality of the L2 boosting.
[abs]
[pdf][bib]| © JMLR 2006. (edit, beta) |