English
Related papers

Related papers: Scalable-Softmax Is Superior for Attention

200 papers

Certified verification of transformer attention requires bounding the softmax function over interval constraints on the pre-softmax scores. Existing verifiers relax softmax ndependently of the downstream objective, leaving avoidable slack.…

Machine Learning · Computer Science 2026-05-13 Navid Rezazadeh , Arash Gholami Davoodi

Non-local (NL) block is a popular module that demonstrates the capability to model global contexts. However, NL block generally has heavy computation and memory costs, so it is impractical to apply the block to high-resolution feature maps.…

Computer Vision and Pattern Recognition · Computer Science 2022-07-28 Yooshin Cho , Youngsoo Kim , Hanbyel Cho , Jaesung Ahn , Hyeong Gwon Hong , Junmo Kim

The transformer neural network architecture uses a form of attention in which the dot product of query and key is divided by the square root of the key dimension before applying softmax. This scaling of the dot product is designed to avoid…

Machine Learning · Computer Science 2023-11-17 James Bernhard

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…

Machine Learning · Statistics 2023-12-12 Lorenzo Noci , Chuning Li , Mufan Bill Li , Bobby He , Thomas Hofmann , Chris Maddison , Daniel M. Roy

A core limitation of standard softmax attention is that it does not provide an independently interpretable measure of query--key relevance: attention scores are unbounded, while attention weights are defined only relative to competing keys.…

Machine Learning · Computer Science 2026-05-08 Ken M. Nakanishi

Transformer models using segment-based processing have been an effective architecture for simultaneous speech translation. However, such models create a context mismatch between training and inference environments, hindering potential…

Computation and Language · Computer Science 2023-07-06 Matthew Raffel , Drew Penney , Lizhong Chen

The quadratic complexity of the attention mechanism represents one of the biggest hurdles for processing long sequences using Transformers. Current methods, relying on sparse representations or stateful recurrence, sacrifice token-to-token…

Machine Learning · Computer Science 2025-06-06 Tobias Christian Nauen , Sebastian Palacio , Andreas Dengel

Softmax is widely used in neural networks for multiclass classification, gate structure and attention mechanisms. The statistical assumption that the input is normal distributed supports the gradient stability of Softmax. However, when used…

Computer Vision and Pattern Recognition · Computer Science 2021-08-17 Shulun Wang , Bin Liu , Feng Liu

Large language models have an exceptional capability to incorporate new information in a contextual manner. However, the full potential of such an approach is often restrained due to a limitation in the effective context length. One…

Computation and Language · Computer Science 2023-12-01 Szymon Tworkowski , Konrad Staniszewski , Mikołaj Pacek , Yuhuai Wu , Henryk Michalewski , Piotr Miłoś

The Transformer model is widely used in natural language processing for sentence representation. However, the previous Transformer-based models focus on function words that have limited meaning in most cases and could merely extract…

Computation and Language · Computer Science 2021-07-05 Yu Shi

Softmax attention is the cornerstone of modern large language models, but its memory scales linearly and compute quadratically with sequence length. Linear recurrent models, such as linear attention and state space models, have become…

Machine Learning · Computer Science 2026-05-28 Kevin Y. Li , Asher Trockman , Ananda Theertha Suresh , Ziteng Sun

Transformers have proven highly effective across modalities, but standard softmax attention scales quadratically with sequence length, limiting long context modeling. Linear attention mitigates this by approximating attention with kernel…

Machine Learning · Computer Science 2026-02-10 Ashkan Shahbazi , Chayne Thrash , Yikun Bai , Keaton Hamm , Navid NaderiAlizadeh , Soheil Kolouri

The Transformer-based model have made significant strides in semantic matching tasks by capturing connections between phrase pairs. However, to assess the relevance of sentence pairs, it is insufficient to just examine the general…

Computation and Language · Computer Science 2024-12-11 Bo Li , Di Liang , Zixin Zhang

Linear attention methods offer Transformers $O(N)$ complexity but typically underperform standard softmax attention. We identify two fundamental limitations affecting these approaches: the restriction to convex combinations that only…

Machine Learning · Computer Science 2026-02-06 Jiecheng Lu , Xu Han , Yan Sun , Viresh Pati , Yubin Kim , Siddhartha Somani , Shihao Yang

The attention mechanism is a pivotal element within the transformer architecture, making a substantial contribution to its exceptional performance. Within this attention mechanism, Softmax is an imperative component that enables the model…

Hardware Architecture · Computer Science 2024-09-05 Tianhua Xia , Sai Qian Zhang

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…

Machine Learning · Computer Science 2023-10-10 Yu Huang , Yuan Cheng , Yingbin Liang

Language Models (LMs) assign significant attention to the first token, even if it is not semantically important, which is known as attention sink. This phenomenon has been widely adopted in applications such as streaming/long context…

Computation and Language · Computer Science 2025-03-04 Xiangming Gu , Tianyu Pang , Chao Du , Qian Liu , Fengzhuo Zhang , Cunxiao Du , Ye Wang , Min Lin

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…

Recent work has shown that either (1) increasing the input length or (2) increasing model size can improve the performance of Transformer-based neural models. In this paper, we present a new model, called LongT5, with which we explore the…

Computation and Language · Computer Science 2022-05-04 Mandy Guo , Joshua Ainslie , David Uthus , Santiago Ontanon , Jianmo Ni , Yun-Hsuan Sung , Yinfei Yang

Transformers have demonstrated great success in numerous domains including natural language processing and bioinformatics. This success stems from the use of the attention mechanism by these models in order to represent and propagate…

Machine Learning · Computer Science 2025-02-10 Nathaniel Tomczak , Sanmukh Kuppannagari
‹ Prev 1 3 4 5 6 7 10 Next ›