扩散模型是稀疏恢复的可证明高效先验
Diffusion Models are Provably Efficient Priors for Sparse Recovery
Ivan Lee · Xingyu Xu · Yuejie Chi
中文摘要
扩散模型通过捕捉和生成复杂数据分布样本改变了生成建模。这一成功激发了将预训练扩散模型用作成像与传感中高度不适定逆问题的表达性先验的浓厚兴趣。尽管经验性能强劲,该方法的理论理解仍然有限:现有保证通常是渐近的,或在最坏情况下需要 prohibitive 的计算成本。针对这一空白,研究从少量线性测量中进行稀疏恢复——压缩感知中的经典问题。结果表明,给定一个准确捕捉促进稀疏性的 Bernoulli-Gaussian 先验的扩散模型,似然引导的退火 Langevin 采样器可在多项式时间内可证明地恢复稀疏信号,并对一大类随机和确定性传感矩阵具有接近最优的样本复杂度。当信号确实来自假设先验时,进一步建立了最终去噪步骤后后验采样的全变差保证。这些结果为具有扩散先验的统计和计算高效逆求解器奠定了理论基础。
关键要点
- 01现有扩散先验用于逆问题的理论保证多为渐近或最坏情况计算成本过高
- 02研究少量线性测量的稀疏恢复,假设扩散模型准确捕捉 Bernoulli-Gaussian 先验
- 03似然引导退火 Langevin 采样器在多项式时间内可证明恢复稀疏信号
- 04对随机和确定性传感矩阵达到接近最优样本复杂度
- 05信号来自假设先验时,最终去噪后后验采样具有全变差保证
解读
尚无解读。
原始英文摘要
arXiv:2611.24602v1 Announce Type: new 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.