Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes

Authors

  • Hongkun Dou Beihang University
  • Zike Chen Beihang University
  • Zeyu Li Beihang University
  • Hongjue Li Beihang University
  • Lijun Yang Beihang University
  • Yue Deng Beihang University Beijing Zhongguancun Academy

DOI:

https://doi.org/10.1609/aaai.v40i25.39227

Abstract

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 *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.

Downloads

Published

2026-03-14

How to Cite

Dou, H., Chen, Z., Li, Z., Li, H., Yang, L., & Deng, Y. (2026). Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes. Proceedings of the AAAI Conference on Artificial Intelligence, 40(25), 20870–20878. https://doi.org/10.1609/aaai.v40i25.39227

Issue

Section

AAAI Technical Track on Machine Learning II