Skip to yearly menu bar Skip to main content


Optimal Weak to Strong Learning

Kasper Green Larsen · Martin Ritzert

Hall J (level 1) #741

Keywords: [ Sample Complexity ] [ lower bound ] [ weak learning ] [ boosting ]


The classic algorithm AdaBoost allows to convert a weak learner, that is an algorithm that produces a hypothesis which is slightly better than chance, into a strong learner, achieving arbitrarily high accuracy when given enough training data. We present a new algorithm that constructs a strong learner from a weak learner, but uses less training data than AdaBoost and all other weak to strong learners to achieve the same generalization bounds. A sample complexity lower bound shows that our new algorithm uses the minimum possible amount of training data and is thus optimal. Hence, this work settles the sample complexity of the classic problem of constructing a strong learner from a weak learner.

Chat is not available.