WarpAdam: A new Adam optimizer based on Meta-Learning approach
Not on the map. Why?
Abstract (arXiv)
Optimal selection of optimization algorithms is crucial for training deep learning models. The Adam optimizer has gained significant attention due to its efficiency and wide applicability. However, to enhance the adaptability of optimizers across diverse datasets, we propose an innovative optimization strategy by integrating the 'warped gradient descend'concept from Meta Learning into the Adam optimizer. In the conventional Adam optimizer, gradients are utilized to compute estimates of gradient mean and variance, subsequently updating model parameters. Our approach introduces a learnable distortion matrix, denoted as P, which is employed for linearly transforming gradients. This transformation slightly adjusts gradients during each iteration, enabling the optimizer to better adapt to distinct dataset characteristics. By learning an appropriate distortion matrix P, our method aims to adaptively adjust gradient information across different data distributions, thereby enhancing optimization performance. Our research showcases the potential of this novel approach through theoretical insights and empirical evaluations. Experimental results across various tasks and datasets validate the superiority of our optimizer that integrates the 'warped gradient descend' concept in terms of adaptability. Furthermore, we explore effective strategies for training the adaptation matrix P and identify scenarios where this method can yield optimal results. In summary, this study introduces an innovative approach that merges the 'warped gradient descend' concept from Meta Learning with the Adam optimizer. By introducing a learnable distortion matrix P within the optimizer, we aim to enhance the model's generalization capability across diverse data distributions, thus opening up new possibilities in the field of deep learning optimization.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 32 references that are in the map. First posted on arXiv 6 Sep 2024.
Builds on
15 of 32 references.
References · 15
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2019A Comprehensive Survey on Transfer Learningcited by 1,154
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2018On First-Order Meta-Learning Algorithmscited by 1,003
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2019On the Convergence of Adam and Beyondcited by 834
- 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 377
- 2018Meta-Transfer Learning for Few-Shot Learningcited by 306
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
- 2019Meta-Learning with Warped Gradient Descentcited by 98
3 more
- 2017Failures of Gradient-Based Deep Learningcited by 79
- 2019Adaptive Gradient Descent without Descentcited by 79
- 2016A Primer on Coordinate Descent Algorithmscited by 16
Built on by
Not cited yet.