English
Related papers

Related papers: SAGA: Selective Adaptive Gating for Efficient and …

200 papers

Modern autoregressive models rely on attention, yet the Softmax full attention in Transformers scales quadratically with sequence length. Sliding Window Attention (SWA) achieves linear-time encoding/decoding by constraining the attention…

Machine Learning · Computer Science 2026-01-08 Jiaxu Liu , Yuhe Bai , Xiangyu Yin , Christos-Savvas Bouganis

Linear attention Transformers and their gated variants, celebrated for enabling parallel training and efficient recurrent inference, still fall short in recall-intensive tasks compared to traditional Transformers and demand significant…

Computation and Language · Computer Science 2024-11-01 Yu Zhang , Songlin Yang , Ruijie Zhu , Yue Zhang , Leyang Cui , Yiqiao Wang , Bolun Wang , Freda Shi , Bailin Wang , Wei Bi , Peng Zhou , Guohong Fu

Linear attention methods offer a compelling alternative to softmax attention due to their efficiency in recurrent decoding. Recent research has focused on enhancing standard linear attention by incorporating gating while retaining its…

Machine Learning · Computer Science 2025-04-08 Yingcong Li , Davoud Ataee Tarzanagh , Ankit Singh Rawat , Maryam Fazel , Samet Oymak

Gating mechanisms have been widely utilized, from early models like LSTMs and Highway Networks to recent state space models, linear attention, and also softmax attention. Yet, existing literature rarely examines the specific effects of…

Computation and Language · Computer Science 2025-05-13 Zihan Qiu , Zekun Wang , Bo Zheng , Zeyu Huang , Kaiyue Wen , Songlin Yang , Rui Men , Le Yu , Fei Huang , Suozhi Huang , Dayiheng Liu , Jingren Zhou , Junyang Lin

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

Recently, linear complexity sequence modeling networks have achieved modeling capabilities similar to Vision Transformers on a variety of computer vision tasks, while using fewer FLOPs and less memory. However, their advantage in terms of…

Computer Vision and Pattern Recognition · Computer Science 2024-05-30 Bencheng Liao , Xinggang Wang , Lianghui Zhu , Qian Zhang , Chang Huang

Transformers with linear attention allow for efficient parallel training but can simultaneously be formulated as an RNN with 2D (matrix-valued) hidden states, thus enjoying linear-time inference complexity. However, linear attention…

Machine Learning · Computer Science 2024-08-28 Songlin Yang , Bailin Wang , Yikang Shen , Rameswar Panda , Yoon Kim

The Softmax attention mechanism in Transformer models is notoriously computationally expensive, particularly due to its quadratic complexity, posing significant challenges in vision applications. In contrast, linear attention provides a far…

Computer Vision and Pattern Recognition · Computer Science 2025-03-12 Qihang Fan , Huaibo Huang , Ran He

Recent advancements in Large Language Models (LLMs) have set themselves apart with their exceptional performance in complex language modelling tasks. However, these models are also known for their significant computational and storage…

Computation and Language · Computer Science 2025-08-12 Peng Lu , Ivan Kobyzev , Mehdi Rezagholizadeh , Boxing Chen , Philippe Langlais

The computational burden of attention in long-context language models has motivated two largely independent lines of work: sparse attention mechanisms that reduce complexity by attending to selected tokens, and gated attention variants that…

Artificial Intelligence · Computer Science 2026-01-23 Alfred Shen , Aaron Shen

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

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…

As the core operator of Transformers, Softmax Attention exhibits excellent global modeling capabilities. However, its quadratic complexity limits its applicability to vision tasks. In contrast, Linear Attention shares a similar formulation…

Computer Vision and Pattern Recognition · Computer Science 2025-08-05 Qihang Fan , Huaibo Huang , Yuang Ai , Ran He

Efficiently supporting long context length is crucial for Transformer models. The quadratic complexity of the self-attention computation plagues traditional Transformers. Sliding window-based static sparse attention mitigates the problem by…

Hardware Architecture · Computer Science 2024-05-28 Zhenyu Bai , Pranav Dangi , Huize Li , Tulika Mitra

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

Transformer-based models have made remarkable progress in image restoration (IR) tasks. However, the quadratic complexity of self-attention in Transformer hinders its applicability to high-resolution images. Existing methods mitigate this…

Computer Vision and Pattern Recognition · Computer Science 2025-05-23 Yuang Ai , Huaibo Huang , Tao Wu , Qihang Fan , Ran He

The Transformer architecture has become the foundation of modern deep learning, yet its core self-attention mechanism suffers from quadratic computational complexity and lacks grounding in biological neural computation. We propose Selective…

Machine Learning · Computer Science 2026-02-17 Hasi Hays

We propose a novel attention mechanism, named Cog Attention, that enables attention weights to be negative for enhanced expressiveness, which stems from two key factors: (1) Cog Attention enhances parameter flexibility. For example, unlike…

Computation and Language · Computer Science 2025-01-31 Ang Lv , Ruobing Xie , Shuaipeng Li , Jiayi Liao , Xingwu Sun , Zhanhui Kang , Di Wang , Rui Yan

The attention module is the key component in Transformers. While the global attention mechanism offers high expressiveness, its excessive computational cost restricts its applicability in various scenarios. In this paper, we propose a novel…

Computer Vision and Pattern Recognition · Computer Science 2024-07-16 Dongchen Han , Tianzhu Ye , Yizeng Han , Zhuofan Xia , Siyuan Pan , Pengfei Wan , Shiji Song , Gao Huang

Transformer-based approaches have revolutionized image super-resolution by modeling long-range dependencies. However, the quadratic computational complexity of vanilla self-attention mechanisms poses significant challenges, often leading to…

Computer Vision and Pattern Recognition · Computer Science 2026-04-13 Dinh Phu Tran , Thao Do , Saad Wazir , Seongah Kim , Seon Kwon Kim , Daeyoung Kim
‹ Prev 1 2 3 10 Next ›