Open Access
February 2004 Population theory for boosting ensembles
Leo Breiman
Ann. Statist. 32(1): 1-11 (February 2004). DOI: 10.1214/aos/1079120126


Tree ensembles are looked at in distribution space, that is, the limit case of "infinite" sample size. It is shown that the simplest kind of trees is complete in D-dimensional $L_2(P)$ space if the number of terminal nodes T is greater than D. For such trees we show that the AdaBoost algorithm gives an ensemble converging to the Bayes risk.


Download Citation

Leo Breiman. "Population theory for boosting ensembles." Ann. Statist. 32 (1) 1 - 11, February 2004.


Published: February 2004
First available in Project Euclid: 12 March 2004

zbMATH: 1105.62308
MathSciNet: MR2050998
Digital Object Identifier: 10.1214/aos/1079120126

Primary: 62H30 , 68T05 , 68T10

Keywords: AdaBoost , Bayes risk , trees

Rights: Copyright © 2004 Institute of Mathematical Statistics

Vol.32 • No. 1 • February 2004
Back to Top