Solving Linear Inverse Problems using Higher-Order Annealed Langevin Diffusion
Not on the map. Why?
Abstract (arXiv)
We propose a solution for linear inverse problems based on higher-order Langevin diffusion. More precisely, we propose pre-conditioned second-order and third-order Langevin dynamics that provably sample from the posterior distribution of our unknown variables of interest while being computationally more efficient than their first-order counterpart and the non-conditioned versions of both dynamics. Moreover, we prove that both pre-conditioned dynamics are well-defined and have the same unique invariant distributions as the non-conditioned cases. We also incorporate an annealing procedure that has the double benefit of further accelerating the convergence of the algorithm and allowing us to accommodate the case where the unknown variables are discrete. Numerical experiments in two different tasks in communications (MIMO symbol detection and channel estimation) and in three tasks for images showcase the generality of our method and illustrate the high performance achieved relative to competing approaches (including learning-based ones) while having comparable or lower computational complexity.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 36 of its 71 references that are in the map. First posted on arXiv 8 May 2023.
Builds on
36 of 71 references.
References · 36
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
- 2022Diffusion Posterior Sampling for General Noisy Inverse Problemscited by 1,375
- 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,036
- 2022Denoising Diffusion Restoration Modelscited by 951
- 2021ILVR: Conditioning Method for Denoising Diffusion Probabilistic Modelscited by 634
- 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 411
- 2020Deep Learning Techniques for Inverse Problems in Imagingcited by 290
- 2021Robust Compressed Sensing MRI with Deep Generative Priorscited by 284
24 more
- 2021Score-Based Generative Modeling with Critically-Damped Langevin Diffusioncited by 230
- 2021SNIPS: Solving Noisy Inverse Problems Stochasticallycited by 191
- 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
- 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
- 2022Parallel Diffusion Models of Operator and Image for Blind Inverse Problemscited by 113
- 2021Bayesian imaging using Plug & Play priors: when Langevin meets Tweediecited by 96
- 2017Learned D-AMP: Principled Neural Network based Compressive Image Recoverycited by 65
- 2018On sampling from a log-concave density using kinetic Langevin diffusionscited by 61
- 2020Unfolding WMMSE using Graph Neural Networks for Efficient Power Allocationcited by 61
- 2016Network Topology Inference from Spectral Templatescited by 58
- 2022MIMO Channel Estimation using Score-Based Generative Modelscited by 50
- 2019High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithmcited by 36
- 2022Theoretical Perspectives on Deep Learning Methods in Inverse Problemscited by 22
- 2020RE-MIMO: Recurrent and Permutation Equivariant Neural MIMO Detectioncited by 20
- 2022Accelerating Score-based Generative Models with Preconditioned Diffusion Samplingcited by 19
- 2016Ensemble preconditioning for Markov chain Monte Carlo simulationcited by 16
- 2022Annealed Langevin Dynamics for Massive MIMO Detectioncited by 16
- 2022On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descentcited by 14
- 2023Preconditioned Score-based Generative Modelscited by 6
- 2022Graph-based Algorithm Unfolding for Energy-aware Power Allocation in Wireless Networkscited by 5
- 2018Asynchronous Stochastic Quasi-Newton MCMC for Non-Convex Optimizationcited by 4
- 2020On the Generalised Langevin Equation for Simulated Annealingcited by 3
- 2022Accelerated massive MIMO detector based on annealed underdamped Langevin dynamicscited by 2
- 2022Detection by Sampling: Massive MIMO Detector based on Langevin Dynamicscited by 1
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 2.
6 papers.
- 2024Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Samplingcited by 23
- 2024Repulsive Latent Score Distillation for Solving Inverse Problemscited by 15
- 2025Non-Identical Diffusion Models in MIMO-OFDM Channel Generationcited by 1
- 2025Generative Diffusion Model Driven Massive Random Access in Massive MIMO Systemscited by 0
- 2026Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixturescited by 0
- 2026Generator-Guided Inverse Sampling for L'evy-Driven Generative Modelscited by 0
- 2026Generator-Guided Inverse Sampling for L'evy-Driven Generative Models11 Aug 2026
- 2026Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures15 May 2026
- 2025Non-Identical Diffusion Models in MIMO-OFDM Channel Generation1 Sep 2025
- 2025Generative Diffusion Model Driven Massive Random Access in Massive MIMO Systems18 May 2025
- 2024Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling24 Jul 2024
- 2024Repulsive Latent Score Distillation for Solving Inverse Problems24 Jun 2024