arXiv:2610.12679v1 Announce Type: new Abstract: 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.
Amortised Inference through One-Step Implicit Sampling
Researchers posted arXiv:2610.12679v1, introducing a one-step implicit sampler (OSIS) that uses short-time MCMC dynamics to define a local target for an implicitly modelled distribution, which in the asymptotic limit becomes a fixed point of the MCMC kernel and therefore samples from the target. The authors report that OSIS performs well against multi-step amortised samplers and non-amortised MCMC baselines while being far more efficient at sampling time, and they analyse its convergence properties and connections to other generative modelling and sampling algorithms.
Run your AI side-project on zahid.host
EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.