CVMay 24, 2025

VORTA: Efficient Video Diffusion via Routing Sparse Attention

arXiv:2505.18809v216 citationsh-index: 8Has Code
Originality Incremental advance
AI Analysis

This addresses the high computational cost for researchers and practitioners using video diffusion models, though it is incremental as it builds on existing acceleration techniques.

The paper tackled the computational inefficiency of video diffusion transformers by proposing VORTA, an acceleration framework that uses sparse attention and routing strategies, achieving a 1.76x speedup without quality loss on VBench and up to 14.41x with other methods.

Video diffusion transformers have achieved remarkable progress in high-quality video generation, but remain computationally expensive due to the quadratic complexity of attention over high-dimensional video sequences. Recent acceleration methods enhance the efficiency by exploiting the local sparsity of attention scores; yet they often struggle with accelerating the long-range computation. To address this problem, we propose VORTA, an acceleration framework with two novel components: 1) a sparse attention mechanism that efficiently captures long-range dependencies, and 2) a routing strategy that adaptively replaces full 3D attention with specialized sparse attention variants. VORTA achieves an end-to-end speedup $1.76\times$ without loss of quality on VBench. Furthermore, it can seamlessly integrate with various other acceleration methods, such as model caching and step distillation, reaching up to speedup $14.41\times$ with negligible performance degradation. VORTA demonstrates its efficiency and enhances the practicality of video diffusion transformers in real-world settings. Codes and weights are available at https://github.com/wenhao728/VORTA.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes