无需梯度信息,用粒子搜索法高效求解图像与科学逆问题
Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes
- 不依赖梯度,通过约束优化主动寻找最优粒子
- 在图像和科学逆问题上效果接近有梯度方法,优于其他无梯度方法
- 适合缺乏正向观测模型的逆问题场景
扩散模型因其建模复杂数据分布的能力,成为求解逆问题的强大生成工具。然而,现有方法通常需要完整的正向观测过程知识以计算梯度进行引导采样,限制了其在该信息不可用场景下的应用。本文提出一种全新的无梯度方法——约束粒子搜索(Constrained Particle Seeking, CPS),利用所有候选粒子信息,在与无条件先验高密度区域对齐的约束下主动搜索最优粒子。不同于以往被动选择候选的方法,CPS将逆问题重构为约束优化任务,实现更灵活高效的粒子搜索。实验表明,CPS能有效解决图像与科学逆问题,在性能上接近基于梯度的方法,显著优于其他无梯度方法。代码已公开于 https://github.com/deng-ai-lab/CPS。
原文摘要 · Abstract (English)
Diffusion models have gained prominence as powerful generative tools for solving inverse problems due to their ability to model complex data distributions. However, existing methods typically rely on complete knowledge of the forward observation process to compute gradients for guided sampling, limiting their applicability in scenarios where such information is unavailable. In this work, we introduce \textbf{\emph{Constrained Particle Seeking (CPS)}}, a novel gradient-free approach that leverages all candidate particle information to actively search for the optimal particle while incorporating constraints aligned with high-density regions of the unconditional prior. Unlike previous methods that passively select promising candidates, CPS reformulates the inverse problem as a constrained optimization task, enabling more flexible and efficient particle seeking. We demonstrate that CPS can effectively solve both image and scientific inverse problems, achieving results comparable to gradient-based methods while significantly outperforming gradient-free alternatives. Code is available at https://github.com/deng-ai-lab/CPS.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。