LoSA is a training-free sparse-attention method that fixes a retained-mass threshold of 99% rather than a sparsity ratio: it measures exact block attention masses at one early dense step, keeps, for each head and query block, the smallest key/value block set meeting the threshold, and reuses the frozen block indices for all remaining steps.
Abstract
Video diffusion transformers are costly to sample: every denoising step applies self-attention over a long 3D token sequence, a quadratic cost that dominates as resolution and duration grow. Sparse attention reduces this cost without retraining, but existing methods pursue aggressive sparsity, where further speedup costs disproportionately more attention fidelity. We target the opposite end of this trade-off: fix near-lossless fidelity by construction, and remove as much computation as this constraint permits. Two observations make this regime practical: roughly 40% of block interactions can be removed while retaining 99% of the attention mass, and the high-mass support remains stable across denoising steps. We propose LoSA, a training-free sparse-attention method that fixes a retained-mass threshold of 99% rather than a sparsity ratio: it measures exact block attention masses at one early dense step, keeps, for each head and query block, the smallest key/value block set meeting the threshold, and reuses the frozen block indices for all remaining steps. On Wan2.1-1.3B, LoSA alone gives a $1.36\times$ speedup with a 0.06-point VBench Overall drop. The benefit is largest under composition: combined with feature caching, LoSA reaches a $3.2\times$ speedup on HunyuanVideo at a 0.02-point drop, versus 0.32 points for the strongest sparse baseline at comparable speed. Across three video diffusion transformers and speedups up to $3.2\times$, LoSA consistently achieves the best training-free speed-quality trade-off.
This paper introduces training-free Sol-Attn (Sparsifying online attention), which unifies dynamic routing, sparse computation, and approximation correction in a single online-softmax pass, achieving a better accuracy-efficiency trade-off in sparse attention.
This work proposes Token Radius Attention (TRA), a training-free framework that maps query entropy to an analytic token budget and converts it into a temporally decayed radius without explicit key ranking and achieves 1.05x speedup with competitive generation quality.
Jiayu Chen, Zhi-Kun Jiang, Maoliang Li et al.· 0 citations
This work introduces SANA-Video 2.0, a hybrid video diffusion transformer instantiated at 5B and 14B scales under a unified architecture that recovers softmax-level expressiveness at substantially reduced cost, unlocking scalable long, high resolution video generation.
Junsong Chen, Jincheng Yu, Yitong Li et al.· arXiv.org· 1 citation· ⚡1
SarSTAR is introduced, a training-free block-sparse attention method tailored to this setting, showing that recomputing block selection at each target scale is more reliable than reusing a transferred mask as reuse spans increasingly distant scales.
Jongbeom Lee, Hyunwoo Yu, Jincheol Yang et al.· 0 citations
SPADE is presented, a training-free sparse-attention engine of three parts: a specification defining 3D blocking candidates and formalizing dynamic masks via Summarizer/Estimator expressions, and an executor with low-overhead index search, flash block-sparse attention, and kernel grouping.
Shanghao Liu, Renze Chen, Size Zheng et al.· 0 citations
This work introduces SparsePR, which combines Response-Coupled Partitioning with Probe-Fitted Residual Reconstruction and consistently reduces attention-reconstruction error across four heterogeneous video generation and world models.
P. Taghavi, Reza Langari, Gaurav Pandey· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.