The Implicit Regularization of Momentum Gradient Descent with Early Stopping
Not on the map. Why?
Abstract (arXiv)
The study on the implicit regularization induced by gradient-based optimization is a longstanding pursuit. In the present paper, we characterize the implicit regularization of momentum gradient descent (MGD) with early stopping by comparing with the explicit ℓ2-regularization (ridge). In details, we study MGD in the continuous-time view, so-called momentum gradient flow (MGF), and show that its tendency is closer to ridge than the gradient descent (GD) [Ali et al., 2019] for least squares regression. Moreover, we prove that, under the calibration t=√2/λ, where t is the time parameter in MGF and λ is the tuning parameter in ridge regression, the risk of MGF is no more than 1.54 times that of ridge. In particular, the relative Bayes risk of MGF to ridge is between 1 and 1.035 under the optimal tuning. The numerical experiments support our theoretical results strongly.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 26 references that are in the map. First posted on arXiv 14 Jan 2022.
Builds on
7 of 26 references.
References · 7
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
- 2020Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learningcited by 148
- 2018A Continuous-Time View of Early Stopping for Least Squarescited by 67
- 2020The Implicit Regularization of Stochastic Gradient Flow for Least Squarescited by 58
- 2021A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossipcited by 15
Built on by
Not cited yet.