Deep AutoRegressive Networks

By Karol Gregor, Ivo Danihelka, Andriy Mnih, Charles Blundell, Daan Wierstra. 2013

307 citations recorded by the source corpus.

We introduce a deep, generative autoencoder capable of learning hierarchies of distributed representations from data. Successive deep stochastic hidden layers are equipped with autoregressive connections, which enable the model to be sampled from quickly and exactly via ancestral sampling. We derive an efficient approximate parameter estimation method based on the minimum description length (MDL) principle, which can be seen as maximising a variational lower bound on the log-likelihood, with a feedforward neural network implementing approximate inference. We demonstrate state-of-the-art generative performance on a number of classic data sets, including several UCI data sets, MNIST and Atari 2600 games.

Subfields: Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics, Generative Models

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

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

In Statistical and Nonlinear Physics

  1. Yoshua Bengio
  2. Arash Vahdat
  3. Stefano Ermon
  4. Diederik P. Kingma
  5. Max Welling
  6. Jun Zhu
  7. Yang Song
  8. Sergey Levine

In Generative Models

  1. Stefano Ermon
  2. Yoshua Bengio
  3. Diederik P. Kingma
  4. Arash Vahdat
  5. Max Welling
  6. Pieter Abbeel
  7. Aäron van den Oord
  8. Aaron C. Courville

Citations in the corpus