English
Related papers

Related papers: Degrees of Freedom for Linear Attention: Distillin…

200 papers

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

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 quadratic complexity of standard attention mechanisms poses a significant scalability bottleneck for large language models (LLMs) in long-context scenarios. While hybrid attention strategies that combine sparse and full attention within…

Computation and Language · Computer Science 2026-01-29 Zecheng Tang , Quantong Qiu , Yi Yang , Zhiyi Hong , Haiya Xiang , Kebin Liu , Qingqing Dang , Juntao Li , Min Zhang

Transformers have achieved state-of-the-art performance across various tasks, but suffer from a notable quadratic complexity in sequence length due to the attention mechanism. In this work, we propose MonarchAttention -- a novel approach to…

Machine Learning · Computer Science 2025-10-28 Can Yaras , Alec S. Xu , Pierre Abillama , Changwoo Lee , Laura Balzano

Transformers excel across domains, yet their quadratic attention complexity poses a barrier to scaling. Random-feature attention, as in Performers, can reduce this cost to linear in the sequence length by approximating the softmax kernel…

Machine Learning · Computer Science 2026-03-05 Amirhossein Farzam , Hossein Mobahi , Nolan Andrew Miller , Luke Sernau

Transformers are state-of-the-art in a wide range of NLP tasks and have also been applied to many real-world products. Understanding the reliability and certainty of transformer model predictions is crucial for building trustable machine…

Computation and Language · Computer Science 2021-12-28 Jiahuan Pei , Cheng Wang , György Szarvas

Transformers have achieved remarkable success in sequence modeling and beyond but suffer from quadratic computational and memory complexities with respect to the length of the input sequence. Leveraging techniques include sparse and linear…

Machine Learning · Computer Science 2022-08-02 Tan Nguyen , Richard G. Baraniuk , Robert M. Kirby , Stanley J. Osher , Bao Wang

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

Recent advances in generative diffusion models have shown a notable inherent understanding of image style and semantics. In this paper, we leverage the self-attention features from pretrained diffusion networks to transfer the visual…

Computer Vision and Pattern Recognition · Computer Science 2025-02-28 Yang Zhou , Xu Gao , Zichong Chen , Hui Huang

Dot-product attention has wide applications in computer vision and natural language processing. However, its memory and computational costs grow quadratically with the input size. Such growth prohibits its application on high-resolution…

Computer Vision and Pattern Recognition · Computer Science 2024-01-22 Zhuoran Shen , Mingyuan Zhang , Haiyu Zhao , Shuai Yi , Hongsheng Li

The quadratic computational cost of the self-attention mechanism is a primary challenge in scaling Transformer models. While attention sparsity is widely studied as a technique to improve computational efficiency, it is almost universally…

Computation and Language · Computer Science 2025-08-11 Sagar Gandhi , Vishal Gandhi

Feature selection is the problem of selecting a subset of features for a machine learning model that maximizes model quality subject to a budget constraint. For neural networks, prior methods, including those based on $\ell_1$…

Machine Learning · Computer Science 2024-06-19 Taisuke Yasuda , MohammadHossein Bateni , Lin Chen , Matthew Fahrbach , Gang Fu , Vahab Mirrokni

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

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

We propose FMMformers, a class of efficient and flexible transformers inspired by the celebrated fast multipole method (FMM) for accelerating interacting particle simulation. FMM decomposes particle-particle interaction into near-field and…

Machine Learning · Computer Science 2021-08-06 Tan M. Nguyen , Vai Suliafu , Stanley J. Osher , Long Chen , Bao Wang

Transformers and their attention mechanism have been revolutionary in the field of Machine Learning. While originally proposed for the language data, they quickly found their way to the image, video, graph, etc. data modalities with various…

Machine Learning · Computer Science 2025-09-22 Saeed Amizadeh , Sara Abdali , Yinheng Li , Kazuhito Koishida

Rectified Flow text-to-image models surpass diffusion models in image quality and text alignment, but adapting ReFlow for real-image editing remains challenging. We propose a new real-image editing method for ReFlow by analyzing the…

Computer Vision and Pattern Recognition · Computer Science 2025-07-03 Jimyeong Kim , Jungwon Park , Yeji Song , Nojun Kwak , Wonjong Rhee

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

Fine-tuning is a popular way of exploiting knowledge contained in a pre-trained convolutional network for a new visual recognition task. However, the orthogonal setting of transferring knowledge from a pretrained network to a visually…

Computer Vision and Pattern Recognition · Computer Science 2020-08-28 Amelie Royer , Christoph H. Lampert

We propose the first method to show theoretical limitations for one-layer softmax transformers with arbitrarily many precision bits (even infinite). We establish those limitations for three tasks that require advanced reasoning. The first…

‹ Prev 1 3 4 5 6 7 10 Next ›