paper-with-me

홈 › Papers

Cache Me if You Can: Accelerating Diffusion Models through Block Caching

2023-12-06 · CVPR 2024 1 · Felix Wimbauer, Bichen Wu, Edgar Schoenfeld, Xiaoliang Dai, Ji Hou, Zijian He, Artsiom Sanakoyeu, Peizhao Zhang, Sam Tsai, Jonas Kohler, Christian Rupprecht, Daniel Cremers, Peter Vajda, Jialiang Wang

Diffusion models have recently revolutionized the field of image synthesis due to their ability to generate photorealistic images. However, one of the major drawbacks of diffusion models is that the image generation process is costly. A large image-to-image network has to be applied many times to iteratively refine an image from random noise. While many recent works propose techniques to reduce the number of required steps, they generally treat the underlying denoising network as a black box. In this work, we investigate the behavior of the layers within the network and find that 1) the layers' output changes smoothly over time, 2) the layers show distinct patterns of change, and 3) the change from step to step is often very small. We hypothesize that many layer computations in the denoising network are redundant. Leveraging this, we introduce block caching, in which we reuse outputs from layer blocks of previous steps to speed up inference. Furthermore, we propose a technique to automatically determine caching schedules based on each block's changes over timesteps. In our experiments, we show through FID, human evaluation and qualitative analysis that Block Caching allows to generate images with higher visual quality at the same computational cost. We demonstrate this for different state-of-the-art models (LDM and EMU) and solvers (DDIM and DPM).

📄 PDF Abstract BibTeX arXiv:2312.03209

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingImage Generation

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…
SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

BWCache: Accelerating Video Diffusion Transformers through Block-Wise Caching

2025-09-17 · Hanshuai Cui, Zhiqing Tang, Zhifei Xu, Zhi Yao 외 arxiv

Recent advancements in Diffusion Transformers (DiTs) have established them as the state-of-the-art method for video generation. However, their inherently sequential denoising process results in inevitable latency, limiti…

Video Generation

Block-wise Adaptive Caching for Accelerating Diffusion Policy

2025-06-16 · Kangye Ji, Yuan Meng, Hanyun Cui, Ye Li 외

Diffusion Policy has demonstrated strong visuomotor modeling capabilities, but its high computational cost renders it impractical for real-time robotic control. Despite huge redundancy across repetitive denoising steps, …

Action GenerationDenoisingVision-Language-Action

SenCache: Accelerating Diffusion Model Inference via Sensitivity-Aware Caching

2026-02-27 · Yasaman Haghighi, Alexandre Alahi arxiv

Diffusion models achieve state-of-the-art video generation quality, but their inference remains expensive due to the large number of sequential denoising steps. This has motivated a growing line of research on accelerati…

Video Generation

OTCache: Optimal Transport for Geometry-Aware Caching in Diffusion Models

2026-06-30 · Huanlin Gao, Fang Zhao, Qiang Hui, Fuyuan Shi 외 arxiv

We propose OTCache, a training-free framework for accelerating diffusion sampling via caching schedule prediction. Existing graph-based caching methods reduce redundant computation by optimizing shortest-path objectives,…

No Cache Left Idle: Accelerating diffusion model via Extreme-slimming Caching

2025-12-14 · Tingyan Wen, Haoyu Li, Yihuang Chen, Xing Zhou 외 arxiv

Diffusion models achieve remarkable generative quality, but computational overhead scales with step count, model depth, and sequence length. Feature caching is effective since adjacent timesteps yield highly similar feat…