通过路径规划思想,让扩散模型采样更快更准,无需训练。
Denoising as Path Planning: Training-Free Acceleration of Diffusion Models with DPCache
- 将采样过程看作全局路径规划,动态选择关键步数
- 在FLUX上实现3.54倍加速且质量还优于全步基线
- 无需训练,适配多模型,适合部署时追求速度的场景
扩散模型在图像和视频生成中表现卓越,但多步迭代采样带来的计算开销限制了其实际应用。现有基于缓存的加速方法依赖固定或局部自适应调度,未考虑去噪轨迹的全局结构,常导致误差累积和视觉伪影。为此,我们提出DPCache——一种无需训练的加速框架,将扩散采样加速建模为全局路径规划问题。DPCache利用小规模校准集构建路径感知代价张量,量化跳过步数时对前序关键步的路径依赖误差。基于该张量,采用动态规划算法选择总代价最小的关键步序列,保障轨迹保真度。推理时仅在关键步进行完整计算,中间结果通过缓存特征高效预测。在DiT、FLUX和HunyuanVideo上的实验表明,DPCache实现强加速且质量损失极小:在4.87×加速下,ImageReward提升0.031;在3.54×加速下,超越全步基线0.028,验证了路径感知全局调度的有效性。代码已开源。
原文摘要 · Abstract (English)
Diffusion models have demonstrated remarkable success in image and video generation, yet their practical deployment remains hindered by the substantial computational overhead of multi-step iterative sampling. Among acceleration strategies, caching-based methods offer a training-free and effective solution by reusing or predicting features across timesteps. However, existing approaches rely on fixed or locally adaptive schedules without considering the global structure of the denoising trajectory, often leading to error accumulation and visual artifacts. To overcome this limitation, we propose DPCache, a novel training-free acceleration framework that formulates diffusion sampling acceleration as a global path planning problem. DPCache constructs a Path-Aware Cost Tensor from a small calibration set to quantify the path-dependent error of skipping timesteps conditioned on the preceding key timestep. Leveraging this tensor, DPCache employs dynamic programming to select an optimal sequence of key timesteps that minimizes the total path cost while preserving trajectory fidelity. During inference, the model performs full computations only at these key timesteps, while intermediate outputs are efficiently predicted using cached features. Extensive experiments on DiT, FLUX, and HunyuanVideo demonstrate that DPCache achieves strong acceleration with minimal quality loss, outperforming prior acceleration methods by $+$0.031 ImageReward at 4.87$\times$ speedup and even surpassing the full-step baseline by $+$0.028 ImageReward at 3.54$\times$ speedup on FLUX, validating the effectiveness of our path-aware global scheduling framework. Code is available at https://github.com/argsss/DPCache.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。