One-Pass Boosting
Zafer Barutçuoğlu, Phil Long, Rocco A. Servedio · 2007
This paper studies boosting algorithms that make a single pass over a set of base classiers. We rst analyze a one-pass algorithm in the setting of boosting with diverse base classiers. Our guarantee is the same as the best proved for any boosting algo-rithm, but our one-pass algorithm is much faster than previous approaches. We next exhibit a random source of examples for which a picky variant of Ad-aBoost that skips poor base classiers can outperform the standard AdaBoost al-gorithm, which uses every base classier, by an exponential factor. Experiments with Reuters and synthetic data show that one-pass boosting can sub-stantially improve on the accuracy of Naive Bayes, and that picky boosting can sometimes lead to a further improvement in accuracy. 1