School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, USA.
We study nonconvex stochastic optimization under the Blum-Gladyshev (
BG-0) noise model, where the stochastic gradient variance grows quadratically with the distance from the initialization. We consider this problem under both standard smoothness and the symmetric generalized-smoothness framework, which captures objectives whose local curvature can scale with the gradient norm. We prove that normalized stochastic gradient descent with momentum, using only one stochastic gradient per iteration, converges under
BG-0 noise with oracle complexity
O(ε−6). This rate holds both for standard smoothness and for
α-symmetric generalized smoothness, showing that generalized smoothness is rate-neutral for normalized momentum in this setting. We then study a variance-reduced normalized STORM method. Under mean-square smoothness and sharp initialization, the method achieves the minimax optimal
O(ε−4) complexity, matching the lower bound. Under expected
α-symmetric generalized smoothness, the STORM recursion couples gradient-dependent smoothness with distance-dependent noise, leading to complexity
O(ε−(4+α)) for
α∈(0,1) and
O(ε−5) for
α=1. When the distance-growth parameter in the noise model vanishes, our guarantees recover the standard bounded-variance rates:
O(ε−4) for momentum,
O(ε−3) for variance reduction, and
O(ε−2) in the deterministic case. To our knowledge, these are the first convergence guarantees for normalized methods in non-convex stochastic optimization under
BG-0 noise without bounded domains, increasing batch sizes, or explicit anchoring, covering both standard and generalized smoothness regimes.