# Boosting Simple Learners

31 Jan 2020Noga AlonAlon GonenElad HazanShay Moran

We study boosting algorithms under the assumption that the given weak learner outputs hypotheses from a class of bounded capacity. This assumption is inspired by the common convention that weak hypotheses are rules-of-thumbs'' from an easy-to-learn class''... (read more)

PDF Abstract

No code implementations yet. Submit your code now