轨迹链:通过图论规划解锁扩散模型固有的生成最优性 / Chain-of-Trajectories: Unlocking the Intrinsic Generative Optimality of Diffusion Models via Graph-Theoretic Planning
1️⃣ 一句话总结
这篇论文提出了一种名为‘轨迹链’的新方法,它通过图论规划来动态分配计算资源,让扩散模型在生成图像时能更智能地处理困难步骤,从而在提升生成质量与稳定性的同时减少不必要的计算开销。
Diffusion models operate in a reflexive System 1 mode, constrained by a fixed, content-agnostic sampling schedule. This rigidity arises from the curse of state dimensionality, where the combinatorial explosion of possible states in the high-dimensional noise manifold renders explicit trajectory planning intractable and leads to systematic computational misallocation. To address this, we introduce Chain-of-Trajectories (CoTj), a train-free framework enabling System 2 deliberative planning. Central to CoTj is Diffusion DNA, a low-dimensional signature that quantifies per-stage denoising difficulty and serves as a proxy for the high-dimensional state space, allowing us to reformulate sampling as graph planning on a directed acyclic graph. Through a Predict-Plan-Execute paradigm, CoTj dynamically allocates computational effort to the most challenging generative phases. Experiments across multiple generative models demonstrate that CoTj discovers context-aware trajectories, improving output quality and stability while reducing redundant computation. This work establishes a new foundation for resource-aware, planning-based diffusion modeling. The code is available at this https URL.
轨迹链:通过图论规划解锁扩散模型固有的生成最优性 / Chain-of-Trajectories: Unlocking the Intrinsic Generative Optimality of Diffusion Models via Graph-Theoretic Planning
这篇论文提出了一种名为‘轨迹链’的新方法,它通过图论规划来动态分配计算资源,让扩散模型在生成图像时能更智能地处理困难步骤,从而在提升生成质量与稳定性的同时减少不必要的计算开销。
源自 arXiv: 2603.14704