REVIEW 2 cited by
DiTFastAttn: Attention Compression for Diffusion Transformer Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Diffusion Transformers (DiT) excel at image and video generation but face computational challenges due to the quadratic complexity of self-attention operators. We propose DiTFastAttn, a post-training compression method to alleviate the computational bottleneck of DiT. We identify three key redundancies in the attention computation during DiT inference: (1) spatial redundancy, where many attention heads focus on local information; (2) temporal redundancy, with high similarity between the attention outputs of neighboring steps; (3) conditional redundancy, where conditional and unconditional inferences exhibit significant similarity. We propose three techniques to reduce these redundancies: (1) Window Attention with Residual Sharing to reduce spatial redundancy; (2) Attention Sharing across Timesteps to exploit the similarity between steps; (3) Attention Sharing across CFG to skip redundant computations during conditional generation. We apply DiTFastAttn to DiT, PixArt-Sigma for image generation tasks, and OpenSora for video generation tasks. Our results show that for image generation, our method reduces up to 76% of the attention FLOPs and achieves up to 1.8x end-to-end speedup at high-resolution (2k x 2k) generation.
Forward citations
Cited by 2 Pith papers
-
Forecast then Calibrate: Feature Caching as ODE for Efficient Diffusion Transformers
A training-free predictor-corrector method that accelerates Diffusion Transformers by solving a feature-ODE, achieving large compute reductions with modest quality loss.
-
SADA: Stability-guided Adaptive Diffusion Acceleration
SADA accelerates ODE-based generative model sampling by adaptively combining step skipping and token pruning through a stability criterion, giving about 1.8 times speedup with minor fidelity loss.
Discussion (0). Sign in to comment.