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

By Luke Metz, C. Freeman, James Harrison, Niru Maheswaranathan, Jascha Narain Sohl-Dickstein. 2022

42 citations recorded by the source corpus.

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 parametric functions. The parameters of these functions are then optimized so that the resulting learned optimizer minimizes a target loss on a chosen class of models. Learned optimizers can both reduce the number of required training steps and improve the final test loss. However, they can be expensive to train, and once trained can be expensive to use due to computational and memory overhead for the optimizer itself. In this work, we identify and quantify the design features governing the memory, compute, and performance trade-offs for many learned and hand-designed optimizers. We further leverage our analysis to construct a learned optimizer that is both faster and more memory efficient than previous work. Our model and training code are open source.

Subfields: Artificial Intelligence, Optimization & Training, ML Systems & Hardware

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Alexei A. Efros
  2. Jitendra Malik
  3. Zhangyang Wang
  4. Trevor Darrell
  5. Ilija Radosavovic
  6. Tianlong Chen
  7. Abhinav Kumar Gupta
  8. Wuyang Chen

In Optimization & Training

  1. Wuyang Chen
  2. Jitendra Malik
  3. Jialin Liu
  4. Alexei A. Efros
  5. Howard Heaton
  6. Tianlong Chen
  7. Tim Brooks
  8. Zhangyang Wang

In ML Systems & Hardware

  1. Alexei A. Efros
  2. Wotao Yin

Citations in the corpus