mlsanityData to 14 Oct 2026

Approximate Inference with Amortised MCMC

arXiv 1702.08343 ↗First posted 27 Feb 2017stat.ML cs.LGcited by 23

Not on the map. Why?

Abstract (arXiv)

We propose a novel approximate inference algorithm that approximates a target distribution by amortising the dynamics of a user-selected MCMC sampler. The idea is to initialise MCMC using samples from an approximation network, apply the MCMC operator to improve these samples, and finally use the samples to update the approximation network thereby improving its quality. This provides a new generic framework for approximate inference, allowing us to deploy highly complex, or implicitly defined approximation families with intractable densities, including approximations produced by warping a source of randomness through a deep neural network. Experiments consider image modelling with deep generative models as a challenging test for the method. Deep models trained using amortised MCMC are shown to generate realistic looking samples as well as producing diverse imputations for images with regions of missing pixels.

Key facts. Cited by 23 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 7; 2022: 5; 2023: 4; 2024: 2; 2025: 3; 2026: 2.

23 papers.

Sort:

By area:

  1. 2021MCMC Variational Inference via Uncorrected Hamiltonian Annealingcited by 39
  2. 2022A Variational Perspective on Generative Flow Networkscited by 39
  3. 2022Sliced Wasserstein Variational Inferencecited by 18
  4. 2021Nested Variational Inferencecited by 14
  5. 2021Surrogate Likelihoods for Variational Annealed Importance Samplingcited by 14
  6. 2023Learning Energy-Based Prior Model with Diffusion-Amortized MCMCcited by 13
  7. 2023Fully Bayesian Autoencoders with Latent Sparse Gaussian Processescited by 9
  8. 2021Learning Proposals for Probabilistic Programs with Inference Combinatorscited by 6
  9. 2022Markov Chain Score Ascent: A Unifying Framework of Variational Inference with Markovian Gradientscited by 6
  10. 2024SPO: Sequential Monte Carlo Policy Optimisationcited by 5
  11. 2023Convergence Analysis of Stochastic Gradient Descent with MCMC Estimatorscited by 3
  12. 2021Reparameterized Sampling for Generative Adversarial Networkscited by 2
11 more
  1. 2022Langevin Autoencoders for Learning Deep Latent Variable Modelscited by 2
  2. 2023Conditional Sampling of Variational Autoencoders via Iterated Approximate Ancestral Samplingcited by 2
  3. 2022Structured Recognition for Generative Models with Explaining Awaycited by 1
  4. 2025Bayesian Computation in Deep Learningcited by 1
  5. 2021Variational Rejection Particle Filteringcited by 0
  6. 2021High-Dimensional Inference in Bayesian Networkscited by 0
  7. 2024Accelerated Markov Chain Monte Carlo Using Adaptive Weighting Schemecited by 0
  8. 2025Single-Step Consistent Diffusion Samplerscited by 0
  9. 2025Learning Extrapolative Sequence Transformations from Markov Chainscited by 0
  10. 2026Refinement-based Flow Policy Optimizationcited by 0
  11. 2026Amortised Inference through One-Step Implicit Samplingcited by 0