Amortised Inference through One-Step Implicit Sampling
Not on the map. Why?
Abstract (arXiv)
Efficient sampling from Bayesian posterior distributions in high dimensions remains a hard problem, despite advances in theory and algorithms. Multiple steps are usually required to draw unbiased samples, for example, iterations of an MCMC algorithm or integration steps in a diffusion-based amortised sampler. However, scalable one-step amortised inference remains a challenging open problem. In this work, we build upon recent progress in data-driven generative modelling to offer a possible solution for one-step amortised sampling. Our one-step implicit sampler (OSIS) uses short-time MCMC dynamics to define a local target for the evolution of an implicitly modelled distribution. In the asymptotic limit, the modelled distribution is a fixed point of the MCMC kernel and thus samples from the target. We analyse the convergence properties of OSIS and show connections with other generative modelling and sampling algorithms. We study various design choices and show that OSIS performs well compared to multi-step amortised samplers and non-amortised MCMC baselines while being far more efficient at sampling time.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 60 of its 95 references that are in the map. First posted on arXiv 8 Oct 2026.
Builds on
60 of 95 references.
References · 60
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2020DiffWave: A Versatile Diffusion Model for Audio Synthesiscited by 1,354
- 2023ImageReward: Learning and Evaluating Human Preferences for Text-to-Image Generationcited by 1,045
- 2024Simple and Effective Masked Diffusion Language Modelscited by 848
- 2022Equivariant Diffusion for Molecule Generation in 3Dcited by 677
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
38 more
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
- 2019Generalized Sliced Wasserstein Distancescited by 208
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
- 2021Path Integral Sampler: a stochastic control approach for samplingcited by 181
- 2023Denoising Diffusion Samplerscited by 149
- 2022An optimal control perspective on diffusion-based generative modelingcited by 147
- 2022Flow Annealed Importance Sampling Bootstrapcited by 127
- 2016Learning in Implicit Generative Modelscited by 125
- 2026Generative Modeling via Driftingcited by 116
- 2023Improved sampling via learned diffusionscited by 104
- 2023A theory of continuous generative flow networkscited by 101
- 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 85
- 2025Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matchingcited by 85
- 2021Large-Scale Wasserstein Gradient Flowscited by 77
- 2020VarGrad: A Low-Variance Gradient Estimator for Variational Inferencecited by 75
- 2024NETS: A Non-Equilibrium Transport Samplercited by 69
- 2020Targeted free energy estimation via learned mappingscited by 67
- 2021Minibatch optimal transport distances; analysis and applicationscited by 65
- 2025The GAN is dead; long live the GAN! A Modern GAN Baselinecited by 59
- 2024Beyond ELBOs: A Large-Scale Evaluation of Variational Methods for Samplingcited by 56
- 2024Inference-Time Alignment of Diffusion Models with Direct Noise Optimizationcited by 55
- 2024Improved off-policy training of diffusion samplerscited by 48
- 2024Sequential Controlled Langevin Diffusionscited by 48
- 2017A-NICE-MC: Adversarial Training for MCMCcited by 38
- 2022Stochastic Optimal Control for Collective Variable Free Sampling of Molecular Transition Pathscited by 38
- 2017Learning to Draw Samples with Amortized Stein Variational Gradient Descentcited by 28
- 2025No Trick, No Treat: Pursuits and Challenges Towards Simulation-free Training of Neural Samplerscited by 28
- 2026Sinkhorn-Drifting Generative Modelscited by 24
- 2026One-Step Generative Modeling via Wasserstein Gradient Flowscited by 24
- 2017Approximate Inference with Amortised MCMCcited by 23
- 2021Local-Global MCMC kernels: the best of both worldscited by 22
- 2019A Contrastive Divergence for Combining Variational Inference and MCMCcited by 21
- 2024Deep MMD Gradient Flow without adversarial trainingcited by 19
- 2025From discrete-time policies to continuous-time diffusion samplers: Asymptotic equivalences and faster trainingcited by 19
- 2022Sliced Wasserstein Variational Inferencecited by 18
- 2025Outsourced diffusion sampling: Efficient posterior inference in latent spaces of generative modelscited by 17
- 2024(De)-regularized Maximum Mean Discrepancy Gradient Flowcited by 16
- 2025Source-Guided Flow Matchingcited by 13
50 most cited of 60 All 60 (JSON)
Built on by
Not cited yet.