COMLMay 25, 2016

Asymptotically exact inference in differentiable generative models

arXiv:1605.07826v437 citations
Originality Highly original
AI Analysis

This provides an asymptotically exact inference method for generative models, addressing a bottleneck where Approximate Bayesian Computation might be used, which is significant for researchers in probabilistic modeling and simulation-based inference.

The paper tackles the problem of performing efficient and asymptotically exact inference in differentiable generative models when conditioning on observations, presenting a constrained Hamiltonian Monte Carlo method that leverages the smooth geometry of the manifold of inputs consistent with outputs, and validates it across diverse models.

Many generative models can be expressed as a differentiable function of random inputs drawn from some simple probability density. This framework includes both deep generative architectures such as Variational Autoencoders and a large class of procedurally defined simulator models. We present a method for performing efficient MCMC inference in such models when conditioning on observations of the model output. For some models this offers an asymptotically exact inference method where Approximate Bayesian Computation might otherwise be employed. We use the intuition that inference corresponds to integrating a density across the manifold corresponding to the set of inputs consistent with the observed outputs. This motivates the use of a constrained variant of Hamiltonian Monte Carlo which leverages the smooth geometry of the manifold to coherently move between inputs exactly consistent with observations. We validate the method by performing inference tasks in a diverse set of models.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes