On Fast Dropout and its Applicability to Recurrent Networks

By Justin Bayer, Christian Osendorfer, Nutan Chen, Sebastian Urban, Patrick van der Smagt. 2013

66 citations recorded by the source corpus.

Recurrent Neural Networks (RNNs) are rich models for the processing of sequential data. Recent work on advancing the state of the art has been focused on the optimization or modelling of RNNs, mostly motivated by adressing the problems of the vanishing and exploding gradients. The control of overfitting has seen considerably less attention. This paper contributes to that by analyzing fast dropout, a recent regularization method for generalized linear models and neural networks from a back-propagation inspired perspective. We show that fast dropout implements a quadratic form of an adaptive, per-parameter regularizer, which rewards large weights in the light of underfitting, penalizes them for overconfident predictions and vanishes at minima of an unregularized training loss. The derivatives of that regularizer are exclusively based on the training error signal. One consequence of this is the absense of a global weight attractor, which is particularly appealing for RNNs, since the dynamics are not biased towards a certain regime. We positively test the hypothesis that this improves the performance of RNNs on four musical data sets.

Subfields: Artificial Intelligence, Statistical and Nonlinear Physics

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. Mohit Bansal
  3. Jianfeng Gao
  4. Kyunghyun Cho
  5. Quoc V. Le
  6. Graham Neubig
  7. Chunyuan Li
  8. Ruslan Salakhutdinov

In Statistical and Nonlinear Physics

  1. Kyunghyun Cho
  2. Yoshua Bengio
  3. J. Urgen Schmidhuber
  4. Caglar Gulcehre
  5. Ilya Sutskever
  6. Yarin Gal
  7. Dacheng Tao
  8. Razvan Pascanu

Citations in the corpus