Back to Search
Start Over
A convergence analysis of Nesterov's accelerated gradient method in training deep linear neural networks.
- Source :
-
Information Sciences . Oct2022, Vol. 612, p898-925. 28p. - Publication Year :
- 2022
-
Abstract
- As the training process of deep neural networks involves expensive computational cost, speeding up the convergence is of great importance. Nesterov's accelerated gradient (NAG) is one of the most popular accelerated optimizers in the deep learning community, which often exhibits improved convergence performance over gradient descent (GD) in practice. However, theoretical investigations of NAG mainly focus on the convex setting. Since the optimization landscape of the neural network is non-convex, little is known about the convergence and acceleration of NAG. Nowadays, some works make progress towards understanding the convergence of NAG in training over-parameterized neural networks, where the number of the parameters exceeds that of the training instances. Nonetheless, previous studies are limited to the two-layer neural network, which are far from explaining the remarkable success of NAG in optimizing deep neural networks. In this paper, we investigate the convergence of NAG in training two architectures of deep linear networks: deep fully-connected linear neural networks and deep linear ResNets. Based on the over-parameterization regime, we first analyze the residual dynamics induced by the training trajectory of NAG for a deep fully-connected linear neural network under random Gaussian initialization. Our results show that NAG can converge to the global minimum at a (1 - O (1 / κ)) t rate when the width is near-linear in the depth of the network, where t is the number of iterations and κ > 1 is a constant depending on the condition number of the feature matrix. Compared to the (1 - O (1 / κ)) t rate of GD, NAG achieves an acceleration over GD. For deep linear ResNets, we utilize the same analytical approach and obtain a similar convergence result, while the width requirement is independent of the depth. To the best of our knowledge, these are the first theoretical guarantees for the convergence and acceleration of NAG in training deep neural networks. Numerical results show the acceleration of NAG compared to GD in terms of iterations. In addition, we conduct experiments to evaluate the effect of the depth on the convergence rate of NAG, which validate our derived conditions of the width. We hope our results may shed light on understanding the optimization behavior of NAG for modern deep neural networks. [ABSTRACT FROM AUTHOR]
- Subjects :
- *ARTIFICIAL neural networks
*DEEP learning
*CONVEX sets
Subjects
Details
- Language :
- English
- ISSN :
- 00200255
- Volume :
- 612
- Database :
- Academic Search Index
- Journal :
- Information Sciences
- Publication Type :
- Periodical
- Accession number :
- 160170497
- Full Text :
- https://doi.org/10.1016/j.ins.2022.08.090