Postdoc, Aarhus University
1 paper at NeurIPS 2025
We establish the sample complexity of agnostic boosting up to logarithmic factors by providing novel upper and lower bounds.