2024
The sample complexity of ERMs in stochastic convex optimization
AISTATS 2024poster
Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained unresolved: how many data points must be observed so that any empirical risk minimizer (ERM) shows good performance on th…