Amortised Inference through One-Step Implicit Sampling

Vincent Pauline, Kirill Tamogashev, Arran Carter, Sanghyeok Choi, Stefan Bauer, Esmeralda S. Whitammer

Keywords: one-step samplers, amortised inference, sampling, MCMC, optimal transport

TL;DR: We study an algorithm for amortised sampling with one-step models with no explicit density, using MCMC as an evolution operator in the space of distributions.

Abstract: We study the problem of amortised sampling from an energy-based distribution without access to samples from the target. Inspired by recent ideas in data-based generative modelling, we propose an algorithm for training a one-step implicit generator by turning invariance of the modelled distribution under a target-invariant MCMC kernel into a training signal that progressively corrects the generator. Each step of training forms an empirical approximation to the modelled distribution by sampling from the model, evolves it towards the target distribution via a short MCMC chain, and minimises a divergence between the two empirical distributions, thus encouraging the model to move in the direction of the MCMC kernel's evolution. In the asymptotic limit, the modelled distribution is a fixed point of the kernel and thus samples from the target. We study various design choices for the MCMC kernel, the divergence, and the training procedure and show that the proposed one-step implicit sampler (OSIS) performs surprisingly well compared to multi-step amortised samplers and non-amortised MCMC baselines while being far more efficient at sampling time.

Email Sharing: We authorize the sharing of all author emails with Program Chairs.

Data Release: We authorize the release of our submission and author names to the public in the event of acceptance.

Submission Number: 147