English

Optimizing for the Shortest Path in Denoising Diffusion Model

Computer Vision and Pattern Recognition 2025-03-14 v3

Abstract

In this research, we propose a novel denoising diffusion model based on shortest-path modeling that optimizes residual propagation to enhance both denoising efficiency and quality. Drawing on Denoising Diffusion Implicit Models (DDIM) and insights from graph theory, our model, termed the Shortest Path Diffusion Model (ShortDF), treats the denoising process as a shortest-path problem aimed at minimizing reconstruction error. By optimizing the initial residuals, we improve the efficiency of the reverse diffusion process and the quality of the generated samples. Extensive experiments on multiple standard benchmarks demonstrate that ShortDF significantly reduces diffusion time (or steps) while enhancing the visual fidelity of generated samples compared to prior arts. This work, we suppose, paves the way for interactive diffusion-based applications and establishes a foundation for rapid data generation. Code is available at https://github.com/UnicomAI/ShortDF.

Keywords

Cite

@article{arxiv.2503.03265,
  title  = {Optimizing for the Shortest Path in Denoising Diffusion Model},
  author = {Ping Chen and Xingpeng Zhang and Zhaoxiang Liu and Huan Hu and Xiang Liu and Kai Wang and Min Wang and Yanlin Qian and Shiguo Lian},
  journal= {arXiv preprint arXiv:2503.03265},
  year   = {2025}
}

Comments

Accepet by CVPR 2025 (10 pages, 6 figures)

R2 v1 2026-06-28T22:07:28.130Z