Random Reshuffling Dominates Stochastic Gradient Descent

arXiv:2606.32005 · math.OC, cs.LG, stat.ML · Submitted 2026-06-30 · Read on arXiv

Zijian Liu

math.OC, cs.LG, stat.ML

Submitted: 2026-06-30

Comments: COLT 2026

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Editor — 16× in this paper · explained in 2 episodes
• Stochastic Gradient Descent — 14× in this paper
• Random Reshuffling — 9× in this paper
• Core — 8× in this paper · explained in 2 episodes
• Theoretical Guarantees — 2× in this paper · explained in 2 episodes
• Wasserstein Distance — 2× in this paper · explained in 6 episodes
• Computational Efficiency — 1× in this paper · explained in 2 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• EMMA — 1× in this paper · explained in 2 episodes
• Incremental Gradient — 1× in this paper
• Papers — 1× in this paper · explained in 3 episodes
• Single Shuffling — 1× in this paper
• Stochastic Gradient Descent (SGD) — 1× in this paper · explained in 5 episodes

Sources

• Handbook of Convergence Theorems for (Stochastic) Gradient Methods

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Beyond Aggregate Drift: Optimal Client-Specific Windows in Federated Learning
• Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
• Second-Order Optimization with Asynchronous Curvature