Provable Adaptivity of Adam under Non-uniform Smoothness
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914845488578560 |
|---|---|
| author | Wang, Bohan Zhang, Yushun Zhang, Huishuai Meng, Qi Sun, Ruoyu Ma, Zhi-Ming Liu, Tie-Yan Luo, Zhi-Quan Chen, Wei |
| author_facet | Wang, Bohan Zhang, Yushun Zhang, Huishuai Meng, Qi Sun, Ruoyu Ma, Zhi-Ming Liu, Tie-Yan Luo, Zhi-Quan Chen, Wei |
| contents | Adam is widely adopted in practical applications due to its fast convergence. However, its theoretical analysis is still far from satisfactory. Existing convergence analyses for Adam rely on the bounded smoothness assumption, referred to as the \emph{L-smooth condition}. Unfortunately, this assumption does not hold for many deep learning tasks. Moreover, we believe that this assumption obscures the true benefit of Adam, as the algorithm can adapt its update magnitude according to local smoothness. This important feature of Adam becomes irrelevant when assuming globally bounded smoothness. This paper studies the convergence of randomly reshuffled Adam (RR Adam) with diminishing learning rate, which is the major version of Adam adopted in deep learning tasks. We present the first convergence analysis of RR Adam without the bounded smoothness assumption. We demonstrate that RR Adam can maintain its convergence properties when smoothness is linearly bounded by the gradient norm, referred to as the \emph{$(L_0, L_1)$-smooth condition. We further compare Adam to SGD when both methods use diminishing learning rate. We refine the existing lower bound of SGD and show that SGD can be slower than Adam. To our knowledge, this is the first time that Adam and SGD are rigorously compared in the same setting and the advantage of Adam is revealed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_09900 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Provable Adaptivity of Adam under Non-uniform Smoothness Wang, Bohan Zhang, Yushun Zhang, Huishuai Meng, Qi Sun, Ruoyu Ma, Zhi-Ming Liu, Tie-Yan Luo, Zhi-Quan Chen, Wei Machine Learning Optimization and Control Adam is widely adopted in practical applications due to its fast convergence. However, its theoretical analysis is still far from satisfactory. Existing convergence analyses for Adam rely on the bounded smoothness assumption, referred to as the \emph{L-smooth condition}. Unfortunately, this assumption does not hold for many deep learning tasks. Moreover, we believe that this assumption obscures the true benefit of Adam, as the algorithm can adapt its update magnitude according to local smoothness. This important feature of Adam becomes irrelevant when assuming globally bounded smoothness. This paper studies the convergence of randomly reshuffled Adam (RR Adam) with diminishing learning rate, which is the major version of Adam adopted in deep learning tasks. We present the first convergence analysis of RR Adam without the bounded smoothness assumption. We demonstrate that RR Adam can maintain its convergence properties when smoothness is linearly bounded by the gradient norm, referred to as the \emph{$(L_0, L_1)$-smooth condition. We further compare Adam to SGD when both methods use diminishing learning rate. We refine the existing lower bound of SGD and show that SGD can be slower than Adam. To our knowledge, this is the first time that Adam and SGD are rigorously compared in the same setting and the advantage of Adam is revealed. |
| title | Provable Adaptivity of Adam under Non-uniform Smoothness |
| topic | Machine Learning Optimization and Control |
| url | https://arxiv.org/abs/2208.09900 |