Memory Efficient Mixed-Precision Optimizers

Basile Lewandowski, Atli Kosson
9/21/2023
cs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Traditional optimization methods rely on the use of single-precision floating point arithmetic, which can be costly in terms of memory size and computing power. However, mixed precision optimization techniques leverage the use of both single and half-precision floating point arithmetic to reduce memory requirements while maintaining model accuracy. We provide here an algorithm to further reduce memory usage during the training of a model by getting rid of the floating point copy of the parameters, virtually keeping only half-precision numbers. We also explore the benefits of getting rid of the gradient's value by executing the optimizer step during the back-propagation. In practice, we achieve up to 25% lower peak memory use and 15% faster training while maintaining the same level of accuracy.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lewandowski2023memory,
  title  = {Memory Efficient Mixed-Precision Optimizers},
  author = {Basile Lewandowski and Atli Kosson},
  year   = {2023},
  eprint = {2309.12381},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.12381v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.12381.svg)](https://codeofpaper.com/paper/2309.12381)

Discussion