Does Momentum Change the Implicit Regularization on Separable Data?Download PDF

Published: 31 Oct 2022, 18:00, Last Modified: 12 Oct 2022, 15:31NeurIPS 2022 AcceptReaders: Everyone
Keywords: Implicit Regularization, Momentum-based Optimizers, Optimization
TL;DR: We derive the implicit regularization of momentum-based optimizers on the linearly separable datasets.
Abstract: The momentum acceleration technique is widely adopted in many optimization algorithms. However, there is no theoretical answer on how the momentum affects the generalization performance of the optimization algorithms. This paper studies this problem by analyzing the implicit regularization of momentum-based optimization. We prove that on the linear classification problem with separable data and exponential-tailed loss, gradient descent with momentum (GDM) converges to the $L^2$ max-margin solution, which is the same as vanilla gradient descent. That means gradient descent with momentum acceleration still converges to a low-complexity model, which guarantees their generalization. We then analyze the stochastic and adaptive variants of GDM (i.e., SGDM and deterministic Adam) and show they also converge to the $L^2$ max-margin solution. Technically, the implicit regularization of SGDM is established based on a novel convergence analysis of SGDM under a general noise condition called affine noise variance condition. To the best of our knowledge, we are the first to derive SGDM’s convergence under such an assumption. Numerical experiments are conducted to support our theoretical results.
Supplementary Material: pdf
14 Replies