← 研踪 PaperTrailarXiv:2611.24151 · v1
Nearly Tight Almost Sure Convergence Rates for the Last iterate of SGD
首次提交 2026-11-18 17:55
版本更新 2026-11-18 17:55
雷达观测 2026-11-19 15:04
摘要
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 when a stationary minimizer exists, and otherwise, up to polylogarithmic factors, where 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 and are optimal, up to polylogarithmic factors, for the corresponding problem classes.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 17:55 · 最新观测版本
Nearly Tight Almost Sure Convergence Rates for the Last iterate of SGD
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 when a stationary minimizer exists, and otherwise, up to polylogarithmic factors, where 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 and are optimal, up to polylogarithmic factors, for the corresponding problem classes.
查看此版本解读 →查看此版本原文 ↗