arXiv Machine Learning November 2, 2026 By Benjamin Grimmer, Qining Shen

Exact Theory and Optimal Stepsizes for Stochastic Gradient Descent in Smooth Convex Minimization

Read the original on arXiv Machine Learning →

arXiv:2610. 42048v1 Announce Type: cross Abstract: This work considers the design of stepsize schedules for stochastic gradient descent in smooth convex optimization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Oct 5

Gradient Descent's Last Iterate is Often (slightly) Suboptimal

arXiv:2604.13870v2 Announce Type: replace-cross Abstract: We consider the well-studied setting of minimizing a convex Lipschitz function using either gradient descent (GD) or its stochastic variant (...

By Guy Kornowski, Ohad Shamir

arXiv Machine Learning

Jun 24

New Bounds for the Last Iterate of the Stochastic subGradient Method

arXiv:2606. 24879v1 Announce Type: cross Abstract: We study the last iterate of the stochastic subgradient method for one-dimensional convex Lipschitz objectives.

By Guglielmo Beretta, Tommaso Cesari, Roberto Colomboni, Andrea Paudice

arXiv Machine Learning

Sep 10

The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives

arXiv:2609.08537v1 Announce Type: cross Abstract: We study the time-uniform convergence of the raw iterate of standard stochastic gradient descent (SGD) for unconstrained smooth convex objectives. We...

By Ruijie Li, Kang Chen, Tianyu Wang

arXiv Machine Learning

Oct 15

Large-Step Last-Iterate Convergence of Random-Reshuffling Stochastic Gradient Descent

arXiv:2610.19444v1 Announce Type: cross Abstract: Random reshuffling stochastic gradient descent (RR-SGD) is widely used for finite-sum optimization in machine learning. For convex $L$-smooth compone...

By Zijun Chen, Zihan Zhang

safety

arXiv Machine Learning

Jun 2

Accelerating Min-Max Optimization via Power-Law Stepsizes

arXiv:2606. 01764v1 Announce Type: cross Abstract: We revisit the convergence guarantees of the Extragradient (EG) method for unconstrained biaffine min-max optimization.

By Yue Wu, Weiqiang Zheng, Yang Cai, Haipeng Luo

arXiv Machine Learning

Jul 2

Towards Weaker Variance Assumptions for Stochastic Optimization

arXiv:2504. 09951v2 Announce Type: replace-cross Abstract: We revisit a classical assumption for analyzing stochastic gradient algorithms where the squared norm of the stochastic subgradient (or the variance for smooth problems) is allowed to grow as fast as the squared norm of the optimization variable.

By Ahmet Alacaoglu, Yura Malitsky, Stephen J. Wright

One email a morning, machine-written

Related stories

Gradient Descent's Last Iterate is Often (slightly) Suboptimal

New Bounds for the Last Iterate of the Stochastic subGradient Method

The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives

Large-Step Last-Iterate Convergence of Random-Reshuffling Stochastic Gradient Descent

Accelerating Min-Max Optimization via Power-Law Stepsizes

Towards Weaker Variance Assumptions for Stochastic Optimization