Adaptive Moment Estimation Optimization Algorithm Using Projection Gradient for Deep Learning
Not on the map. Why?
Abstract (arXiv)
Training deep neural networks is challenging. To accelerate training and enhance performance, we propose PadamP, a novel optimization algorithm. PadamP is derived by applying the adaptive estimation of the p-th power of the second-order moments under scale invariance, enhancing projection adaptability by modifying the projection discrimination condition. It is integrated into Adam-type algorithms, accelerating training, boosting performance, and improving generalization in deep learning. Combining projected gradient benefits with adaptive moment estimation, PadamP tackles unconstrained non-convex problems. Convergence for the non-convex case is analyzed, focusing on the decoupling of first-order moment estimation coefficients and second-order moment estimation coefficients. Unlike prior work relying on , our proof generalizes the convergence theorem, enhancing practicality. Experiments using VGG-16 and ResNet-18 on CIFAR-10 and CIFAR-100 show PadamP's effectiveness, with notable performance on CIFAR-10/100, especially for VGG-16. The results demonstrate that PadamP outperforms existing algorithms in terms of convergence speed and generalization ability, making it a valuable addition to the field of deep learning optimization.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 23 references that are in the map. First posted on arXiv 13 Mar 2025.
Builds on
12 of 23 references.
References · 12
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2019On the Convergence of Adam and Beyondcited by 841
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 283
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2017Improving Generalization Performance by Switching from Adam to SGDcited by 125
- 2018Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networkscited by 90
- 2017Variants of RMSProp and Adagrad with Logarithmic Regret Boundscited by 50
- 2020AdaX: Adaptive Gradient Descent with Exponential Long Term Memorycited by 10
Built on by
Not cited yet.