SyncAI.news, a Varaisys broadcasting
Diffusion Models are Provably Efficient Priors for Sparse Recovery
IL

Ivan Lee, Xingyu Xu, Yuejie Chi

· 1 min read

ResearcharXiv cs.LG

Diffusion Models are Provably Efficient Priors for Sparse Recovery

arXiv:2611.24602v1 Announce Type: cross Abstract: Diffusion models have transformed generative modeling through their ability to capture and generate samples from complex data distributions. This success has spurred substantial interest in using pretrained diffusion models as expressive priors for highly ill-posed inverse problems in imaging and sensing. Despite strong empirical performance, theoretical understanding of this approach remains limited: existing guarantees are often asymptotic or entail prohibitive computational costs in the worst case. In this paper, we address this gap by studying sparse recovery from a small number of linear measurements, a classical problem in compressed sensing. We show that, given an accurate diffusion model capturing a sparsity-promoting Bernoulli-Gaussian prior, a likelihood-guided annealed Langevin sampler provably recovers the sparse signal in polynomial time with near-optimal sample complexity for a broad family of random and deterministic sensing matrices. When the signal is indeed drawn from the postulated prior, we further establish total variation guarantees for posterior sampling after a final denoising step. These results lay a theoretical foundation for statistically and computationally efficient inverse solvers with diffusion priors.

Original source

This story was published by arXiv cs.LG and written by Ivan Lee, Xingyu Xu, Yuejie Chi. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News