English
Related papers

Related papers: Self-attention Does Not Need $O(n^2)$ Memory

200 papers

Transformer models are computationally costly on long sequences since regular attention has quadratic $O(n^2)$ time complexity. We introduce Wavelet-Enhanced Random Spectral Attention (WERSA), a novel mechanism of linear $O(n)$ time…

Machine Learning · Computer Science 2025-07-14 Vincenzo Dentamaro

Attention based models have achieved many remarkable breakthroughs in numerous applications. However, the quadratic complexity of Attention makes the vanilla Attention based models hard to apply to long sequence tasks. Various improved…

Machine Learning · Computer Science 2024-09-18 Xue Wang , Tian Zhou , Jianqing Zhu , Jialin Liu , Kun Yuan , Tao Yao , Wotao Yin , Rong Jin , HanQin Cai

Naively storing a counter up to value $n$ would require $\Omega(\log n)$ bits of memory. Nelson and Yu [NY22], following work of [Morris78], showed that if the query answers need only be $(1+\epsilon)$-approximate with probability at least…

Data Structures and Algorithms · Computer Science 2022-11-09 Ishaq Aden-Ali , Yanjun Han , Jelani Nelson , Huacheng Yu

Transformer-based models have become ubiquitous in natural language processing thanks to their large capacity, innate parallelism and high performance. The contextualizing component of a Transformer block is the $\textit{pairwise…

Machine Learning · Computer Science 2020-06-08 Ankit Gupta , Jonathan Berant

The transformer has revolutionized modern AI across language, vision, and beyond. It consists of $L$ layers, each running $H$ attention heads in parallel and feeding the combined output to the subsequent layer. In attention, the input…

Computational Complexity · Computer Science 2026-03-13 Barna Saha , Yinzhan Xu , Christopher Ye , Hantao Yu

The self-attention mechanism has significantly advanced the field of natural language processing, facilitating the development of advanced language-learning machines. Although its utility is widely acknowledged, the precise mechanisms of…

Computation and Language · Computer Science 2026-02-04 Tal Halevi , Yarden Tzach , Ronit D. Gross , Shalom Rosner , Ido Kanter

In this paper, we propose that the dot product pairwise matching attention layer, which is widely used in Transformer-based models, is redundant for the model performance. Attention, in its original formulation, has to be seen rather as a…

Computation and Language · Computer Science 2022-06-29 Uladzislau Yorsh , Alexander Kovalenko , Vojtěch Vančura , Daniel Vašata , Pavel Kordík , Tomáš Mikolov

We describe an efficient hierarchical method to compute attention in the Transformer architecture. The proposed attention mechanism exploits a matrix structure similar to the Hierarchical Matrix (H-Matrix) developed by the numerical…

Machine Learning · Computer Science 2021-07-27 Zhenhai Zhu , Radu Soricut

We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples. This proves a recent conjecture of Steinhardt, Valiant and Wager and shows that for some learning problems a…

Machine Learning · Computer Science 2016-02-17 Ran Raz

Transformers have become the go-to architecture for language and vision tasks, yet their theoretical properties, especially memorization capacity, remain elusive. This paper investigates the memorization abilities of multi-head attention…

Machine Learning · Computer Science 2024-03-05 Sadegh Mahdavi , Renjie Liao , Christos Thrampoulidis

Transformers have become central to natural language processing and large language models, but their deployment at scale faces three major challenges. First, the attention mechanism requires massive matrix multiplications and frequent…

Hardware Architecture · Computer Science 2026-01-22 Xiaoxuan Yang , Peilin Chen , Tergel Molom-Ochir , Yiran Chen

We propose a new attention mechanism with linear complexity, ATP, that fixates \textbf{A}ttention on \textbf{T}op \textbf{P}rincipal keys, rather than on each individual token. Particularly, ATP is driven by an important observation that…

Machine Learning · Computer Science 2024-03-06 Yue Niu , Saurav Prakash , Salman Avestimehr

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

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

This paper investigates the limitations of transformers for entity-tracking tasks in large language models. We identify a theoretical constraint, showing that transformers require at least $\log_2 (n+1)$ layers to handle entity tracking…

Machine Learning · Computer Science 2024-12-12 Erwan Fagnou , Paul Caillon , Blaise Delattre , Alexandre Allauzen

Transformer-based architectures have become the prevailing backbone of large language models. However, the quadratic time and memory complexity of self-attention remains a fundamental obstacle to efficient long-context modeling. To address…

Computation and Language · Computer Science 2026-02-10 Yutao Sun , Zhenyu Li , Yike Zhang , Tengyu Pan , Bowen Dong , Yuyi Guo , Jianyong Wang

Models based on the Transformer architecture have achieved better accuracy than the ones based on competing architectures for a large set of tasks. A unique feature of the Transformer is its universal application of a self-attention…

Machine Learning · Computer Science 2020-10-01 Nan Ding , Xinjie Fan , Zhenzhong Lan , Dale Schuurmans , Radu Soricut

Existing attention mechanisms are trained to attend to individual items in a collection (the memory) with a predefined, fixed granularity, e.g., a word token or an image grid. We propose area attention: a way to attend to areas in the…

Machine Learning · Computer Science 2020-05-11 Yang Li , Lukasz Kaiser , Samy Bengio , Si Si

Attention scales quadratically with sequence length, fundamentally limiting long-context inference. Existing block-granularity sparsification can reduce latency, but coarse blocks impose an intrinsic sparsity ceiling, making further…

Machine Learning · Computer Science 2026-05-06 Yu Zhang , Songwei Liu , Chenqian Yan , Sheng Lin , Beichen Ning , Fangmin Chen , Xing Wang

The success of the self-attention mechanism in classical machine learning models has inspired the development of quantum analogs aimed at reducing computational overhead. Self-attention integrates learnable query and key matrices to…

‹ Prev 1 4 5 6 7 8 10 Next ›