🤖 AI Summary
This paper addresses the low residual propagation efficiency and limited generation quality in denoising diffusion models. We propose ShortDF, the first diffusion model that formulates the reverse denoising process as an optimal path planning problem on a weighted directed graph, leveraging graph-theoretic shortest-path modeling. ShortDF enables global residual propagation through differentiable graph optimization and jointly learns both the initial residual and edge weights. Integrated within the DDIM framework, it supports end-to-end training. On multiple benchmark datasets, ShortDF reduces sampling steps by up to 56.5% (2.3× speedup) while improving FID by 12.6%, significantly enhancing both generation speed and fidelity. These results empirically validate the effectiveness of incorporating graph-structured priors into diffusion dynamics modeling.
📝 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.