English
Related papers

Related papers: Neural Attention Search Linear: Towards Adaptive T…

200 papers

We present Neural Attention Search (NAtS), a framework that automatically evaluates the importance of each token within a sequence and determines if the corresponding token can be dropped after several steps. This approach can efficiently…

Computation and Language · Computer Science 2025-10-24 Difan Deng , Marius Lindauer

Transformers excel at sequence modeling but face quadratic complexity, while linear attention offers improved efficiency but often compromises recall accuracy over long contexts. In this work, we introduce Native Hybrid Attention (NHA), a…

Computation and Language · Computer Science 2026-04-16 Jusen Du , Jiaxi Hu , Tao Zhang , Weigao Sun , Yu Cheng

The attention mechanism in Transformers is an important primitive for accurate and scalable sequence modeling. Its quadratic-compute and linear-memory complexity however remain significant bottlenecks. Linear attention and state-space…

Machine Learning · Computer Science 2026-03-03 Han Guo , Songlin Yang , Tarushii Goel , Eric P. Xing , Tri Dao , Yoon Kim

Recently, numerous efficient Transformers have been proposed to reduce the quadratic computational complexity of standard Transformers caused by the Softmax attention. However, most of them simply swap Softmax with an efficient attention…

Computation and Language · Computer Science 2022-07-29 Zexiang Liu , Dong Li , Kaiyue Lu , Zhen Qin , Weixuan Sun , Jiacheng Xu , Yiran Zhong

Linearizing pretrained large language models (LLMs) primarily relies on intra-layer hybrid attention mechanisms to alleviate the quadratic complexity of standard softmax attention. Existing methods perform token routing based on…

Machine Learning · Computer Science 2026-02-03 Weikang Meng , Liangyu Huo , Yadan Luo , Jiawen Guan , Jingyi Zhang , Yingjian Li , Zheng Zhang

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

In this work, we conduct a systematic analysis of Native Sparse Attention (NSA) and propose targeted improvements that enhance long-context modeling. A key insight is that alternating between local (sliding-window) and global (compression,…

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

While linear attention reduces the quadratic complexity of standard Transformers to linear time, it often lags behind in expressivity due to the removal of softmax normalization. This omission eliminates \emph{global competition}, a…

Machine Learning · Computer Science 2026-02-03 Mingwei Xu , Xuan Lin , Xinnan Guo , Wanqing Xu , Wanyun Cui

Looped Transformers (LT) have emerged as a powerful architecture by iterating their layers multiple times before decoding the final token. However, pairing them with full attention retains quadratic complexity, making them computationally…

Machine Learning · Computer Science 2026-05-26 Chunyuan Deng , Yizhe Zhang , Rui-Jie Zhu , Yuanyuan Xu , Jiarui Liu , T. S. Eugene Ng , Hanjie Chen

Multimodal Transformers serve as the backbone for state-of-the-art vision-language models, yet their quadratic attention complexity remains a critical barrier to scalability. In this work, we investigate the viability of Linear Attention…

Computer Vision and Pattern Recognition · Computer Science 2026-04-14 Armin Gerami , Seyedehanita Madani , Ramani Duraiswami

The softmax content-based attention mechanism has proven to be very beneficial in many applications of recurrent neural networks. Nevertheless it suffers from two major computational limitations. First, its computations for an attention…

Machine Learning · Computer Science 2016-09-20 Alexandre de Brébisson , Pascal Vincent

The attention mechanism is an important reason for the success of transformers. It relies on computing pairwise relations between tokens. To reduce the high computational cost of standard quadratic attention, linear attention has been…

Artificial Intelligence · Computer Science 2026-02-13 Hanno Ackermann , Hong Cai , Mohsen Ghafoorian , Amirhossein Habibian

While the Transformer architecture dominates many fields, its quadratic self-attention complexity hinders its use in large-scale applications. Linear attention offers an efficient alternative, but its direct application often degrades…

Computer Vision and Pattern Recognition · Computer Science 2026-01-15 Kewei Zhang , Ye Huang , Yufan Deng , Jincheng Yu , Junsong Chen , Huan Ling , Enze Xie , Daquan Zhou

Modeling long sequences of user behaviors has emerged as a critical frontier in generative recommendation. However, existing solutions face a dilemma: linear attention mechanisms achieve efficiency at the cost of retrieval precision due to…

Information Retrieval · Computer Science 2026-02-23 Lei Xin , Yuhao Zheng , Ke Cheng , Changjiang Jiang , Zifan Zhang , Fanhu Zeng

Large transformer models have achieved state-of-the-art results in numerous natural language processing tasks. Among the pivotal components of the transformer architecture, the attention mechanism plays a crucial role in capturing token…

Computation and Language · Computer Science 2026-03-16 Yichuan Deng , Zhao Song , Kaijun Yuan , Tianyi Zhou

Transformers face quadratic complexity and memory issues with long sequences, prompting the adoption of linear attention mechanisms using fixed-size hidden states. However, linear models often suffer from limited recall performance, leading…

Computation and Language · Computer Science 2025-07-10 Dustin Wang , Rui-Jie Zhu , Steven Abreu , Yong Shan , Taylor Kergan , Yuqi Pan , Yuhong Chou , Zheng Li , Ge Zhang , Wenhao Huang , Jason Eshraghian

Large Language Models (LLMs) are increasingly prevalent in the field of long-context modeling, however, their inference computational costs have become a critical bottleneck hindering the advancement of tasks such as agents and multimodal…

Computation and Language · Computer Science 2025-12-04 Di Xiu , Hongyin Tang , Bolin Rong , Lizhi Yan , Jingang Wang , Yifan Lu , Xunliang Cai

Since its introduction, softmax attention has become the backbone of modern transformer architectures due to its expressiveness and scalability across a wide range of tasks. However, the main drawback of softmax attention is the quadratic…

Machine Learning · Computer Science 2026-02-20 Gabriel Mongaras , Eric C. Larson

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

The quadratic computational complexity of standard attention mechanisms presents a severe scalability bottleneck for LLMs in long-context scenarios. While hybrid attention mechanisms combining Full Attention (FA) and Sparse Attention (SA)…

Machine Learning · Computer Science 2026-04-10 Quantong Qiu , Zhiyi Hong , Yi Yang , Haitian Wang , Kebin Liu , Qingqing Dang , Juntao Li , Min Zhang
‹ Prev 1 2 3 10 Next ›