Pith. sign in

REVIEW 19 cited by

Faster Diffusion via Temporal Attention Decomposition

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

arxiv 2404.02747 v3 pith:YNOANHRB submitted 2024-04-03 cs.CV

classification cs.CV
keywords attentionphasediffusioninferencemodelstgatecross-attentionimages
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We explore the role of attention mechanism during inference in text-conditional diffusion models. Empirical observations suggest that cross-attention outputs converge to a fixed point after several inference steps. The convergence time naturally divides the entire inference process into two phases: an initial phase for planning text-oriented visual semantics, which are then translated into images in a subsequent fidelity-improving phase. Cross-attention is essential in the initial phase but almost irrelevant thereafter. However, self-attention initially plays a minor role but becomes crucial in the second phase. These findings yield a simple and training-free method known as temporally gating the attention (TGATE), which efficiently generates images by caching and reusing attention outputs at scheduled time steps. Experimental results show when widely applied to various existing text-conditional diffusion models, TGATE accelerates these models by 10%-50%. The code of TGATE is available at https://github.com/HaozheLiu-ST/T-GATE.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 19 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SuperEdit: Rectifying and Facilitating Supervision for Instruction-Based Image Editing

    cs.CV 2025-05 conditional novelty 7.0 of 10

    By rectifying editing instructions with GPT-4o and adding a triplet loss on positive and negative instructions, a standard InstructPix2Pix model trained on 40K samples outperforms the 14.1B-parameter SmartEdit on Real-Edit.

  2. Token Radius Attention for Efficient Video Generation

    cs.CV 2026-08 conditional novelty 6.0 of 10

    Video diffusion transformers can run ~1.5-2x faster with competitive quality by converting each query's attention entropy into a spatially decayed retention radius instead of dense attention.

  3. Steering Optimisation Trajectories in Diffusion Representation Learning

    cs.CV 2026-07 conditional novelty 6.0 of 10

    SteeringDRL identifies two optimization regimes in diffusion autoencoders and uses gated residual U-Nets with a log SNR curriculum to steer training toward disentangled representations, improving performance across mu...

  4. Transition Matching Distillation for Fast Video Generation

    cs.CV 2026-01 conditional novelty 6.0 of 10

    Splitting a video diffusion model into a fixed feature extractor and a small recurrent flow head lets TMD generate videos in one to two effective steps with better VBench scores than prior distilled models.

  5. OmniCache: A Trajectory-Oriented Global Perspective on Training-Free Cache Reuse for Diffusion Transformer Models

    cs.CV 2025-08 unverdicted novelty 6.0 of 10

    A training-free cache-reuse scheme that spreads computation across the full diffusion trajectory and subtracts estimated noise, accelerating DiT sampling with claimed competitive quality.

  6. DDiT: Dynamic Resource Allocation for Diffusion Transformer Model Serving

    cs.DC 2025-06 conditional novelty 6.0 of 10

    DDiT cuts text-to-video serving latency by up to 1.44x via DiT-VAE phase decoupling and step-level, starvation-aware GPU reassignment.

  7. dKV-Cache: The Cache for Diffusion Language Models

    cs.CL 2025-05 conditional novelty 6.0 of 10

    dKV-Cache reuses cached key and value states of decoded tokens during diffusion LM denoising, delivering 2-10x faster inference with near-lossless quality on several benchmarks.

  8. Can We Achieve Efficient Diffusion without Self-Attention? Distilling Self-Attention into Convolutions

    cs.CV 2025-04 conditional novelty 6.0 of 10

    Diffusion models can keep most of their image quality after swapping global self-attention for a distilled multi-scale convolutional block, with FLOPs claimed to fall by up to 6929 times at 16K resolution.

  9. CAT Pruning: Cluster-Aware Token Pruning For Text-to-Image Diffusion Models

    cs.CV 2025-02 conditional novelty 6.0 of 10

    A token-pruning cache method cuts diffusion model computation by roughly half while keeping image quality, using noise magnitude, spatial clustering, and selection balance.

  10. Layer- and Timestep-Adaptive Differentiable Token Compression Ratios for Efficient Diffusion Transformers

    cs.CV 2024-12 conditional novelty 6.0 of 10

    DiffCR learns per-layer and per-timestep token compression ratios for diffusion transformers, improving FID at similar latency relative to uniform token pruning.

  11. AsymRnR: Video Diffusion Transformers Acceleration with Asymmetric Reduction and Restoration

    cs.CV 2024-12 conditional novelty 6.0 of 10

    AsymRnR selectively reduces query and key/value tokens in video DiT attention to cut FLOPs and latency by 10 to 30 percent with minor or no VBench score change.

  12. Timestep Embedding Tells: It's Time to Cache for Video Diffusion Model

    cs.CV 2024-11 conditional novelty 6.0 of 10

    TeaCache speeds up video diffusion models by caching model outputs when the difference between timestep-embedding-modulated inputs is small, after polynomial rescaling calibrated on a small prompt set.

  13. Collaborative Decoding Makes Visual Auto-Regressive Modeling Efficient

    cs.CV 2024-11 conditional novelty 6.0 of 10

    CoDe speeds up Visual Auto-Regressive image generation by using a 2B model for early coarse scales and a 0.3B model for later fine scales, with 1.7x-2.9x speedup and only a small FID increase.

  14. Latent Space Disentanglement in Diffusion Transformers Enables Precise Zero-shot Semantic Editing

    cs.CV 2024-11 conditional novelty 6.0 of 10

    Diffusion transformer latent spaces are shown to be semantically disentangled, and prompt-difference directions plus a score-distillation step enable zero-shot fine-grained image editing.

  15. EC-Diff: Fast and High-Quality Edge-Cloud Collaborative Inference for Diffusion Models

    cs.CV 2025-07 reject novelty 5.0 of 10

    EC-Diff accelerates edge-cloud diffusion inference with a k-step noise approximation strategy and a two-stage greedy search for the cloud-edge handoff point, claiming about 2x speedup with preserved quality.

  16. Memory-Efficient Visual Autoregressive Modeling with Scale-Aware KV Cache Compression

    cs.LG 2025-05 conditional novelty 5.0 of 10

    ScaleKV cuts KV cache memory for Visual Autoregressive text-to-image generation to 10% by classifying layers as drafters or refiners per scale and pruning low-attention tokens while keeping benchmark scores nearly unchanged.

  17. Cached Adaptive Token Merging: Dynamic Token Reduction and Redundant Computation Elimination in Diffusion Model

    cs.CV 2025-01 conditional novelty 5.0 of 10

    CA-ToMe speeds up Stable Diffusion inference by adaptively merging similar tokens and caching merge pairs, reaching 6.09s average generation time with FID 34.05 on ImageNet.

  18. Unveiling Redundancy in Diffusion Transformers (DiTs): A Systematic Study

    cs.CV 2024-11 conditional novelty 5.0 of 10

    Redundancy between consecutive diffusion steps varies widely across DiT models but is stable within each model across prompts, step counts, and schedulers, so caching strategies must be model-specific.

  19. SkipVAR: Accelerating Visual Autoregressive Modeling via Adaptive Frequency-Aware Skipping

    cs.CV 2025-06 conditional novelty 4.0 of 10

    SkipVAR selects, per sample, between step skipping and unconditional branch replacement using handcrafted frequency features and a trained logistic regression, to accelerate visual autoregressive generation.

Pith tools