Preprint
Aug 2026
A Tight Lower Bound for Smooth Nonconvex Stochastic Optimization with Bounded Gradient Noise
A sharp lower bound is proved for smooth nonconvex stochastic optimization with uniformly bounded gradient noise with uniformly bounded gradient noise and resolves the question raised by whether almost-surely bounded oracle error permits a better rate than bounded variance.
Jikai Jin
· 0 citations