Hierarchical Variational Models

By Rajesh Ranganath, Dustin Tran, David M. Blei. 2015

365 citations recorded by the source corpus.

Black box variational inference allows researchers to easily prototype and evaluate an array of models. Recent advances allow such algorithms to scale to high dimensions. However, a central question remains: How to specify an expressive variational distribution that maintains efficient computation? To address this, we develop hierarchical variational models (HVMs). HVMs augment a variational approximation with a prior on its parameters, which allows it to capture complex structure for both discrete and continuous latent variables. The algorithm we develop is black box, can be used for any HVM, and has the same computational efficiency as the original approximation. We study HVMs on a variety of deep discrete latent variable models. HVMs generalize other expressive variational distributions and maintains higher fidelity to the posterior.

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. Sergey Levine
  2. Yoshua Bengio
  3. Stefano Ermon
  4. Ruslan Salakhutdinov
  5. Max Welling
  6. Mohit Bansal
  7. Pieter Abbeel
  8. Quoc V. Le

In Computer Vision and Pattern Recognition

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

In Probabilistic & Bayesian Methods

  1. David M. Blei
  2. Max Welling
  3. Stefano Ermon
  4. Qiang Liu
  5. Rajesh Ranganath
  6. Richard E. Turner
  7. Diederik P. Kingma
  8. Stephan Mandt

Citations in the corpus