English
Related papers

Related papers: SpargeAttention: Accurate and Training-free Sparse…

200 papers

Efficient and accurate feed-forward multi-view reconstruction has long been an important task in computer vision. Recent transformer-based models like VGGT, $\pi^3$ and MapAnything have demonstrated remarkable performance with relatively…

Computer Vision and Pattern Recognition · Computer Science 2026-05-21 Chung-Shien Brian Wang , Christian Schmidt , Jens Piekenbrinck , Bastian Leibe

We introduce a simple post-training method that makes transformer attention sparse without sacrificing performance. Applying a flexible sparsity regularisation under a constrained-loss objective, we show on models up to 7B parameters that…

Machine Learning · Computer Science 2026-05-26 Florent Draye , Anson Lei , Hsiao-Ru Pan , Ingmar Posner , Bernhard Schölkopf

Diffusion generative models have become the standard for producing high-quality, coherent video content, yet their slow inference speeds and high computational demands hinder practical deployment. Although both quantization and sparsity can…

Computer Vision and Pattern Recognition · Computer Science 2025-06-09 Akide Liu , Zeyu Zhang , Zhexin Li , Xuehai Bai , Yizeng Han , Jiasheng Tang , Yuanjie Xing , Jichao Wu , Mingyang Yang , Weihua Chen , Jiahao He , Yuanyu He , Fan Wang , Gholamreza Haffari , Bohan Zhuang

Diffusion Transformers (DiTs) dominate video generation but their high computational cost severely limits real-world applicability, usually requiring tens of minutes to generate a few seconds of video even on high-performance GPUs. This…

Computer Vision and Pattern Recognition · Computer Science 2025-04-29 Haocheng Xi , Shuo Yang , Yilong Zhao , Chenfeng Xu , Muyang Li , Xiuyu Li , Yujun Lin , Han Cai , Jintao Zhang , Dacheng Li , Jianfei Chen , Ion Stoica , Kurt Keutzer , Song Han

As its core computation, a self-attention mechanism gauges pairwise correlations across the entire input sequence. Despite favorable performance, calculating pairwise correlations is prohibitively costly. While recent work has shown the…

Machine Learning · Computer Science 2022-09-02 Amir Yazdanbakhsh , Ashkan Moradifirouzabadi , Zheng Li , Mingu Kang

Scaling the context length of large language models (LLMs) offers significant benefits but is computationally expensive. This expense stems primarily from the self-attention mechanism, whose $O(N^2)$ complexity with respect to sequence…

Computation and Language · Computer Science 2026-05-25 Xinghao Wang , Pengyu Wang , Dong Zhang , Chenkun Tan , Shaojun Zhou , Zhaoxiang Liu , Shiguo Lian , Fangxu Liu , Kai Song , Xipeng Qiu

Sparse-Linear Attention (SLA) combines sparse and linear attention to accelerate diffusion models and has shown strong performance in video generation. However, (i) SLA relies on a heuristic split that assigns computations to the sparse or…

Machine Learning · Computer Science 2026-02-16 Jintao Zhang , Haoxu Wang , Kai Jiang , Kaiwen Zheng , Youhe Jiang , Ion Stoica , Jianfei Chen , Jun Zhu , Joseph E. Gonzalez

Reasoning language models have demonstrated remarkable capabilities on challenging tasks by generating elaborate chain-of-thought (CoT) solutions. However, such lengthy generation shifts the inference bottleneck from compute-bound to…

Attention is the cornerstone of modern Large Language Models (LLMs). Yet its quadratic complexity hinders efficiency and scalability, especially for long-context processing. A promising approach is to leverage sparsity in attention.…

Computation and Language · Computer Science 2025-02-18 Yizhao Gao , Zhichen Zeng , Dayou Du , Shijie Cao , Peiyuan Zhou , Jiaxing Qi , Junjie Lai , Hayden Kwok-Hay So , Ting Cao , Fan Yang , Mao Yang

Long-Context Transformer Models (LCTMs) are vital for real-world applications but suffer high computational costs due to attention's quadratic complexity. Block-sparse attention mitigates this by focusing computation on critical regions,…

