paper-with-me

Papers

Memory Augmented Optimizers for Deep Learning

2021-06-20 · ICLR 2022 4 · Paul-Aymeric McRae, Prasanna Parthasarathi, Mahmoud Assran, Sarath Chandar

Popular approaches for minimizing loss in data-driven learning often involve an abstraction or an explicit retention of the history of gradients for efficient parameter updates. The aggregated history of gradients nudges the parameter updates in the right direction even when the gradients at any given step are not informative. Although the history of gradients summarized in meta-parameters or explicitly stored in memory has been shown effective in theory and practice, the question of whether $all$ or only a subset of the gradients in the history are sufficient in deciding the parameter updates remains unanswered. In this paper, we propose a framework of memory-augmented gradient descent optimizers that retain a limited view of their gradient history in their internal memory. Such optimizers scale well to large real-life datasets, and our experiments show that the memory augmented extensions of standard optimizers enjoy accelerated convergence and improved performance on a majority of computer vision and language tasks that we considered. Additionally, we prove that the proposed class of optimizers with fixed-size memory converge under assumptions of strong convexity, regardless of which gradients are selected or how they are linearly combined to form the update step.

📄 PDF Abstract BibTeX arXiv:2106.10708

Code (2)

chandar-lab/CGOptimizer 공식 구현 pytorch
chandar-lab/cmoptimizer pytorch

Tasks

Deep Learning

Similar Papers 제목 키워드 기반

Dynamic Memory Based Adaptive Optimization

2024-02-23 · Balázs Szegedy, Domonkos Czifra, Péter Kőrösi-Szabó

Define an optimizer as having memory $k$ if it stores $k$ dynamically changing vectors in the parameter space. Classical SGD has memory $0$, momentum SGD optimizer has $1$ and Adam optimizer has $2$. We address the follo…

Towards Efficient Optimizer Design for LLM via Structured Fisher Approximation with a Low-Rank Extension

2025-02-11 · Wenbo Gong, Meyer Scetbon, Chao Ma, Edward Meeds

Designing efficient optimizers for large language models (LLMs) with low-memory requirements and fast convergence is an important and challenging problem. This paper makes a step towards the systematic design of such opt…

Practical tradeoffs between memory, compute, and performance in learned optimizers

2022-03-22 · Luke Metz, C. Daniel Freeman, James Harrison, Niru Maheswaranathan 외

Optimization plays a costly and crucial role in developing machine learning systems. In learned optimizers, the few hyperparameters of commonly used hand-designed optimizers, e.g. Adam or SGD, are replaced with flexible …

Promoting Exploration in Memory-Augmented Adam using Critical Momenta

2023-07-18 · Pranshu Malviya, Gonçalo Mordido, Aristide Baratin, Reza Babanezhad Harikandeh 외

Adaptive gradient-based optimizers, notably Adam, have left their mark in training large-scale deep learning models, offering fast convergence and robustness to hyperparameter settings. However, they often struggle with …

image-classificationImage ClassificationLanguage Modelling

Navigating LLM Valley: From AdamW to Memory-Efficient and Matrix-Based Optimizers

2026-05-09 · Aditya Ranganath arxiv

Training large language models requires optimization algorithms that are not only statistically effective, but also computationally and memory efficient at extreme scale. Although Adam remains the dominant optimizer for …