English
Related papers

Related papers: SALE : Low-bit Estimation for Efficient Sparse Att…

200 papers

Large reasoning models (LRMs) achieve state-of-the-art performance on challenging benchmarks by generating long chains of intermediate steps, but their inference cost is dominated by decoding, where each new token must attend to the entire…

Computation and Language · Computer Science 2026-05-05 Hossein Entezari Zarch , Lei Gao , Chaoyi Jiang , Murali Annavaram

Sparse attention improves LLM inference efficiency by selecting a subset of key-value entries, but at the cost of potential accuracy degradation. In particular, omitting critical KV entries can induce substantial errors in model outputs.…

Machine Learning · Computer Science 2026-05-12 Mohsen Dehghankar , Abolfazl Asudeh

Recent advances in transformer-based Large Language Models (LLMs) have demonstrated remarkable capabilities across various tasks. However, their quadratic computational complexity concerning sequence length remains a significant bottleneck…

Computation and Language · Computer Science 2025-06-05 Zichuan Fu , Wentao Song , Yejing Wang , Xian Wu , Yefeng Zheng , Yingying Zhang , Derong Xu , Xuetao Wei , Tong Xu , Xiangyu Zhao

Long-context modeling is a pivotal capability for Large Language Models, yet the quadratic complexity of attention remains a critical bottleneck, particularly during the compute-intensive prefilling phase. While various sparse attention…

Computation and Language · Computer Science 2026-03-09 Qihang Fan , Huaibo Huang , Zhiying Wu , Juqiu Wang , Bingning Wang , Ran He

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

Recent advance in sparse attention mechanisms has demonstrated strong potential for reducing the computational cost of long-context training and inference in large language models (LLMs). Native Sparse Attention (NSA), one state-of-the-art…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-14 Ran Yan , Youhe Jiang , Zhuoming Chen , Haohui Mai , Beidi Chen , Binhang Yuan

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

In sequence to sequence learning, the self-attention mechanism proves to be highly effective, and achieves significant improvements in many tasks. However, the self-attention mechanism is not without its own flaws. Although self-attention…

Computation and Language · Computer Science 2019-11-22 Guangxiang Zhao , Xu Sun , Jingjing Xu , Zhiyuan Zhang , Liangchen Luo

Self-attention based Transformer has demonstrated the state-of-the-art performances in a number of natural language processing tasks. Self-attention is able to model long-term dependencies, but it may suffer from the extraction of…

Computation and Language · Computer Science 2019-12-30 Guangxiang Zhao , Junyang Lin , Zhiyuan Zhang , Xuancheng Ren , Qi Su , Xu Sun

Sparse attention reduces the quadratic complexity of full self-attention but faces two challenges: (1) an attention gap, where applying sparse attention to full-attention-trained models causes performance degradation due to train-inference…

Computation and Language · Computer Science 2026-02-02 Zhenyi Shen , Junru Lu , Lin Gui , Jiazheng Li , Yulan He , Di Yin , Xing Sun

Self-attention in transformer models is an incremental associative memory that maps key vectors to value vectors. One way to speed up self-attention is to employ GPU-compatible vector search algorithms based on standard partitioning methods…

Computation and Language · Computer Science 2025-06-04 Pierre-Emmanuel Mazaré , Gergely Szilvasy , Maria Lomeli , Francisco Massa , Naila Murray , Hervé Jégou , Matthijs Douze

The Segment Anything Model (SAM) has advanced interactive segmentation but is limited by the high computational cost on high-resolution images. This requires downsampling to meet GPU constraints, sacrificing the fine-grained details needed…

Computer Vision and Pattern Recognition · Computer Science 2024-11-26 You Huang , Wenbin Lai , Jiayi Ji , Liujuan Cao , Shengchuan Zhang , Rongrong Ji

The efficiency of large language models (LLMs) remains a critical challenge, particularly in contexts where computational resources are limited. Traditional attention mechanisms in these models, while powerful, require significant…

Computation and Language · Computer Science 2024-07-19 Bingli Liao , Danilo Vasconcellos Vargas

LLMs have demonstrated remarkable proficiency in understanding tasks but continue to struggle with long-context comprehension, particularly with content located in the middle of extensive inputs. This limitation, known as the…

Computation and Language · Computer Science 2025-03-03 James Begin , Namit Agrawal , Eshan Singh , Yicheng Fu , Sean O'Brien , Vasu Sharma , Kevin Zhu

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

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

Large language models (LLMs) can solve challenging tasks. However, their inference computation on modern GPUs is highly inefficient due to the increasing number of tokens they must attend to as they generate new ones. To address this…

Computation and Language · Computer Science 2024-04-16 Tian Jin , Wanzin Yazar , Zifei Xu , Sayeh Sharify , Xin Wang

Large vision-language models (VLMs) enable joint processing of text and images. However, incorporating vision data significantly increases the prompt length, resulting in a longer time to first token (TTFT). This bottleneck can be…

Computer Vision and Pattern Recognition · Computer Science 2026-02-02 Tharun Adithya Srikrishnan , Deval Shah , Timothy Hein , Ahmed Hasssan , Stephen Youn , Steven K. Reinhardt

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

Large language models have achieved notable success across various domains, yet efficient inference is still limited by the quadratic computation complexity of the attention mechanism. The inference consists of prefilling and decoding…

Computation and Language · Computer Science 2024-09-24 Junlin Lv , Yuan Feng , Xike Xie , Xin Jia , Qirong Peng , Guiming Xie
‹ Prev 1 4 5 6 7 8 10 Next ›