Simple Convergence Proof of Adam From a Sign-like Descent Perspective

Adam is widely recognized as one of the most effective optimizers for training deep neural networks (DNNs). Despite its remarkable empirical success, its theoretical convergence analysis remains unsatisfactory. Existing works predominantly interpret Adam as a preconditioned stochastic gradient descent with momentum (SGDM), formulated as bmxt+1 = bmxt - fracγt√bmvt+ε circ bmmt. This perspective necessitates strong assumptions and intricate techniques, resulting in lengthy and opaque convergence proofs that are difficult to verify and extend. In contrast, we propose a novel interpretation by treating Adam as a sign-like optimizer, expressed as bmxt+1 = bmxt - γt frac|bmmt|√bmvt+ε circ rm Sign(bmmt). This reformulation significantly simplifies the convergence analysis. For the first time, with some mild conditions, we prove that Adam achieves the optimal rate of cal O(frac1T^sfrac14) rather than the previous cal O left(fracln TT^sfrac14right) under weak assumptions of the generalized p-affine variance and (L0, L1, q)-smoothness, without dependence on the model dimensionality or the numerical stability parameter ε. Additionally, our theoretical analysis provides new insights into the role of momentum as a key factor ensuring convergence and offers practical guidelines for tuning learning rates in Adam, further bridging the gap between theory and practice.