Publication Type
Journal Article
Version
submittedVersion
Publication Date
7-2024
Abstract
In deep learning, different kinds of deep networks typically need different optimizers, which have to be chosen after multiple trials, making the training process inefficient. To relieve this issue and consistently improve the model training speed across deep networks, we propose the ADAptive Nesterov momentum algorithm, Adan for short. Adan first reformulates the vanilla Nesterov acceleration to develop a new Nesterov momentum estimation (NME) method, which avoids the extra overhead of computing gradient at the extrapolation point. Then Adan adopts NME to estimate the gradient's first- and second-order moments in adaptive gradient algorithms for convergence acceleration. Besides, we prove that Adan finds an ϵ -approximate first-order stationary point within O(ϵ−3.5) stochastic gradient complexity on the non-convex stochastic problems (e.g.deep learning problems), matching the best-known lower bound. Extensive experimental results show that Adan consistently surpasses the corresponding SoTA optimizers on vision, language, and RL tasks and sets new SoTAs for many popular networks and frameworks, eg ResNet, ConvNext, ViT, Swin, MAE, DETR, GPT-2, Transformer-XL, and BERT. More surprisingly, Adan can use half of the training cost (epochs) of SoTA optimizers to achieve higher or comparable performance on ViT, GPT-2, MAE, etc, and also shows great tolerance to a large range of minibatch size, e.g.from 1k to 32k. Code is released at https://github.com/sail-sg/Adan , and has been used in multiple popular deep learning frameworks or projects.
Keywords
Adaptive optimizer, Complexity theory, Computer architecture, Convergence, Deep learning, DNN optimizer, Fast DNN training, Stochastic processes, Task analysis, Training
Discipline
OS and Networks | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Areas of Excellence
Digital transformation
Publication
IEEE Transactions on Pattern Analysis and Machine Intelligence
First Page
1
Last Page
34
ISSN
0162-8828
Identifier
10.1109/TPAMI.2024.3423382
Publisher
Institute of Electrical and Electronics Engineers
Citation
XIE, Xingyu; ZHOU, Pan; LI, Huan; LIN, Zhouchen; and YAN, Shuicheng.
Adan: Adaptive Nesterov Momentum Algorithm for faster optimizing deep models. (2024). IEEE Transactions on Pattern Analysis and Machine Intelligence. 1-34.
Available at: https://ink.library.smu.edu.sg/sis_research/9037
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1109/TPAMI.2024.3423382