中文
相关论文

相关论文: On the Invariants of Softmax Attention

200 篇论文

Softmax attention defines an interaction through $d_h$ head dimensions, but not all dimensions carry equal weight once real text passes through. We decompose the attention logit field into a learned component and a generated component and…

计算与语言 · 计算机科学 2026-04-09 Wonsuk Lee

We examine the intrinsic (within the attention head) and extrinsic (amongst the attention heads) structure of the self-attention mechanism in transformers. Theoretical evidence for invariance of the self-attention mechanism to softmax…

数值分析 · 数学 2025-06-19 Oluwadamilola Fasina , Ruben V. C. Pohle , Pei-Chun Su , Ronald R. Coifman

Large language models rely on attention mechanisms with a softmax activation. Yet the dominance of softmax over alternatives (e.g., component-wise or linear) remains poorly understood, and many theoretical works have focused on the…

机器学习 · 计算机科学 2026-02-27 O. Duranthon , P. Marion , C. Boyer , B. Loureiro , L. Zdeborová

We characterize the pre-softmax attention matrix $\mathbf{QK^\top}$ in transformers as an associative memory matrix encoding pairwise associations between input features. By decomposing this matrix into its symmetric and skew-symmetric…

机器学习 · 计算机科学 2026-05-28 Hyunmin Cho , Woo Kyoung Han , Kyong Hwan Jin

Attention architectures are widely used; they recently gained renewed popularity with Transformers yielding a streak of state of the art results. Yet, the geometrical implications of softmax-attention remain largely unexplored. In this work…

机器学习 · 计算机科学 2020-05-20 Oliver Richter , Roger Wattenhofer

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

We study how multi-head softmax attention models are trained to perform in-context learning on linear data. Through extensive empirical experiments and rigorous theoretical analysis, we demystify the emergence of elegant attention patterns:…

机器学习 · 计算机科学 2025-05-29 Jianliang He , Xintian Pan , Siyu Chen , Zhuoran Yang

Transformers have achieved remarkable successes across a wide range of applications, yet the theoretical foundation of their model efficiency remains underexplored. In this work, we investigate how the model parameters -- mainly attention…

机器学习 · 计算机科学 2025-10-07 Ruoxi Yu , Haotian Jiang , Jingpu Cheng , Penghao Yu , Qianxiao Li , Zhong Li

Attention is a core component of transformer architecture, whether encoder-only, decoder-only, or encoder-decoder model. However, the standard softmax attention often produces noisy probability distribution, which can impair effective…

计算与语言 · 计算机科学 2025-11-11 Dhananjay Ram , Wei Xia , Stefano Soatto

Multi-head attention enables transformer models to represent multiple attention patterns simultaneously. Empirically, head specialization emerges in distinct stages during training, while many heads remain redundant and learn similar…

机器学习 · 计算机科学 2026-03-05 M. Sagitova , O. Duranthon , L. Zdeborová

Transformers have recently revolutionized many domains in modern machine learning and one salient discovery is their remarkable in-context learning capability, where models can solve an unseen task by utilizing task-specific prompts without…

机器学习 · 计算机科学 2023-10-10 Yu Huang , Yuan Cheng , Yingbin Liang

Attention layers are the core component of transformers, the current state-of-the-art neural network architecture. Alternatives to softmax-based attention are being explored due to its tendency to hinder effective information flow. Even at…

机器学习 · 计算机科学 2025-06-17 Thiziri Nait Saada , Alireza Naderi , Jared Tanner

Attention scores in transformers are bilinear forms $S_{ij} = x_i^\top M x_j / \sqrt{d_h}$ whose maximum magnitude governs overflow risk in low-precision training. We derive a \emph{rank-aware concentration inequality}: when the interaction…

机器学习 · 计算机科学 2026-02-24 Seyed Morteza Emadi

Large language models (LLMs) are known for their exceptional performance in natural language processing, making them highly effective in many human life-related or even job-related tasks. The attention mechanism in the Transformer…

计算与语言 · 计算机科学 2023-04-27 Shuai Li , Zhao Song , Yu Xia , Tong Yu , Tianyi Zhou

In deep learning theory, the covariance matrix of the representations serves as a proxy to examine the network's trainability. Motivated by the success of Transformers, we study the covariance matrix of a modified Softmax-based attention…

机器学习 · 统计学 2023-12-12 Lorenzo Noci , Chuning Li , Mufan Bill Li , Bobby He , Thomas Hofmann , Chris Maddison , Daniel M. Roy

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…

机器学习 · 计算机科学 2016-09-20 Alexandre de Brébisson , Pascal Vincent

At the core of the popular Transformer architecture is the self-attention mechanism, which dynamically assigns softmax weights to each input token so that the model can focus on the most salient information. However, the softmax structure…

机器学习 · 计算机科学 2025-05-27 Fanqi Yan , Huy Nguyen , Pedram Akbarian , Nhat Ho , Alessandro Rinaldo

Although softmax attention drives state-of-the-art performance for sequence models, its quadratic complexity limits scalability, motivating linear alternatives such as state space models (SSMs). While these alternatives improve efficiency,…

机器学习 · 计算机科学 2025-10-13 Rahel Rickenbach , Jelena Trisovic , Alexandre Didier , Jerome Sieber , Melanie N. Zeilinger

The Transformer model architecture has become one of the most widely used in deep learning and the attention mechanism is at its core. The standard attention formulation uses a softmax operation applied to a scaled dot product between query…

机器学习 · 计算机科学 2026-04-02 Hariprasath Govindarajan , Per Sidén , Jacob Roll , Fredrik Lindsten

Random-feature-based attention (RFA) is an efficient approximation of softmax attention with linear runtime and space complexity. However, the approximation gap between RFA and conventional softmax attention is not well studied. Built upon…

机器学习 · 计算机科学 2023-02-10 Lin Zheng , Jianbo Yuan , Chong Wang , Lingpeng Kong
‹ 上一页 1 2 3 10 下一页 ›