English
Related papers

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

200 papers

The quadratic complexity of attention imposes severe memory and computational bottlenecks on Large Language Model (LLM) inference. This challenge is particularly acute for emerging agentic applications that require processing multi-million…

Machine Learning · Computer Science 2026-05-19 Ceyu Xu , Jiangnan Yu , Yongji Wu , Yuan Xie

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

Transformer-based architectures have become the prevailing backbone of large language models. However, the quadratic time and memory complexity of self-attention remains a fundamental obstacle to efficient long-context modeling. To address…

Computation and Language · Computer Science 2026-02-10 Yutao Sun , Zhenyu Li , Yike Zhang , Tengyu Pan , Bowen Dong , Yuyi Guo , Jianyong 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

The quadratic complexity of attention mechanisms poses a critical bottleneck for large language models processing long contexts. While dynamic sparse attention methods offer input-adaptive efficiency, they face fundamental trade-offs:…

Computation and Language · Computer Science 2026-02-06 Siran Liu , Guoxia Wang , Sa Wang , Jinle Zeng , HaoYang Xie , Siyu Lou , JiaBin Yang , DianHai Yu , Haifeng Wang , Chao Yang

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

Accelerating large language model (LLM) inference is critical for real-world deployments requiring high throughput and low latency. Contextual sparsity, where each token dynamically activates only a small subset of the model parameters,…

Machine Learning · Computer Science 2025-11-13 Susav Shrestha , Brad Settlemyer , Nikoli Dryden , Narasimha Reddy

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

Sparsity has long been a central theme in LLM efficiency, but its role in context processing remains unresolved. As LLM workloads shift toward longer contexts and agentic interactions, the compute and memory bottlenecks of attention become…

As the context window expands, self-attention increasingly dominates the transformer's inference time. Therefore, accelerating attention computation while minimizing performance degradation is essential for the efficient deployment of Large…

Computation and Language · Computer Science 2025-03-14 Eli Sason , Darya Frolova , Boris Nazarov , Felix Goldberd

While sparse attention mitigates the computational bottleneck of long-context LLM training, its distributed training process exhibits extreme heterogeneity in both \textit{1)} sequence length and \textit{2)} sparsity sensitivity, leading to…

Machine Learning · Computer Science 2026-04-27 Hongtao Xu , Jianchao Tan , Yuxuan Hu , Pengju Lu , Hongyu Wang , Pingwei Sun , Yerui Sun , Yuchen Xie , Xunliang Cai , Mingzhen Li , Weile Jia

While diffusion language models (DLMs) offer a promising alternative to autoregressive models (ARs), existing open-source DLMs suffer from high inference latency. This bottleneck is mainly due to the attention's quadratic complexity with…

Computation and Language · Computer Science 2025-09-30 Zeqing Wang , Gongfan Fang , Xinyin Ma , Xingyi Yang , Xinchao Wang

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…

Sparse attention, which selectively attends to a subset of tokens in the context was supposed to be efficient. However, its theoretical reduction in FLOPs has rarely translated into wall-clock speed-up over its dense attention counterparts…

Computation and Language · Computer Science 2025-02-06 Xihui Lin , Yunan Zhang , Suyu Ge , Liliang Ren , Barun Patra , Vishrav Chaudhary , Hao Peng , Xia Song

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 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

Large language models (LLMs) now support extremely long context windows, but the quadratic complexity of vanilla attention results in significantly long Time-to-First-Token (TTFT) latency. Existing approaches to address this complexity…

Computation and Language · Computer Science 2025-09-04 Qianchao Zhu , Jiangfei Duan , Chang Chen , Siran Liu , Guanyu Feng , Xin Lv , Xiao Chuanfu , Dahua Lin , Chao Yang

Self-attention has recently been adopted for a wide range of sequence modeling problems. Despite its effectiveness, self-attention suffers from quadratic compute and memory requirements with respect to sequence length. Successful approaches…

Machine Learning · Computer Science 2020-10-27 Aurko Roy , Mohammad Saffar , Ashish Vaswani , David Grangier

Vision Transformers and their variants have achieved remarkable success in diverse visual perception tasks. Despite their effectiveness, they suffer from two significant limitations. First, the quadratic computational complexity of…

Computer Vision and Pattern Recognition · Computer Science 2026-02-16 Ali K. Rahimian , Manish K. Govind , Subhajit Maity , Dominick Reilly , Christian Kümmerle , Srijan Das , Aritra Dutta

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
‹ Prev 1 2 3 10 Next ›