English
Related papers

Related papers: SampleAttention: Near-Lossless Acceleration of Lon…

200 papers

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

Linear-attention models that compress the entire input sequence into a fixed-size recurrent state offer an efficient alternative to Transformers, but their finite memory induces forgetfulness that harms retrieval-intensive tasks. To…

Computation and Language · Computer Science 2025-10-27 Mutian He , Philip N. Garner

The long-context capability of the Large Language Models (LLM) has made significant breakthroughs, but the maximum supported context length in length extrapolation remains a critical bottleneck limiting their practical applications. The…

Computation and Language · Computer Science 2025-03-20 Xiaoran Liu , Ruixiao Li , Qipeng Guo , Zhigeng Liu , Yuerong Song , Kai Lv , Hang Yan , Linlin Li , Qun Liu , Xipeng Qiu

As Large Language Models (LLMs) scale to million-token contexts, traditional Mechanistic Interpretability techniques for analyzing attention scale quadratically with context length, demanding terabytes of memory beyond 100,000 tokens. We…

Computation and Language · Computer Science 2026-02-03 J Rosser , José Luis Redondo García , Gustavo Penha , Konstantina Palla , Hugues Bouchard

The quadratic computational complexity of the attention mechanism in current Large Language Models (LLMs) renders inference with long contexts prohibitively expensive. To address this challenge, various approaches aim to retain critical…

Computation and Language · Computer Science 2024-12-09 Hongyin Tang , Di Xiu , Lanrui Wang , Xiurui Geng , Jingang Wang , Xunliang Cai

With the rise of Transformer models in NLP and CV domain, Multi-Head Attention has been proven to be a game-changer. However, its expensive computation poses challenges to the model throughput and efficiency, especially for the long…

Image and Video Processing · Electrical Eng. & Systems 2024-04-12 Jiing-Ping Wang , Ming-Guang Lin , An-Yeu , Wu

Sparse Attention is a technique that approximates standard attention computation with sub-quadratic complexity. This is achieved by selectively ignoring smaller entries in the attention matrix during the softmax function computation.…

Machine Learning · Computer Science 2025-02-13 Yichuan Deng , Zhao Song , Jing Xiong , Chiwun Yang

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

Long-context inference in LLMs faces the dual challenges of quadratic attention complexity and prohibitive KV cache memory. While token-level sparse attention offers superior accuracy, its indexing overhead is costly; block-level methods…

Computation and Language · Computer Science 2026-04-10 Yuxuan Hu , Jianchao Tan , Jiaqi Zhang , Wen Zan , Pingwei Sun , Yifan Lu , Yerui Sun , Yuchen Xie , Xunliang Cai , Jing Zhang

Deploying Large Language Models (LLMs) on edge devices remains challenging due to their quadratically increasing computations with the sequence length. Existing studies for dynamic attention pruning are designed for hardware with massively…

Artificial Intelligence · Computer Science 2025-07-29 Jiawen Qi , Chang Gao , Zhaochun Ren , Qinyu Chen

The quadratic complexity of self-attention during the prefill phase impedes long-context inference in large language models. Existing sparse attention methods face a trade-off among context adaptivity, sampling overhead, and fine-tuning…

Machine Learning · Computer Science 2026-03-06 Chen Guanzhong

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) have demonstrated remarkable capabilities across various applications, but their performance on long-context tasks is often limited by the computational complexity of attention mechanisms. We introduce a novel…

Machine Learning · Computer Science 2025-02-25 Bo Chen , Yingyu Liang , Zhizhou Sha , Zhenmei Shi , Zhao Song

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

Deploying Large Language Models (LLMs) in streaming applications such as multi-round dialogue, where long interactions are expected, is urgently needed but poses two major challenges. Firstly, during the decoding stage, caching previous…

Computation and Language · Computer Science 2024-04-09 Guangxuan Xiao , Yuandong Tian , Beidi Chen , Song Han , Mike Lewis

LLMs' performance on complex tasks is still unsatisfactory. A key issue is that presently LLMs learn in a data-driven schema, while the instructions about these complex tasks are both scarce and hard to collect or construct. On the…

Machine Learning · Computer Science 2024-10-21 Yang Zhao , Li Du , Xiao Ding , Kai Xiong , Ting Liu , Bing Qin

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

In recent years, Large Language Models (LLMs) have demonstrated remarkable capabilities across a wide array of text-centric tasks. However, their `large' scale introduces significant computational and storage challenges, particularly in…

Computation and Language · Computer Science 2024-07-03 Chaoran Zhang , Lixin Zou , Dan Luo , Min Tang , Xiangyang Luo , Zihao Li , Chenliang Li