中文
相关论文

相关论文: Universal Approximation with Softmax Attention

200 篇论文

Vision transformers (ViTs) have pushed the state-of-the-art for visual perception tasks. The self-attention mechanism underpinning the strength of ViTs has a quadratic complexity in both computation and memory usage. This motivates the…

计算机视觉与模式识别 · 计算机科学 2024-03-18 Jiachen Lu , Junge Zhang , Xiatian Zhu , Jianfeng Feng , Tao Xiang , Li Zhang

We introduce Performers, Transformer architectures which can estimate regular (softmax) full-rank-attention Transformers with provable accuracy, but using only linear (as opposed to quadratic) space and time complexity, without relying on…

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…

机器学习 · 计算机科学 2024-03-05 Sadegh Mahdavi , Renjie Liao , Christos Thrampoulidis

Despite the widespread adoption of prompting, prompt tuning and prefix-tuning of transformer models, our theoretical understanding of these fine-tuning methods remains limited. A key question is whether one can arbitrarily modify the…

机器学习 · 计算机科学 2024-02-23 Aleksandar Petrov , Philip H. S. Torr , Adel Bibi

Self-attention is often viewed as probabilistic query-key lookup, motivating designs that preserve normalized attention scores and fixed positional semantics. We advocate a simpler and more unified perspective: an autoregressive attention…

机器学习 · 计算机科学 2026-02-16 Jiecheng Lu , Shihao Yang

We prove several universal approximation results at minimal or near-minimal width for approximation of $L^p(\mathbb{R}^{d_x}, \mathbb{R}^{d_y})$ and $C^0(\mathbb{R}^{d_x}, \mathbb{R}^{d_y})$ on compact sets. Our approach uses a unified…

神经与进化计算 · 计算机科学 2025-12-29 Dennis Rochau , Robin Chan , Hanno Gottschalk

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…

计算机视觉与模式识别 · 计算机科学 2025-05-23 Yuang Ai , Huaibo Huang , Tao Wu , Qihang Fan , Ran He

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…

机器学习 · 计算机科学 2026-02-20 Gabriel Mongaras , Eric C. Larson

Linear Transformers and State Space Models have emerged as efficient alternatives to softmax Transformers for causal sequence modeling, enabling parallel training via matrix multiplication and efficient RNN-style inference. However, despite…

Natural language processing (NLP) made an impressive jump with the introduction of Transformers. ChatGPT is one of the most famous examples, changing the perception of the possibilities of AI even outside the research community. However,…

机器学习 · 计算机科学 2023-07-06 Silas Alberti , Niclas Dern , Laura Thesing , Gitta Kutyniok

Prompt-tuning is an emerging strategy to adapt large language models (LLM) to downstream tasks by learning a (soft-)prompt parameter from data. Despite its success in LLMs, there is limited theoretical understanding of the power of…

机器学习 · 计算机科学 2023-06-07 Samet Oymak , Ankit Singh Rawat , Mahdi Soltanolkotabi , Christos Thrampoulidis

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…

计算机视觉与模式识别 · 计算机科学 2025-08-05 Qihang Fan , Huaibo Huang , Yuang Ai , Ran He

In sequence to sequence learning, the self-attention mechanism proves to be highly effective, and achieves significant improvements in many tasks. However, the self-attention mechanism is not without its own flaws. Although self-attention…

计算与语言 · 计算机科学 2019-11-22 Guangxiang Zhao , Xu Sun , Jingjing Xu , Zhiyuan Zhang , Liangchen Luo

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…

机器学习 · 计算机科学 2024-08-28 Songlin Yang , Bailin Wang , Yikang Shen , Rameswar Panda , Yoon Kim

Attention mechanisms, particularly softmax attention, have been instrumental in the success of transformer-based models such as GPT. However, the quadratic memory complexity of softmax attention with respect to sequence length poses…

机器学习 · 计算机科学 2026-02-20 Gabriel Mongaras , Trevor Dohm , Eric C. Larson

The Transformer architecture consists of self-attention and feed-forward networks (FFNs) which can be viewed as key-value memories according to previous works. However, FFN and traditional memory utilize different activation functions…

计算与语言 · 计算机科学 2023-02-14 Kai Shen , Junliang Guo , Xu Tan , Siliang Tang , Rui Wang , Jiang Bian

Transformers are state-of-the-art models for a variety of sequence modeling tasks. At their core is an attention function which models pairwise interactions between the inputs at every timestep. While attention is powerful, it does not…

计算与语言 · 计算机科学 2021-03-23 Hao Peng , Nikolaos Pappas , Dani Yogatama , Roy Schwartz , Noah A. Smith , Lingpeng Kong

Attention based models such as Transformers involve pairwise interactions between data points, modeled with a learnable attention matrix. Importantly, this attention matrix is normalized with the SoftMax operator, which makes it row-wise…

机器学习 · 计算机科学 2022-01-25 Michael E. Sander , Pierre Ablin , Mathieu Blondel , Gabriel Peyré

A striking property of transformers is their ability to perform in-context learning (ICL), a machine learning framework in which the learner is presented with a novel context during inference implicitly through some data, and tasked with…

机器学习 · 计算机科学 2024-05-29 Liam Collins , Advait Parulekar , Aryan Mokhtari , Sujay Sanghavi , Sanjay Shakkottai

We propose a simple modification to the conventional attention mechanism applied by Transformers: Instead of quantifying pairwise query-key similarity with scaled dot-products, we quantify it with the logarithms of scaled dot-products of…

机器学习 · 计算机科学 2024-04-30 Franz A. Heinsen