Memory-Efficient Adaptive Optimization

Abstract

Adaptive gradient-based optimizers such as Adagrad and Adam are crucial for achieving state-of-the-art performance in machine translation and language modeling. However, these methods maintain second-order statistics for each parameter, thus introducing significant memory overheads that restrict the size of the model being used as well as the number of examples in a mini-batch. We describe an effective and flexible adaptive optimization method with greatly reduced memory overhead. Our method retains the benefits of per-parameter adaptivity while allowing significantly larger models and batch sizes. We give convergence guarantees for our method, and demonstrate its effectiveness in training very large translation and language models with up to 2-fold speedups compared to the state-of-the-art.

Cited by in corpus (9)

• CTRL: A Conditional Transformer Language Model for Controllable Generation
• Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning
• Low-Memory Neural Network Training: A Technical Report
• Descending through a Crowded Valley - Benchmarking Deep Learning Optimizers
• Large-Scale Deep Learning Optimizations: A Comprehensive Survey
• Disentangling Adaptive Gradient Methods from Learning Rates
• PnG BERT: Augmented BERT on Phonemes and Graphemes for Neural TTS
• Accelerating Recommender Systems via Hardware "scale-in"
• Momentum Improves Normalized SGD