Computation and Language · Computer Science 2025-03-21 Ruyi Xu , Guangxuan Xiao , Haofeng Huang , Junxian Guo , Song Han

Recently, sparse training methods have started to be established as a de facto approach for training and inference efficiency in artificial neural networks. Yet, this efficiency is just in theory. In practice, everyone uses a binary mask to…

Machine Learning · Computer Science 2022-07-13 Selima Curci , Decebal Constantin Mocanu , Mykola Pechenizkiyi

Transformers allow attention between all pairs of tokens, but there is reason to believe that most of these connections - and their quadratic time and memory - may not be necessary. But which ones? We evaluate the impact of sparsification…

Computation and Language · Computer Science 2022-10-11 Siddhartha Brahma , Polina Zablotskaia , David Mimno

In visual generation, the quadratic complexity of attention mechanisms results in high memory and computational costs, especially for longer token sequences required in high-resolution image or multi-frame video generation. To address this,…

Computer Vision and Pattern Recognition · Computer Science 2025-06-23 Tianchen Zhao , Ke Hong , Xinhao Yang , Xuefeng Xiao , Huixia Li , Feng Ling , Ruiqi Xie , Siqi Chen , Hongyu Zhu , Yichong Zhang , Yu Wang

Scaling Transformers to ultra-long contexts is bottlenecked by the $O(n^2 d)$ cost of self-attention. Existing methods reduce this cost along the sequence axis through local windows, kernel approximations, or token-level sparsity, but these…

Machine Learning · Computer Science 2026-03-31 Yan Xie , Tiansheng Wen , Tangda Huang , Bo Chen , Chenyu You , Stefanie Jegelka , Yifei Wang

This work presents a sparse-attention Transformer architecture for modeling documents that contain large tables. Tables are ubiquitous on the web, and are rich in information. However, more than 20% of relational tables on the web have 20…

Computation and Language · Computer Science 2021-09-10 Julian Martin Eisenschlos , Maharshi Gor , Thomas Müller , William W. Cohen

Long-context understanding is crucial for many NLP applications, yet transformers struggle with efficiency due to the quadratic complexity of self-attention. Sparse attention methods alleviate this cost but often impose static, predefined…

Computation and Language · Computer Science 2025-06-16 Hanzhi Zhang , Heng Fan , Kewei Sha , Yan Huang , Yunhe Feng

Existing sparse attention methods primarily target inference-time acceleration by selecting critical tokens under predefined sparsity patterns. However, they often fail to bridge the training-inference gap and lack the capacity for…

Computer Vision and Pattern Recognition · Computer Science 2025-11-20 Feng Chen , Yefei He , Shaoxuan He , Yuanyu He , Jing Liu , Lequan Lin , Akide Liu , Zhaoyang Li , Jiyuan Zhang , Zhenbang Sun , Bohan Zhuang , Qi Wu

Advanced autoregressive (AR) video generation models have improved visual fidelity and interactivity, but the quadratic complexity of attention remains a primary bottleneck for efficient deployment. While existing sparse attention solutions…

Computer Vision and Pattern Recognition · Computer Science 2026-05-26 Chengtao Lv , Yumeng Shi , Yushi Huang , Ruihao Gong , Shen Ren , Wenya Wang

Attention serves as the fundamental mechanism for long-context modeling in large language models (LLMs), yet dense attention becomes structurally prohibitive for long sequences due to its quadratic complexity. Consequently, sparse attention…

Computation and Language · Computer Science 2026-01-07 Junxiang Qiu , Shuo Wang , Zhengsu Chen , Hengheng Zhang , Jinda Lu , Changcheng Li , Qi Tian

Long-context models are essential for many applications but face inefficiencies in loading large KV caches during decoding. Prior methods enforce fixed token budgets for sparse attention, assuming a set number of tokens can approximate full…

Machine Learning · Computer Science 2025-02-19 Kan Zhu , Tian Tang , Qinyu Xu , Yile Gu , Zhichen Zeng , Rohan Kadekodi , Liangyu Zhao , Ang Li , Arvind Krishnamurthy , Baris Kasikci