English
Related papers

Related papers: MHLA: Restoring Expressivity of Linear Attention v…

200 papers

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

While Transformer self-attention offers strong parallelism, the Key-Value (KV) cache grows linearly with sequence length and becomes a bottleneck for inference efficiency. Multi-head latent attention was recently developed to compress the…

Machine Learning · Computer Science 2025-11-04 Keqi Deng , Philip C. Woodland

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

The quadratic computation complexity of self-attention has been a persistent challenge when applying Transformer models to vision tasks. Linear attention, on the other hand, offers a much more efficient alternative with its linear…

Computer Vision and Pattern Recognition · Computer Science 2023-09-04 Dongchen Han , Xuran Pan , Yizeng Han , Shiji Song , Gao Huang

Various linear complexity models, such as Linear Transformer (LinFormer), State Space Model (SSM), and Linear RNN (LinRNN), have been proposed to replace the conventional softmax attention in Transformer structures. However, the optimal…

Machine Learning · Computer Science 2024-11-19 Yuhong Chou , Man Yao , Kexin Wang , Yuqi Pan , Ruijie Zhu , Yiran Zhong , Yu Qiao , Jibin Wu , Bo Xu , Guoqi Li

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

Linear attention significantly reduces the computational complexity of Transformers from quadratic to linear, yet it consistently lags behind softmax-based attention in performance. We identify the root cause of this degradation as the…

Machine Learning · Computer Science 2026-02-05 Weikang Meng , Liangyu Huo , Yadan Luo , Yaowei Wang , Yingjian Li , Zheng Zhang

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

Large language models (LLMs) face significant challenges in processing long contexts due to the linear growth of the key-value (KV) cache and quadratic complexity of self-attention. Existing approaches address these bottlenecks separately:…

Computation and Language · Computer Science 2026-04-17 Zeng You , Yaofo Chen , Qiuwu Chen , Ying Sun , Shuhai Zhang , Yingjian Li , Yaowei Wang , Mingkui Tan

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

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

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

Standard softmax self-attention excels in vision tasks but incurs quadratic complexity O(N^2), limiting high-resolution deployment. Linear attention reduces the cost to O(N), yet its compressed state representations can impair modeling…

Computer Vision and Pattern Recognition · Computer Science 2026-01-19 Ruibang Li , Guan Luo , Yiwei Zhang , Jin Gao , Bing Li , Weiming Hu

Attention-based models have been widely used in many areas, such as computer vision and natural language processing. However, relevant applications in time series classification (TSC) have not been explored deeply yet, causing a significant…

Machine Learning · Computer Science 2022-07-18 Bowen Zhao , Huanlai Xing , Xinhan Wang , Fuhong Song , Zhiwen Xiao

Recently, it has been argued that encoder-decoder models can be made more interpretable by replacing the softmax function in the attention with its sparse variants. In this work, we introduce a novel, simple method for achieving sparsity in…

Computation and Language · Computer Science 2021-10-07 Biao Zhang , Ivan Titov , Rico Sennrich

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

More and more evidence has shown that strengthening layer interactions can enhance the representation power of a deep neural network, while self-attention excels at learning interdependencies by retrieving query-activated information.…

Computer Vision and Pattern Recognition · Computer Science 2023-03-01 Yanwen Fang , Yuxi Cai , Jintai Chen , Jingyu Zhao , Guangjian Tian , Guodong Li

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

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 quadratic computational complexity of MultiHead SelfAttention (MHSA) remains a fundamental bottleneck in scaling Large Language Models (LLMs) for longcontext tasks. While sparse and linearized attention mechanisms attempt to mitigate…

Computation and Language · Computer Science 2025-12-19 Caner Erden
‹ Prev 1 2 3 10 Next ›