English

Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics

Machine Learning 2025-11-19 v2 Artificial Intelligence Data Structures and Algorithms Statistics Theory Machine Learning Statistics Theory

Abstract

Given a noisy linear measurement y=Ax+ξy = Ax + \xi of a distribution p(x)p(x), and a good approximation to the prior p(x)p(x), when can we sample from the posterior p(xy)p(x \mid y)? Posterior sampling provides an accurate and fair framework for tasks such as inpainting, deblurring, and MRI reconstruction, and several heuristics attempt to approximate it. Unfortunately, approximate posterior sampling is computationally intractable in general. To sidestep this hardness, we focus on (local or global) log-concave distributions p(x)p(x). In this regime, Langevin dynamics yields posterior samples when the exact scores of p(x)p(x) are available, but it is brittle to score--estimation error, requiring an MGF bound (sub-exponential error). By contrast, in the unconditional setting, diffusion models succeed with only an L2L^2 bound on the score error. We prove that combining diffusion models with an annealed variant of Langevin dynamics achieves conditional sampling in polynomial time using merely an L4L^4 bound on the score error.

Keywords

Cite

@article{arxiv.2510.26324,
  title  = {Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics},
  author = {Zhiyang Xun and Shivam Gupta and Eric Price},
  journal= {arXiv preprint arXiv:2510.26324},
  year   = {2025}
}

Comments

NeurIPS 2025

R2 v1 2026-07-01T07:13:32.914Z