Variational Rejection Sampling

By Aditya Grover, Ramki Gummadi, Miguel L'azaro-Gredilla, Dale Schuurmans, Stefano Ermon. 2018

37 citations recorded by the source corpus.

Learning latent variable models with stochastic variational inference is challenging when the approximate posterior is far from the true posterior, due to high variance in the gradient estimates. We propose a novel rejection sampling step that discards samples from the variational posterior which are assigned low likelihoods by the model. Our approach provides an arbitrarily accurate approximation of the true posterior at the expense of extra computation. Using a new gradient estimator for the resulting unnormalized proposal distribution, we achieve average improvements of 3.71 nats and 0.21 nats over state-of-the-art single-sample and multi-sample alternatives respectively for estimating marginal log-likelihoods using sigmoid belief networks on the MNIST dataset.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Probabilistic & Bayesian Methods

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. Stefano Ermon
  3. Sergey Levine
  4. Quoc V. Le
  5. Ruslan Salakhutdinov
  6. Mohit Bansal
  7. Kyunghyun Cho
  8. Pieter Abbeel

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Trevor Darrell
  3. Stefano Ermon
  4. Dacheng Tao
  5. Ming-Hsuan Yang
  6. Jitendra Malik
  7. Xiaogang Wang
  8. Yoshua Bengio

In Probabilistic & Bayesian Methods

  1. Stefano Ermon
  2. Yoshua Bengio
  3. Jiaming Song
  4. Jascha Narain Sohl-Dickstein
  5. Andriy Mnih
  6. Aditya Grover
  7. Laurent Dinh
  8. Hugo Larochelle

Citations in the corpus