SOURCE-LINKED INTELLIGENCE

Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise and Hölder Smoothness

arXiv · AI, language, vision and robotics · article · Sep 11, 2026 · UTC

Classical convergence guarantees for stochastic gradient methods typically assume Lipschitz-smooth objectives and finite-variance gradient noise, both frequently violated in practice. In contrast, we study nonconvex stochastic optimization under the joint relaxation of these assumptions: objectives with $(L,s)$-Hölder continuous gradients, $s\in(0,1]$, and gradient noise satisfying only a bounded $α$-th moment condition for $α\in(1,2]$. We establish three convergence results. Firstly, that standard SGD converges at rate $O(T^{-s/(1+s)})$ whenever $α\ge1+s$, extending the classical nonconvex SG

Read original source ↗ Open in workspace

recordType

paper

region

Global