From Classical Acceleration to Adaptive Stochastic Optimization
1983–2026 · Four decades of accelerated first-order methods
− line search
Matching classical oracle complexity lower bounds $\Omega(1/\sqrt{\varepsilon} + \sigma^2/\varepsilon^2)$ — Nemirovski & Yudin (1983)
Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
Optimal iteration and sample complexities for parameter-free stochastic acceleration.



