English
Related papers

Related papers: Making Every Head Count: Sparse Attention Without …

200 papers

Transformers have revolutionized natural language processing, but their quadratic complexity with respect to sequence length remains a fundamental bottleneck for long-range modeling. While sparse attention mechanisms like RingAttention…

Computation and Language · Computer Science 2026-03-31 Dong Liu , Yanxuan Yu

Multimodal Large Language Models (MLLMs) are commonly derived by extending pre-trained Large Language Models (LLMs) with visual capabilities. In this work, we investigate how MLLMs process visual inputs by analyzing their attention…

Computer Vision and Pattern Recognition · Computer Science 2025-07-08 Jiahui Wang , Zuyan Liu , Yongming Rao , Jiwen Lu

The attention mechanism is becoming increasingly popular in Natural Language Processing (NLP) applications, showing superior performance than convolutional and recurrent architectures. However, attention becomes the compution bottleneck…

Hardware Architecture · Computer Science 2024-07-22 Hanrui Wang , Zhekai Zhang , Song Han

Transformer-based large language models (e.g., BERT and GPT) achieve great success, and fine-tuning, which tunes a pre-trained model on a task-specific dataset, is the standard practice to utilize these models for downstream tasks. However,…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-19 Yuntao Gui , Xiao Yan , Peiqi Yin , Han Yang , James Cheng

Computational efficiency has remained a critical consideration in scaling high-capacity language models, with inference latency and resource consumption presenting significant constraints on real-time applications. The study has introduced…

Computation and Language · Computer Science 2025-03-26 Michael Mangrum , Jonathan Pemberton , Benedict Wetherby , Philip Montague

Large Language Models (LLMs) face significant computational bottlenecks during inference due to the quadratic complexity of self-attention mechanisms, particularly as context lengths increase. We introduce SpecAttn, a novel training-free…

Computation and Language · Computer Science 2025-11-03 Harsh Shah

The quadratic computational cost of the self-attention mechanism is a primary challenge in scaling Transformer models. While attention sparsity is widely studied as a technique to improve computational efficiency, it is almost universally…

Computation and Language · Computer Science 2025-08-11 Sagar Gandhi , Vishal Gandhi

Sparse attention offers a promising strategy to extend long-context capabilities in Transformer LLMs, yet its efficiency-accuracy trade-offs remain unclear due to the lack of comprehensive evaluation. We address this gap with the…

Computation and Language · Computer Science 2026-01-28 Piotr Nawrot , Robert Li , Renjie Huang , Sebastian Ruder , Kelly Marchisio , Edoardo M. Ponti

Long-sequence processing is a critical capability for modern large language models. However, the self-attention mechanism in the standard Transformer architecture faces severe computational and memory bottlenecks when processing long…

Computation and Language · Computer Science 2025-09-30 Weilin Zhao , Zihan Zhou , Zhou Su , Chaojun Xiao , Yuxuan Li , Yanghao Li , Yudi Zhang , Weilun Zhao , Zhen Li , Yuxiang Huang , Ao Sun , Xu Han , Zhiyuan Liu

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

The quadratic complexity of standard attention mechanisms poses a significant scalability bottleneck for large language models (LLMs) in long-context scenarios. While hybrid attention strategies that combine sparse and full attention within…

Computation and Language · Computer Science 2026-01-29 Zecheng Tang , Quantong Qiu , Yi Yang , Zhiyi Hong , Haiya Xiang , Kebin Liu , Qingqing Dang , Juntao Li , Min Zhang

Large Language Models (LLMs) face efficiency bottlenecks due to the quadratic complexity of the attention mechanism when processing long contexts. Sparse attention methods offer a promising solution, but existing approaches often suffer…

Computation and Language · Computer Science 2025-03-06 Lida Chen , Dong Xu , Chenxin An , Xintao Wang , Yikai Zhang , Jiangjie Chen , Zujie Liang , Feng Wei , Jiaqing Liang , Yanghua Xiao , Wei Wang

The quadratic complexity of attention remains the central bottleneck in long-context inference for large language models. Prior acceleration methods either sparsify the attention map with structured patterns or permanently evict tokens at…

Computation and Language · Computer Science 2026-05-04 Dongwon Jo , Beomseok Kang , Jiwon Song , Jae-Joon Kim

Transformer-based language models have found many diverse applications requiring them to process sequences of increasing length. For these applications, the causal self-attention -- which is the only component scaling quadratically w.r.t.…

Machine Learning · Computer Science 2023-06-05 Matteo Pagliardini , Daniele Paliotta , Martin Jaggi , François Fleuret

The computational demands of self-attention mechanisms pose a critical challenge for transformer-based video generation, particularly in synthesizing ultra-long sequences. Current approaches, such as factorized attention and fixed sparse…

Computer Vision and Pattern Recognition · Computer Science 2025-08-19 Qirui Li , Guangcong Zheng , Qi Zhao , Jie Li , Bin Dong , Yiwu Yao , Xi Li

An efficient attention implementation is essential for large models due to its quadratic time complexity. Fortunately, attention commonly exhibits sparsity, i.e., many values in the attention map are near zero, allowing for the omission of…

Machine Learning · Computer Science 2025-11-20 Jintao Zhang , Chendong Xiang , Haofeng Huang , Jia Wei , Haocheng Xi , Jun Zhu , Jianfei Chen

Large Language Models (LLMs) based on autoregressive, decoder-only Transformers generate text one token at a time, where a token represents a discrete unit of text. As each newly produced token is appended to the partial output sequence,…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-06 Dimitrios Kafetzis , Ramin Khalili , Iordanis Koutsopoulos

The quadratic computational complexity of self-attention remains a fundamental bottleneck for scaling Large Language Models (LLMs) to long contexts, particularly during the pre-filling phase. In this paper, we rethink the causal attention…

Machine Learning · Computer Science 2026-03-09 Lin Niu , Xin Luo , Linchuan Xie , Yifu Sun , Guanghua Yu , Jianchen Zhu , S Kevin Zhou

Attention scales quadratically with sequence length, fundamentally limiting long-context inference. Existing block-granularity sparsification can reduce latency, but coarse blocks impose an intrinsic sparsity ceiling, making further…

Machine Learning · Computer Science 2026-05-06 Yu Zhang , Songwei Liu , Chenqian Yan , Sheng Lin , Beichen Ning , Fangmin Chen , Xing Wang

Large Language Models (LLMs) have achieved remarkable success with their billion-level parameters, yet they incur high inference overheads. The emergence of activation sparsity in LLMs provides a natural approach to reduce this cost by…

Computation and Language · Computer Science 2024-12-13 Haizhong Zheng , Xiaoyan Bai , Xueshen Liu , Z. Morley Mao , Beidi Chen , Fan Lai , Atul Prakash