Learning Model Reparametrizations: Implicit Variational Inference by Fitting MCMC distributions

By Michalis K. Titsias. 2017

23 citations recorded by the source corpus.

We introduce a new algorithm for approximate inference that combines reparametrization, Markov chain Monte Carlo and variational methods. We construct a very flexible implicit variational distribution synthesized by an arbitrary Markov chain Monte Carlo operation and a deterministic transformation that can be optimized using the reparametrization trick. Unlike current methods for implicit variational inference, our method avoids the computation of log density ratios and therefore it is easily applicable to arbitrary continuous and differentiable models. We demonstrate the proposed algorithm for fitting banana-shaped distributions and for training variational autoencoders.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

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. Andrew Gordon Wilson
  2. Pavel Izmailov
  3. Dmitry P. Vetrov
  4. Wesley J. Maddox
  5. Timur Garipov
  6. Polina Kirichenko
  7. Yibo Yang
  8. Stephan Mandt

In Computer Vision and Pattern Recognition

  1. Andrew Gordon Wilson
  2. Pavel Izmailov
  3. Dmitry P. Vetrov
  4. Polina Kirichenko
  5. Wesley J. Maddox
  6. Timur Garipov
  7. Paris Perdikaris
  8. Yibo Yang

Citations in the corpus