MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915005098622976 |
|---|---|
| author | Modoranu, Ionut-Vlad Safaryan, Mher Malinovsky, Grigory Kurtic, Eldar Robert, Thomas Richtarik, Peter Alistarh, Dan |
| author_facet | Modoranu, Ionut-Vlad Safaryan, Mher Malinovsky, Grigory Kurtic, Eldar Robert, Thomas Richtarik, Peter Alistarh, Dan |
| contents | We propose a new variant of the Adam optimizer called MicroAdam that specifically minimizes memory overheads, while maintaining theoretical convergence guarantees. We achieve this by compressing the gradient information before it is fed into the optimizer state, thereby reducing its memory footprint significantly. We control the resulting compression error via a novel instance of the classical \emph{error feedback} mechanism from distributed optimization in which *the error correction information is itself compressed* to allow for practical memory gains. We prove that the resulting approach maintains theoretical convergence guarantees competitive to those of AMSGrad, while providing good practical performance. Specifically, we show that MicroAdam can be implemented efficiently on GPUs: on both million-scale (BERT) and billion-scale (LLaMA) models, MicroAdam provides practical convergence competitive to that of the uncompressed Adam baseline, with lower memory usage and similar running time. Our code is available at https://github.com/IST-DASLab/MicroAdam. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_15593 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence Modoranu, Ionut-Vlad Safaryan, Mher Malinovsky, Grigory Kurtic, Eldar Robert, Thomas Richtarik, Peter Alistarh, Dan Machine Learning Numerical Analysis We propose a new variant of the Adam optimizer called MicroAdam that specifically minimizes memory overheads, while maintaining theoretical convergence guarantees. We achieve this by compressing the gradient information before it is fed into the optimizer state, thereby reducing its memory footprint significantly. We control the resulting compression error via a novel instance of the classical \emph{error feedback} mechanism from distributed optimization in which *the error correction information is itself compressed* to allow for practical memory gains. We prove that the resulting approach maintains theoretical convergence guarantees competitive to those of AMSGrad, while providing good practical performance. Specifically, we show that MicroAdam can be implemented efficiently on GPUs: on both million-scale (BERT) and billion-scale (LLaMA) models, MicroAdam provides practical convergence competitive to that of the uncompressed Adam baseline, with lower memory usage and similar running time. Our code is available at https://github.com/IST-DASLab/MicroAdam. |
| title | MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence |
| topic | Machine Learning Numerical Analysis |
| url | https://arxiv.org/abs/2405.15593 |