Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics
On the map: Diffusion models → Inverse problems and image restoration
Abstract (arXiv)
Given a noisy linear measurement y = Ax + xi of a distribution p(x), and a good approximation to the prior p(x), when can we sample from the posterior 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). In this regime, Langevin dynamics yields posterior samples when the exact scores of 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 L2 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 L4 bound on the score error.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Inverse problems and image restoration, one of 14 directions in Diffusion models. Builds on 5 of its 47 references that are in the map. First posted on arXiv 30 Oct 2025.
Builds on
5 of 47 references.
Closest ancestors · 2
Same direction, newest first
- 2024Decoupled Data Consistency with Diffusion Purification for Image Restoration10 Mar
- 2023Solving Linear Inverse Problems Provably via Posterior Sampling with Latent Diffusion Models2 Jul
Other references · 3
- 2020Denoising Diffusion Implicit Modelscited by 9,781
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 445
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026On the Robustness of Langevin Dynamics to Score Function Errorcited by 3
- 2026Query Lower Bounds for Diffusion Samplingcited by 2
- 2026The tractability landscape of diffusion alignment: regularization, rewards, and computational primitivescited by 2
- 2026Composing diffusion priors with explicit physical context via generative Gibbs samplingcited by 1
- 2026Omega: Operator-based Mixture Ensemble for Generative Assimilationcited by 0
- 2026Omega: Operator-based Mixture Ensemble for Generative Assimilation18 Jun 2026
- 2026The tractability landscape of diffusion alignment: regularization, rewards, and computational primitives12 May 2026
- 2026Composing diffusion priors with explicit physical context via generative Gibbs sampling11 May 2026
- 2026Query Lower Bounds for Diffusion Sampling12 Apr 2026
- 2026On the Robustness of Langevin Dynamics to Score Function Error11 Mar 2026
Similar, not cited
Close in wording, no citation either way
- 2025Efficient Approximate Posterior Sampling with Annealed Langevin Monte Carlo
- 2026Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees
- 2026Diffusion Removes Langevin's Conditioning Dependence: A Sharp Gaussian Analysis
- 2026Kinetic Langevin Meets Split Gibbs: Accelerated Posterior Sampling for Imaging Inverse Problems with Diffusion Priors
- 2026Annealed Langevin Posterior Sampling (ALPS): A Rapid Algorithm for Image Restoration with Multiscale Energy Models
- 2024Divide-and-Conquer Posterior Sampling for Denoising Diffusion Priors
- 2024Posterior sampling via Langevin dynamics based on generative priors
- 2026Discrete Langevin-Inspired Posterior Sampling