Pith. sign in

REVIEW 2 cited by

Approximate Inference with Amortised MCMC

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1702.08343 v2 pith:NL2KRLBH submitted 2017-02-27 stat.ML cs.LG

classification stat.MLcs.LG
keywords mcmcsamplesapproximateapproximationdeepinferencenetworkamortised
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Extrapolative Sequence Transformations from Markov Chains

    cs.LG 2025-05 conditional novelty 6.0 of 10

    MCMC search trajectories, pruned to improving transitions, are distilled into an autoregressive model that extrapolates sequence scores beyond both the training data and the search itself.

  2. Single-Step Consistent Diffusion Samplers

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Consistent diffusion samplers (CDDS and SCDS) generate samples from unnormalized densities in one or two neural network evaluations, instead of the hundreds used by standard diffusion samplers.

Pith tools