English
Related papers

Related papers: Loki: Low-rank Keys for Efficient Sparse Attention

200 papers

This paper proposes SR-KI, a novel approach for integrating real-time and large-scale structured knowledge bases (KBs) into large language models (LLMs). SR-KI begins by encoding KBs into key-value pairs using a pretrained encoder, and…

Computation and Language · Computer Science 2025-11-11 Bohan Yu , Wei Huang , Kang Liu

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

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

Self-attention dominates the computational and memory cost of long-context LLM inference across both prefill and decode phases. To address this challenge, we introduce Sketch&Walk Attention, a training-free sparse attention method that…

Machine Learning · Computer Science 2026-02-10 Hoang Anh Duy Le , Sahil Joshi , Zeyu Yang , Zhaozhuo Xu , Anshumali Shrivastava

Large Language Models (LLMs) with extended context lengths face significant computational challenges during the pre-filling phase, primarily due to the quadratic complexity of self-attention. Existing methods typically employ dynamic…

Machine Learning · Computer Science 2025-05-30 Yu Zhang , Dong Guo , Fang Wu , Guoliang Zhu , Dian Ding , Yiming Zhang

Large Language Models (LLMs) have revolutionized the field of natural language processing, achieving unprecedented performance across a variety of applications. However, their increased computational and memory demands present significant…

Computation and Language · Computer Science 2025-02-28 Yuhui Xu , Zhanming Jie , Hanze Dong , Lei Wang , Xudong Lu , Aojun Zhou , Amrita Saha , Caiming Xiong , Doyen Sahoo

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

Large language models (LLMs) based on Transformer Decoders have become the preferred choice for conversational generative AI. Despite the overall superiority of the Decoder architecture, the gradually increasing Key-Value (KV) cache during…

Computation and Language · Computer Science 2025-07-16 Luohe Shi , Zuchao Li , Lefei Zhang , Guoming Liu , Baoyuan Qi , Hai Zhao

Rapid advances in Large Language Models (LLMs) have spurred demand for processing extended context sequences in contemporary applications. However, this progress faces two challenges: performance degradation due to sequence lengths…

Computation and Language · Computer Science 2025-10-10 Wei Wu , Zhuoshi Pan , Chao Wang , Liyi Chen , Yunchu Bai , Tianfu Wang , Kun Fu , Zheng Wang , Hui Xiong

Long-context ability, has become one of the most important iteration direction of next-generation Large Language Models, particularly in semantic understanding/reasoning, code agentic intelligence and recommendation system. However, the…

The quadratic computational complexity of self-attention remains a fundamental bottleneck for scaling Large Language Models (LLMs) to long contexts, particularly during the pre-filling phase. In this paper, we rethink the causal attention…

Machine Learning · Computer Science 2026-03-09 Lin Niu , Xin Luo , Linchuan Xie , Yifu Sun , Guanghua Yu , Jianchen Zhu , S Kevin Zhou

Large Language Models (LLMs) are increasingly deployed in scenarios demanding ultra-long context reasoning, such as agentic workflows and deep research understanding. However, long-context inference is constrained by the KV cache, a…

Hardware Architecture · Computer Science 2026-03-11 Jianlong Lei , Shashikant Ilager

The quadratic complexity of the attention mechanism remains a fundamental barrier to scaling Large Language Models (LLMs) to longer contexts, creating a critical bottleneck in both computation and memory. To address this, we introduce AQUA…

Machine Learning · Computer Science 2025-09-16 Santhosh G S , Saurav Prakash , Balaraman Ravindran

Existing low-rank adaptation (LoRA) methods face challenges on sparse large language models (LLMs) due to the inability to maintain sparsity. Recent works introduced methods that maintain sparsity by augmenting LoRA techniques with…

Computation and Language · Computer Science 2025-01-16 Yuxuan Hu , Jing Zhang , Xiaodong Chen , Zhe Zhao , Cuiping Li , Hong Chen

The increasing context window size in large language models (LLMs) has improved their ability to handle complex, long-text tasks. However, as the conversation rounds continue, it is required to store a large amount of KV cache in GPU…

Computation and Language · Computer Science 2025-06-30 Yaohua Tang , Zhicheng Hu , Kun Cheng , Fan Mo , Qiheng Lv , Hua Wang , Zhi Chen

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) face limitations due to the high demand on GPU memory and computational resources when handling long contexts. While sparsify the Key-Value (KV) cache of transformer model is a typical strategy to alleviate…

Machine Learning · Computer Science 2024-02-06 Yumeng Wang , Zhenyang Xiao

Sparse attention mechanisms aim to reduce computational overhead with minimal accuracy loss by selectively processing salient tokens. Despite their effectiveness, most methods merely exploit a model's inherent sparsity and thus plateau at…

Machine Learning · Computer Science 2026-03-02 Feng Chen , Yefei He , Lequan Lin , Chenhui Gou , Jing Liu , Bohan Zhuang , Qi Wu

Large Vision-Language Models (VLMs) have achieved remarkable success in multi-modal reasoning, but their inference time efficiency remains a significant challenge due to the memory overhead during decoding, especially when the query and…

Computer Vision and Pattern Recognition · Computer Science 2026-03-26 Fatih Ilhan , Gaowen Liu , Ramana Rao Kompella , Selim Furkan Tekin , Tiansheng Huang , Zachary Yahn , Yichang Xu , Ling Liu

Multimodal Large Language Models (MLLMs) incur significant computational cost from processing numerous vision tokens through all LLM layers. Prior pruning methods operate either before the LLM, limiting generality due to diverse…

Computer Vision and Pattern Recognition · Computer Science 2026-02-16 Omer Faruk Deniz , Ruiyu Mao , Ruochen Li , Yapeng Tian , Latifur Khan