English
Related papers

Related papers: S2O: Early Stopping for Sparse Attention via Onlin…

200 papers

With the increasing volumes of Large Language Models (LLMs) and the expanding context lengths, attention computation has become a key performance bottleneck in LLM serving. For fast attention computation, recent practices often parallelize…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-12 Di Liu , Yifei Liu , Chen Chen , Zhibin Yu , Xiaoyi Fan , Quan Chen , Minyi Guo

Block-wise sparse attention offers significant efficiency gains for long-context modeling, yet existing methods often suffer from low selection fidelity and cumulative contextual loss by completely discarding unselected blocks. To address…

Computation and Language · Computer Science 2026-02-02 Bailin Wang , Dan Friedman , Tao Lei , Chong Wang

Long-context inference in large language models is bottlenecked by the quadratic cost of full attention. Existing efficient alternatives often rely either on native sparse training or on heuristic token eviction, creating an undesirable…

Computation and Language · Computer Science 2026-05-19 Yanke Zhou , Yiduo Li , Hanlin Tang , Maohua Li , Kan Liu , Lan Tao , Lin Qu , Yuan Yao , Xiaoxing Ma

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

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

Looped Transformers (LT) have emerged as a powerful architecture by iterating their layers multiple times before decoding the final token. However, pairing them with full attention retains quadratic complexity, making them computationally…

Machine Learning · Computer Science 2026-05-26 Chunyuan Deng , Yizhe Zhang , Rui-Jie Zhu , Yuanyuan Xu , Jiarui Liu , T. S. Eugene Ng , Hanjie Chen

The attention mechanism of a transformer has a quadratic complexity, leading to high inference costs and latency for long sequences. However, attention matrices are mostly sparse, which implies that many entries may be omitted from…

Machine Learning · Computer Science 2025-11-25 Jeffrey Willette , Heejun Lee , Sung Ju Hwang

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

Transformers are slow and memory-hungry on long sequences, since the time and memory complexity of self-attention are quadratic in sequence length. Approximate attention methods have attempted to address this problem by trading off model…

Machine Learning · Computer Science 2022-06-24 Tri Dao , Daniel Y. Fu , Stefano Ermon , Atri Rudra , Christopher Ré

Gating mechanisms have been widely utilized, from early models like LSTMs and Highway Networks to recent state space models, linear attention, and also softmax attention. Yet, existing literature rarely examines the specific effects of…

Computation and Language · Computer Science 2025-05-13 Zihan Qiu , Zekun Wang , Bo Zheng , Zeyu Huang , Kaiyue Wen , Songlin Yang , Rui Men , Le Yu , Fei Huang , Suozhi Huang , Dayiheng Liu , Jingren Zhou , Junyang Lin

Long-context LLMs increasingly rely on extended, reusable prefill prompts for agents and domain Q&A, pushing attention and KV-cache to become the dominant decode-time bottlenecks. While sparse attention reduces computation and transfer…

Machine Learning · Computer Science 2026-04-13 Chuxu Song , Zhencan Peng , Jiuqi Wei , Chuanhui Yang

Large language models (LLMs) demonstrate strong capabilities across a wide range of complex tasks and are increasingly deployed at scale, placing significant demands on inference efficiency. Prior work typically decomposes inference into…

Computation and Language · Computer Science 2026-04-21 Junhao Hu , Fangze Li , Mingtao Xu , Feifan Meng , Shiju Zhao , Tiancheng Hu , Ting Peng , Anmin Liu , Wenrui Huang , Chenxu Liu , Ziyue Hua , Tao Xie

Current hierarchical attention methods, such as NSA and InfLLMv2, select the top-k relevant key-value (KV) blocks based on coarse attention scores and subsequently apply fine-grained softmax attention on the selected tokens. However, the…

Computation and Language · Computer Science 2026-05-19 Yuxiang Huang , Nuno M. T. Gonçalves , Federico Alvetreti , Lei Li , Xu Han , Edoardo M. Ponti , André F. T. Martins , Marcos V. Treviso

The Segment Anything Model (SAM) achieves strong open-vocabulary segmentation, but its ViT-based image encoders dominate inference latency and memory. Existing activation compression methods, such as token merging, reduce the token length…

Computer Vision and Pattern Recognition · Computer Science 2026-05-19 Hoai-Chau Tran , Chi H. Nguyen , Duy M. H. Nguyen , Mathias Niepert , Fan Lai , Khoa D. Doan

Sparse attention methods exploit the inherent sparsity in attention to speed up the prefilling phase of long-context inference, mitigating the quadratic complexity of full attention computation. While existing sparse attention methods rely…

Machine Learning · Computer Science 2025-05-27 Dan Peng , Zhihui Fu , Zewen Ye , Zhuoran Song , Jun Wang

Modern large language models increasingly require long contexts for reasoning and multi-document tasks, but attention's quadratic complexity creates a severe computational bottleneck. We present Block-Sparse FlashAttention (BSFA), a drop-in…

Machine Learning · Computer Science 2025-12-09 Daniel Ohayon , Itay Lamprecht , Itay Hubara , Israel Cohen , Daniel Soudry , Noam Elata

The quadratic computational complexity of standard attention mechanisms presents a severe scalability bottleneck for LLMs in long-context scenarios. While hybrid attention mechanisms combining Full Attention (FA) and Sparse Attention (SA)…

Machine Learning · Computer Science 2026-04-10 Quantong Qiu , Zhiyi Hong , Yi Yang , Haitian Wang , Kebin Liu , Qingqing Dang , Juntao Li , Min Zhang

Long-context modeling is crucial for next-generation language models, yet the high computational cost of standard attention mechanisms poses significant computational challenges. Sparse attention offers a promising direction for improving…

In long-context large language model (LLM) inference, the prefill stage dominates computation due to self-attention over the complete input context. Sparse attention significantly reduces self-attention computation by limiting each token's…

Hardware Architecture · Computer Science 2026-02-25 Rakshith Jayanth , Viktor Prasanna

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