1 paper across 1 session
We establish the sample complexity of agnostic boosting up to logarithmic factors by providing novel upper and lower bounds.
