English
Related papers

Related papers: S-HPLB: Efficient LLM Attention Serving via Sparsi…

200 papers

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

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

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

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

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

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 design of Large Language Models (LLMs) has long been hampered by a fundamental conflict within their core attention mechanism: its remarkable expressivity is built upon a computational complexity of O(H N^2) that grows quadratically…

Machine Learning · Computer Science 2025-12-01 Mingkuan Zhao , Wentao Hu , Jiayin Wang , Xin Lai , Tianchen Huang , Yuheng Min , Rui Yan , Xiaoyan Zhu

Sequence parallelism (SP) serves as a prevalent strategy to handle long sequences that exceed the memory limit of a single device. However, for linear sequence modeling methods like linear attention, existing SP approaches do not take…

Machine Learning · Computer Science 2025-05-19 Weigao Sun , Zhen Qin , Dong Li , Xuyang Shen , Yu Qiao , Yiran Zhong

Scaling Diffusion Transformer (DiT) inference via sequence parallelism is critical for reducing latency in visual generation, but is severely hampered by workload imbalance when applied to models employing block-wise sparse attention. The…

Computer Vision and Pattern Recognition · Computer Science 2025-12-01 Siqi Chen , Ke Hong , Tianchen Zhao , Ruiqi Xie , Zhenhua Zhu , Xudong Zhang , Yu Wang

As long-context inference becomes central to large language models (LLMs), attention over growing key-value caches emerges as a dominant decoding bottleneck, motivating sparse attention for scalable inference. Fixed-budget top-k sparse…

Machine Learning · Computer Science 2026-02-06 Wentao Ni , Kangqi Zhang , Zhongming Yu , Oren Nelson , Mingu Lee , Hong Cai , Fatih Porikli , Jongryool Kim , Zhijian Liu , Jishen Zhao

As Large Language Models (LLMs) scale to longer context windows, the computational cost of attention mechanisms, which traditionally grows quadratically with input length, presents a critical challenge for real-time and memory-constrained…

Computation and Language · Computer Science 2024-12-10 James Vo

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) have demonstrated remarkable proficiency in a wide range of natural language processing applications. However, the high energy and latency overhead induced by the KV cache limits the edge deployment, especially…

Performance · Computer Science 2025-12-09 Zizhuo Fu , Xiaotian Guo , Wenxuan Zeng , Shuzhang Zhong , Yadong Zhang , Peiyu Chen , Runsheng Wang , Le Ye , Meng Li

The quadratic cost of attention limits the scalability of long-context LLMs, especially under limited hardware memory budgets. While attention is often sparse, existing static sparse methods cannot adapt to task- or input-dependent…

Computation and Language · Computer Science 2026-05-29 Siheng Xiong , Joe Zou , Faramarz Fekri , Yae Jee Cho

The evolution of large language models (LLMs) towards applications with ultra-long contexts faces challenges posed by the high computational and memory costs of the Transformer architecture. While existing sparse and linear attention…

Serving long-context LLMs is costly because attention computation grows linearly with context length. Dynamic sparse attention algorithms (DSAs) mitigate this by attending only to the key-value (KV) cache of critical tokens. However, with…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-30 Qihui Zhou , Peiqi Yin , Pengfei Zuo , James Cheng

Linear sequence modeling approaches, such as linear attention, provide advantages like linear-time training and constant-memory inference over sequence lengths. However, existing sequence parallelism (SP) methods are either not optimized…

Machine Learning · Computer Science 2025-02-12 Weigao Sun , Disen Lan , Yiran Zhong , Xiaoye Qu , Yu Cheng

Effective attention modules have played a crucial role in the success of Transformer-based large language models (LLMs), but the quadratic time and memory complexities of these attention modules also pose a challenge when processing long…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-07 Ao Sun , Weilin Zhao , Xu Han , Cheng Yang , Zhiyuan Liu , Chuan Shi , Maosong Sun

Long-context LLM serving is bottlenecked by the cost of attending over ever-growing KV caches. Dynamic sparse attention promises relief by accessing only a small, query-dependent subset of the KV state per decoding step and extending the KV…

Machine Learning · Computer Science 2026-04-30 Zihan Zhao , Baotong Lu , Shengjie Lin , Yizou Chen , Jing Liu , Yanqi Zhang , Ziming Miao , Ming-Chang Yang , Haiying Shen , Qi Chen , Fan Yang
‹ Prev 1 2 3 10 Next ›