A Trainable Optimizer
Not on the map. Why?
Abstract (arXiv)
The concept of learning to optimize involves utilizing a trainable optimization strategy rather than relying on manually defined full gradient estimations such as ADAM. We present a framework that jointly trains the full gradient estimator and the trainable weights of the model. Specifically, we prove that pseudo-linear TO (Trainable Optimizer), a linear approximation of the full gradient, matches SGD's convergence rate while effectively reducing variance. Pseudo-linear TO incurs negligible computational overhead, requiring only minimal additional tensor multiplications. To further improve computational efficiency, we introduce two simplified variants of Pseudo-linear TO. Experiments demonstrate that TO methods converge faster than benchmark algorithms (e.g., ADAM) in both strongly convex and non-convex settings, and fine tuning of an LLM.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 23 references that are in the map. First posted on arXiv 3 Aug 2025.
Builds on
11 of 23 references.
References · 11
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019On the Convergence of Adam and Beyondcited by 841
- 2016Learning to learn by gradient descent by gradient descentcited by 620
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
- 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 306
- 2021Learning to Optimize: A Primer and A Benchmarkcited by 208
- 2016Learning to Optimizecited by 195
- 2017Neural Optimizer Search with Reinforcement Learningcited by 82
- 2021SUPER-ADAM: Faster and Universal Framework of Adaptive Gradientscited by 40
- 2020The Impact of the Mini-batch Size on the Variance of Gradients in Stochastic Gradient Descentcited by 16
- 2022Divergence Results and Convergence of a Variance Reduced Version of ADAMcited by 8
Built on by
Not cited yet.