Skip to content
arXiv cs.LG · Papers

Random Reshuffling Dominates Stochastic Gradient Descent

arXiv:2606.32005v1 Announce Type: cross Abstract: Stochastic Gradient Descent ($textsf{SGD}$) is one of the most classical optimization algorithms with favorable theoretical guarantees, yet the practical implementation of $textsf{SGD}$ differs subtly from its well-known form and is often referred to as Shuffling Stoc