Why ADAM Beats SGD for Attention Models

By Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim, Sashank J. Reddi, Surinder Kumar, Suvrit Sra. 2019

88 citations recorded by the source corpus.

While stochastic gradient descent (SGD) is still the de facto algorithm in deep learning, adaptive methods like Adam have been observed to outperform SGD across important tasks, such as attention models. The settings under which SGD performs poorly in comparison to Adam are not well understood yet. In this paper, we provide empirical and theoretical evidence that a heavy-tailed distribution of the noise in stochastic gradients is a root cause of SGD's poor performance. Based on this observation, we study clipped variants of SGD that circumvent this issue; we then analyze their convergence under heavy-tailed noise. Furthermore, we develop a new adaptive coordinate-wise clipping algorithm (ACClip) tailored to such settings. Subsequently, we show how adaptive methods like Adam can be viewed through the lens of clipping, which helps us explain Adam's strong performance under heavy-tail noise settings. Finally, we show that the proposed ACClip outperforms Adam for both BERT pretraining and finetuning tasks.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

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. Jianfeng Gao
  2. Martin Jaggi
  3. Kurt Keutzer
  4. Michael W. Mahoney
  5. Sebastian U. Stich
  6. Zi-Mei Yao
  7. A. Gholami
  8. Mohit Bansal

In Computer Vision and Pattern Recognition

  1. Jianfeng Gao
  2. Luc Van Gool
  3. Dacheng Tao
  4. Kurt Keutzer
  5. Zhe Gan
  6. Jitendra Malik
  7. Trevor Darrell
  8. Xiaogang Wang

Citations in the corpus