Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression
Not on the map. Why?
Abstract (arXiv)
We study the discrete dynamics of mini-batch gradient descent with random reshuffling for least squares regression. We show that the training and generalization errors depend on a sample cross-covariance matrix Z between the original features X and a set of new features widetildeX in which each feature is modified by the mini-batches that appear before it during the learning process in an averaged way. Using this representation, we establish that the dynamics of mini-batch and full-batch gradient descent agree up to leading order with respect to the step size using the linear scaling rule. However, mini-batch gradient descent with random reshuffling exhibits a subtle dependence on the step size that a gradient flow analysis cannot detect, such as converging to a limit that depends on the step size. By comparing Z, a non-commutative polynomial of random matrices, with the sample covariance matrix of X asymptotically, we demonstrate that batching affects the dynamics by resulting in a form of shrinkage on the spectrum.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 51 of its 67 references that are in the map. First posted on arXiv 6 Jun 2024.
Builds on
51 of 67 references.
References · 51
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 266
- 2014One weird trick for parallelizing convolutional neural networkscited by 264
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
38 more
- 2017High-dimensional dynamics of generalization error in neural networkscited by 241
- 2020The large learning rate phase of deep learning: the catapult mechanismcited by 216
- 2019SGD: General Analysis and Improved Ratescited by 207
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 184
- 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
- 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 150
- 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 148
- 2020Implicit Gradient Regularizationcited by 146
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 142
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 135
- 2013Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithmcited by 133
- 2020Random Reshuffling: Simple Analysis with Vast Improvementscited by 115
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 114
- 2019Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setupcited by 112
- 2013Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)cited by 111
- 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 104
- 2015Why Random Reshuffling Beats Stochastic Gradient Descentcited by 79
- 2021On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)cited by 73
- 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 70
- 2018A Continuous-Time View of Early Stopping for Least Squarescited by 69
- 2018Random Shuffling Beats SGD after Finite Epochscited by 67
- 2021Stochastic Training is Not Necessary for Generalizationcited by 63
- 2019SGD without Replacement: Sharper Rates for General Smooth Convex Functionscited by 61
- 2020The Implicit Regularization of Stochastic Gradient Flow for Least Squarescited by 59
- 2020A Unified Convergence Analysis for Shuffling-Type Gradient Methodscited by 58
- 2020Closing the convergence gap of SGD without replacementcited by 57
- 2020Learning Rates as a Function of Batch Size: A Random Matrix Theory Approach to Neural Network Trainingcited by 50
- 2023From high-dimensional & mean-field dynamics to dimensionless ODEs: A unifying approach to SGD in two-layers networkscited by 43
- 2021SGD in the Large: Average-case Analysis, Asymptotics, and Stepsize Criticalitycited by 35
- 2023On the Implicit Bias of Adamcited by 27
- 2022Implicit Regularization or Implicit Conditioning? Exact Risk Trajectories of SGD in High Dimensionscited by 23
- 2023Six Lectures on Linearized Neural Networkscited by 20
- 2022Trajectory of Mini-Batch Momentum: Batch Size Saturation and Convergence in High Dimensionscited by 19
- 2023Double Descent and Overfitting under Noisy Inputs and Distribution Shift for Linear Denoiserscited by 14
- 2022Toward Equation of Motion for Deep Neural Networks: Continuous-time Gradient Descent and Discretization Error Analysiscited by 13
- 2023On the Trajectories of SGD Without Replacementcited by 11
- 2024Near-Interpolators: Rapid Norm Growth and the Trade-Off between Interpolation and Generalizationcited by 8
50 most cited of 51 All 51 (JSON)
Built on by
Not cited yet.