NTH

MC-Sparse: Deconstructing and Closing the Dense-Sparse Attention Gap in Diffusion Transformers

AuthorsJiarui Chen, Zeqiang Lai, Jiangshan Wang, Ziheng Ouyang, Ye Huang, Xiangyu Yue, Cewu Lu, Chunchao Guo

AffiliationsFudan University · Tencent HY · Shanghai Innovation Institute · MMLab, CUHK · Nankai University · Peking University

October 11, 2026 2 min read
Watch on YouTube
The one-line take

MC-Sparse makes long-sequence diffusion generation substantially faster by intelligently reusing sparse-attention decisions while preserving dense-attention quality.

Key results

1.80
MiniMax-H3-Base denoising speedup

× speedup at 15% attention density.

2.32
HY3D-Internal denoising speedup

× speedup at 15% attention density.

28.81
Wan2.1-14B-T2V PSNR

dB at 25% attention density.

1.53
Wan2.1-14B-T2V denoising speedup

× speedup at 25% attention density.

What the paper found

MC-Sparse is a training-free method for accelerating diffusion transformers without the quality loss common in sparse attention. Its oracle analysis attributes that loss to coarse token grouping, inaccurate selection, and the attention contribution of discarded tokens. To address these errors, MC-Sparse uses Fast PDDP to form equal-sized, tile-aligned groups of similar queries, selects individual key-value tokens using exact attention probabilities, then reuses the groups and selections across denoising steps. It also caches and reapplies the difference between dense and sparse attention outputs, compensating for discarded contributions. A two-pass selector and token-sparse GPU kernel make the approach practical. On MiniMax-H3-Base, MC-Sparse achieves a 1.80× denoising speedup at 15% attention density; on HY3D-Internal, it reaches 2.32× at 15% density. On Alibaba’s Wan2.1-14B-T2V, it records 28.81 dB PSNR and a 1.53× speedup at 25% density. The evaluation also covers Tencent’s HunyuanVideo-13B and shows that MC-Sparse can improve fidelity to dense attention while reducing denoising latency across video and 3D generation.

Original abstract

Sparse attention is a primary approach to reducing the latency of diffusion transformers in long-sequence generation tasks, such as video and high-resolution 3D asset generation. However, existing methods can degrade generation quality and fidelity at high sparsity levels. Through controlled oracle comparisons, we trace this degradation to three sources: constraints imposed by token grouping, inaccurate interaction selection, and the attention contributions lost when tokens are discarded. Guided by this analysis, we propose Meta-Cached Sparse Attention (MC-Sparse), a training-free framework that selects individual key-value (KV) tokens while organizing similar queries into tile-aligned groups for efficient GPU execution. MC-Sparse caches metadata comprising query groups, KV indices selected using exact attention probabilities, and residuals between dense and sparse attention outputs, and reuses them across subsequent denoising steps. Across video and 3D generation models, MC-Sparse achieves higher fidelity to dense-attention outputs and larger denoising speedups than existing sparse-attention baselines, without visible quality degradation. Relative to dense attention, it delivers a $1.80\times$ denoising speedup on Minimax-H3-Base and a $2.32\times$ speedup on 3D asset generation, both with negligible quality loss.

Read the original paper

More in Efficient AI

Browse all 58 papers →
02Efficiency

V-CoLA: Vision Token Compression with Linear Attention

Hao Jiang, Yiru Mao, Tianpeng Bu, Hao Zhou, Hongtao Duan, Wang Jing, Bowen Xu, Xin Chen, Lulu Hu, Bin Yang, Yongliang Tao, Minying Zhang

V-CoLA makes hybrid vision-language models faster by intelligently selecting and merging vision tokens while preserving most of their performance.

Read analysis
03Efficiency

Decoding Looped Transformers Better for (Almost) Free

Weihao Liu, Huangjie Zheng, Tianrong Chen, Rohit Dilip, Richard He Bai, Yizhu Jiao, Yuyang Wang, Ruixiang Zhang

LoopCD turns the partially computed states of looped Transformers into free guidance, improving accuracy while often cutting inference compute nearly in half.

Read analysis