The rate of convergence of AdaBoost

Published

Conference Paper

The AdaBoost algorithm of Freund and Schapire (1997) was designed to combine many "weak" hypotheses that perform slightly better than a random guess into a "strong" hypo-thesis that has very low error. We study the rate at which AdaBoost iteratively converges to the minimum of the "exponential loss" with a fast rate of convergence. Our proofs do not require a weak-learning assumption, nor do they require that minimizers of the exponential loss are finite. Specifically, our first result shows that at iteration t, the exponential loss of AdaBoost 's computed parameter vector will be at most ε more than that of any parameter vector of ℓ1- norm bounded by B in a number of rounds that is bounded by a polynomial in B and 1/ε. We also provide rate lower bound examples showing a polynomial dependence on these parameters is necessary. Our second result is that within C/ε iterations, AdaBoost achieves a value of the exponential loss that is at most ε more than the best possible value, where C depends on the dataset. We show that this dependence of the rate on ε is optimal up to constant factors, i.e. at least Ω( 1/ε) rounds are necessary to achieve within ε of the optimal exponential loss. © 2011 I. Mukherjee, C. Rudin & R.E. Schapire.

Duke Authors

Cited Authors

  • Mukherjee, I; Rudin, C; Schapire, RE

Published Date

  • January 1, 2011

Published In

Volume / Issue

  • 19 /

Start / End Page

  • 537 - 557

Electronic International Standard Serial Number (EISSN)

  • 1533-7928

International Standard Serial Number (ISSN)

  • 1532-4435

Citation Source

  • Scopus