首页 > AI前沿 > Nearly Tight Almost Sure Convergence Rates for the Last iterate of SGD

Nearly Tight Almost Sure Convergence Rates for the Last iterate of SGD

arXiv机器学习 2026-11-18 17:55 21 阅读 查看原文

We study the almost sure convergence of the last-iterate optimization error of Stochastic (sub)Gradient Descent (SGD) for convex objectives. For smooth objectives, we establish convergence rates of order $k^{-1/3}$ when a stationary minimizer exists, and $k^{-1/4}$ otherwise, up to polylogarithmic factors, where $k$ denotes the iteration counter. We further show that the latter rate extends to nonsmooth convex objectives. All these rates are achieved by deterministic, anytime stepsize policies. Finally, we establish matching lower bounds showing that the exponents $-1/3$ and