Auto-Encoding Variational Bayes

By Diederik P. Kingma, Max Welling. International Conference on Learning Representations, 2013

16,816 citations recorded by the source corpus.

Abstract: How can we perform efficient inference and learning in directed probabilistic models, in the presence of continuous latent variables with intractable posterior distributions, and large datasets? We introduce a stochastic variational inference and learning algorithm that scales to large datasets and, under some mild differentiability conditions, even works in the intractable case. Our contributions is two-fold. First, we show that a reparameterization of the variational lower bound yields a lower bound estimator that can be straightforwardly optimized using standard stochastic gradient methods. Second, we show that for i.i.d. datasets with continuous latent variables per datapoint, posterior inference can be made especially efficient by fitting an approximate inference model (also called a recognition model) to the intractable posterior using the proposed lower bound estimator. Theoretical advantages are reflected in experimental results.

Subfields: Artificial Intelligence, Generative Models, Probabilistic & Bayesian Methods

View Paper: https://arxiv.org/abs/1312.6114

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. Sergey Levine
  3. Mohit Bansal
  4. Jianfeng Gao
  5. Quoc V. Le
  6. Percy Liang
  7. Ruslan Salakhutdinov
  8. Kyunghyun Cho

In Generative Models

  1. Stefano Ermon
  2. Yoshua Bengio
  3. Jun-Yan Zhu
  4. Arash Vahdat
  5. Jiaming Song
  6. Richard Zhang
  7. Jan Kautz
  8. Aaron C. Courville

In Probabilistic & Bayesian Methods

  1. Yoshua Bengio
  2. Stefano Ermon
  3. David M. Blei
  4. Max Welling
  5. Zoubin Ghahramani
  6. Richard E. Turner
  7. Diederik P. Kingma
  8. Yarin Gal

Citations in the corpus