PhD student, Aarhus University
2 papers at NeurIPS 2025
We establish the sample complexity of agnostic boosting up to logarithmic factors by providing novel upper and lower bounds.
Improved sample complexity bounds for agnostic binary classification in the tau-based model!