Boosting Simple Learners

Cited by: 0|Bibtex|Views34|Links

Abstract:

We consider boosting algorithms under the restriction that the weak learners come from a class of bounded VC-dimension. In this setting, we focus on two main questions: (i) \underline{Oracle Complexity:} we show that the restriction on the complexity of the weak learner significantly improves the number of calls to the weak learner. We ...More

Code:

Data:

Your rating :
0

 

Tags
Comments