English
Related papers

Related papers: Learning When to Attend: Conditional Memory Access…

200 papers

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

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

Although transformer architectures have achieved state-of-the-art performance across diverse domains, their quadratic computational complexity with respect to sequence length remains a significant bottleneck, particularly for…

Computation and Language · Computer Science 2025-11-05 Zeyu Liu , Souvik Kundu , Lianghao Jiang , Anni Li , Srikanth Ronanki , Sravan Bodapati , Gourav Datta , Peter A. Beerel

Multimodal large language models (MLLMs) are plagued by exorbitant inference costs attributable to the profusion of visual tokens within the vision encoder. The redundant visual tokens engenders a substantial computational load and…

Computer Vision and Pattern Recognition · Computer Science 2026-02-03 Jiedong Zhuang , Lu Lu , Ming Dai , Rui Hu , Jian Chen , Qiang Liu , Haoji Hu

Transformer attention scales quadratically with sequence length O(n^2), limiting long-context use. We propose Adaptive Retention, a probabilistic, layer-wise token selection mechanism that learns which representations to keep under a strict…

Computation and Language · Computer Science 2025-10-13 S M Rafiuddin , Muntaha Nujat Khan

Transformer-based large language models face severe scalability challenges in long-context generation due to the computational and memory costs of full-context attention. Under practical computation and memory constraints, many…

Computation and Language · Computer Science 2026-05-13 Xianpeng Shang , Jiang Li , Zehua Duo , Qianyi Cai , Xiangdong Su

Scaling the effective context length is essential for advancing large language models (LLMs) toward artificial general intelligence (AGI). However, the quadratic increase in computational complexity inherent in traditional attention…

As the demand for processing extended textual data grows, the ability to handle long-range dependencies and maintain computational efficiency is more critical than ever. One of the key issues for long-sequence modeling using attention-based…

Computation and Language · Computer Science 2025-05-26 Aosong Feng , Rex Ying , Leandros Tassiulas

The quadratic complexity and weak length extrapolation of Transformers limits their ability to scale to long sequences, and while sub-quadratic solutions like linear attention and state space models exist, they empirically underperform…

Machine Learning · Computer Science 2024-04-17 Xuezhe Ma , Xiaomeng Yang , Wenhan Xiong , Beidi Chen , Lili Yu , Hao Zhang , Jonathan May , Luke Zettlemoyer , Omer Levy , Chunting Zhou

Multimodal large language models (MLLMs) enhance their perceptual capabilities by integrating visual and textual information. However, processing the massive number of visual tokens incurs a significant computational cost. Existing analysis…

Computer Vision and Pattern Recognition · Computer Science 2024-12-31 Jiedong Zhuang , Lu Lu , Ming Dai , Rui Hu , Jian Chen , Qiang Liu , Haoji Hu

Large Language Models (LLMs) encounter significant performance bottlenecks in long-sequence tasks due to the computational complexity and memory overhead inherent in the self-attention mechanism. To address these challenges, we introduce…

Artificial Intelligence · Computer Science 2026-02-17 Ziming Wang , Xiang Wang , Kailong Peng , Lang Qin , Juan Gabriel Kostelec , Christos Sourmpis , Axel Laborieux , Qinghai Guo

Long-context LLM inference is bottlenecked by the quadratic attention complexity and linear KV cache growth. Prior approaches mitigate this via post-hoc selection or eviction but overlook the root inefficiency: indiscriminate writing to…

Machine Learning · Computer Science 2026-01-29 Yen-Chieh Huang , Pi-Cheng Hsiu , Rui Fang , Ming-Syan Chen

Large language models (LLMs) have demonstrated significant improvements in contextual understanding. However, their ability to attend to truly critical information during long-context reasoning and generation still falls behind the pace.…

Computation and Language · Computer Science 2025-10-27 Yiju Guo , Wenkai Yang , Zexu Sun , Ning Ding , Zhiyuan Liu , Yankai Lin

Over more than a decade there has been an extensive research effort on how to effectively utilize recurrent models and attention. While recurrent models aim to compress the data into a fixed-size memory (called hidden state), attention…

Machine Learning · Computer Science 2025-01-03 Ali Behrouz , Peilin Zhong , Vahab Mirrokni

The original softmax-based attention mechanism (regular attention) in the extremely successful Transformer architecture computes attention between $N$ tokens, each embedded in a $D$-dimensional head, with a time complexity of $O(N^2D)$.…

Machine Learning · Computer Science 2025-10-28 Armin Gerami , Ramani Duraiswami

Softmax Attention has a quadratic time complexity in sequence length, which becomes prohibitive to run at long contexts, even with highly optimized GPU kernels. For example, FlashAttention-2/3 (exact, GPU-optimized implementations of…

Machine Learning · Computer Science 2026-04-21 Sahil Joshi , Agniva Chowdhury , Amar Kanakamedala , Ekam Singh , Evan Tu , Anshumali Shrivastava

As large language models (LLMs) and visual language models (VLMs) grow in scale and application, attention mechanisms have become a central computational bottleneck due to their high memory and time complexity. While many efficient…

Machine Learning · Computer Science 2025-07-11 Zhengyu Tian , Anantha Padmanaban Krishna Kumar , Hemant Krishnakumar , Reza Rawassizadeh

Transformer architectures have achieved remarkable success in various domains. While efficient alternatives to Softmax Attention have been widely studied, the search for more expressive mechanisms grounded in theoretical insight-even at…

Machine Learning · Computer Science 2025-10-03 Yifei Zuo , Yutong Yin , Zhichen Zeng , Ang Li , Banghua Zhu , Zhaoran Wang

We present a series of long-context LLMs that support effective context windows of up to 32,768 tokens. Our model series are built through continual pretraining from Llama 2 with longer training sequences and on a dataset where long texts…

Transformer architectures are the backbone of the modern AI revolution. However, they are based on simply stacking the same blocks in dozens of layers and processing information sequentially from one block to another. In this paper, we…

Computation and Language · Computer Science 2024-12-24 Prateek Verma , Mert Pilanci