Dropout Training as Adaptive Regularization

By Stefan Wager, Sida I. Wang, Percy Liang. 2013

645 citations recorded by the source corpus.

Dropout and other feature noising schemes control overfitting by artificially corrupting the training data. For generalized linear models, dropout performs a form of adaptive regularization. Using this viewpoint, we show that the dropout regularizer is first-order equivalent to an L2 regularizer applied after scaling the features by an estimate of the inverse diagonal Fisher information matrix. We also establish a connection to AdaGrad, an online learning algorithm, and find that a close relative of AdaGrad operates by repeatedly solving linear dropout-regularized problems. By casting dropout as regularization, we develop a natural semi-supervised algorithm that uses unlabeled data to create a better adaptive regularizer. We apply this idea to document classification tasks, and show that it consistently boosts the performance of dropout training, improving on state-of-the-art results on the IMDB reviews dataset.

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. Yoshua Bengio
  2. Percy Liang
  3. Sergey Levine
  4. Mohit Bansal
  5. Quoc V. Le
  6. Jianfeng Gao
  7. Ruslan Salakhutdinov
  8. Dacheng Tao

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Xiaogang Wang
  4. Trevor Darrell
  5. Ming-Hsuan Yang
  6. Jitendra Malik
  7. Andrea Vedaldi
  8. Andrew Zisserman

In Optimization & Training

  1. Yoshua Bengio
  2. Aaron C. Courville
  3. Yarin Gal
  4. Ruslan Salakhutdinov
  5. Ian J. Goodfellow
  6. Li Deng
  7. Quoc V. Le
  8. Percy Liang

Citations in the corpus