Theoretical Analysis of Auto Rate-Tuning by Batch Normalization

By Sanjeev Arora, Zhiyuan Li, Kaifeng Lyu. 2018

146 citations recorded by the source corpus.

Batch Normalization (BN) has become a cornerstone of deep learning across diverse architectures, appearing to help optimization as well as generalization. While the idea makes intuitive sense, theoretical analysis of its effectiveness has been lacking. Here theoretical support is provided for one of its conjectured properties, namely, the ability to allow gradient descent to succeed with less tuning of learning rates. It is shown that even if we fix the learning rate of scale-invariant parameters (e.g., weights of each layer with BN) to a constant (say, $0.3$), gradient descent still approaches a stationary point (i.e., a solution where gradient is zero) in the rate of $T^{-1/2}$ in $T$ iterations, asymptotically matching the best bound for gradient descent with well-tuned learning rates. A similar result with convergence rate $T^{-1/4}$ is also shown for stochastic gradient descent.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Optimization & Training

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. Alan L. Yuille
  2. Quoc V. Le
  3. Dacheng Tao
  4. Yoshua Bengio
  5. Mohit Bansal
  6. Jianfeng Gao
  7. Bernt Schiele
  8. Ling Shao

In Computer Vision and Pattern Recognition

  1. Alan L. Yuille
  2. Luc Van Gool
  3. Dacheng Tao
  4. Ling Shao
  5. Ming-Hsuan Yang
  6. Xiaogang Wang
  7. Bernt Schiele
  8. Trevor Darrell

In Optimization & Training

  1. Soham De
  2. Samuel L. Smith
  3. Aurélien Lucchi
  4. Thomas Hofmann
  5. Peter Richtárik
  6. Zhiyuan Li
  7. Simon Lacoste-Julien
  8. Alan L. Yuille

Citations in the corpus