← Back to papers
2012 COLT COLT 2012

Open Problem: Does AdaBoost Always Cycle?

Abstract

We pose the question of whether the distributions computed by AdaBoost always converge to a cycle.

❓ The Questioner
🧭 Keyword Pioneer — distribution convergence

Authors

Cynthia Rudin , Robert E. Schapire , Ingrid Daubechies

Topics

Machine Learning > Core Methods > Classification Machine Learning > Optimization & Theory > Theory

Keywords

distribution convergence boosting cycle
Download PDF

Related papers

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem 2012
Online Optimization with Gradual Variations 2012
Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences 2012
Computational Bounds on Statistical Query Learning 2012
Rare Probability Estimation under Regularly Varying Heavy Tails 2012