This work introduces Error-Propagation-Aware Cache (EpaCache), a training-free caching policy that adaptively allocates the reuse budget on timesteps with lower downstream impact and consistently improves the latency--fidelity trade-off over existing caching methods.
Abstract
Diffusion-based visual generative models deliver strong image and video synthesis quality but incur high inference costs because sequential samplers repeatedly evaluate large networks. Caching-based methods reduce inference latency by reusing intermediate computations across adjacent timesteps. However, existing cache controllers rely primarily on local temporal variation and overlook the trajectory-level consequences of cache reuse. We introduce Error-Propagation-Aware Cache (EpaCache), a training-free caching policy that adaptively allocates the reuse budget on timesteps with lower downstream impact. Experiments on image and video synthesis models demonstrate that EpaCache consistently improves the latency--fidelity trade-off over existing caching methods. On FLUX.1-dev, EpaCache outperforms the prior state-of-the-art caching method in both latency and fidelity, reducing inference time from $11.7$ s to $11.3$ s while improving PSNR from $21.4$ to $22.8$. On HunyuanVideo, EpaCache achieves a $2.63\times$ speedup over uncached inference and improves SSIM from $0.891$ to $0.905$ over the prior state-of-the-art method at matched latency.
The proposed Global-Impact Cache identifies an optimal reuse policy in the inner objective while aligning the error-weighting function with generation quality loss in the outer objective and reformulates cache policy search as a bilevel optimization problem.
Xichen Ye, Yifan Wu, Zhi-Kang Xie et al.· 0 citations
LinCa decomposes cached features into sub-components with distinct continuity properties via a lightweight invertible network and applies differentiated prediction orders matched to each component, forming a unified Decompose-Predict-Reconstruct pipeline.
Jin-Shan Liu, Hao-Ran Qin, Xiao-Bing Tu et al.· 0 citations
The Golden Path Hypothesis is introduced: under fixed inference conditions, prompt-independent cache schedules can achieve final-output quality comparable to the best prompt-specific schedules across prompts, and the resulting golden paths transfer across prompts and datasets, and can be tuned to the desired quality ob...
Dong Wang, Wen-Wu Tang, Francesco Corti et al.· 0 citations
Efficient video generation requires reducing the quadratic cost of self-attention over long spatio-temporal token sequences. Existing efficient-attention methods typically apply the same computation pattern to every token, even though denoising difficulty varies substantially across video regions and evolves throughout...
Olga Zatsarynna, Denis Korzhenkov, Juergen Gall et al.· 0 citations
CebBooster is proposed, a training-free extrapolation framework based on Chebyshev polynomial theory that achieves stable and efficient acceleration for DiTs and outperforming existing training-free baselines under diverse generation tasks and resolutions.
Cheng-Jie Lu, Tianchi Deng, Zheng He et al.· 0 citations
QuantWM is presented, a training-free 2-bit KV cache quantization framework for video world models that significantly improves visual quality and temporal consistency, while outperforming existing methods across benchmarks with up to 6.20 KV cache memory compression and limited additional overhead.
Jia-Qi Zhao, Xiao-Bin Hu, Bo Yin et al.· 0 citations
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.