English
Related papers

Related papers: ConSmax: Hardware-Friendly Alternative Softmax wit…

200 papers

Recent advancements in Transformer-based large language models (LLMs) have set new standards in natural language processing. However, the classical softmax attention incurs significant computational costs, leading to a $O(T)$ complexity for…

Computation and Language · Computer Science 2025-05-20 Zhihao He , Hang Yu , Zi Gong , Shizhan Liu , Jianguo Li , Weiyao Lin

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…

Machine Learning · Computer Science 2026-02-20 Gabriel Mongaras , Eric C. Larson

Large Language Models (LLMs) have become the central paradigm in artificial intelligence, yet the core computational primitive of attention has remained structurally unchanged. Local Linear Attention (LLA) is an attention mechanism derived…

Machine Learning · Computer Science 2026-05-29 Yifei Zuo , Dhruv Pai , Zhichen Zeng , Alec Dewulf , Shuming Hu , Zhaoran Wang

Recent breakthroughs in Large Reasoning Models (LRMs) have demonstrated that extensive Chain-of-Thought (CoT) generation is critical for enabling intricate cognitive behaviors, such as self-verification and backtracking, to solve complex…

Artificial Intelligence · Computer Science 2026-01-09 Minda Hu , Zexuan Qiu , Zenan Xu , Kun Li , Bo Zhou , Irwin King

Large language models (LLMs) have numerous real-life applications across various domains, such as natural language translation, sentiment analysis, language modeling, chatbots and conversational agents, creative writing, text…

Machine Learning · Computer Science 2025-02-18 Yeqi Gao , Zhao Song , Junze Yin

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…

Machine Learning · Computer Science 2026-02-20 Gabriel Mongaras , Trevor Dohm , Eric C. Larson

As the performance gains from accelerating quantized matrix multiplication plateau, the softmax operation becomes the critical bottleneck in Transformer inference. This bottleneck stems from two hardware limitations: (1) limited data…

Machine Learning · Computer Science 2026-02-03 Zisheng Ye , Xiaoyu He , Maoyuan Song , Guoliang Qiu , Chao Liao , Chen Wu , Yonggang Sun , Zhichun Li , Xiaoru Xie , Yuanyong Luo , Hu Liu , Pinyan Lu , Heng Liao

Extensive efforts have been made to boost the performance in the domain of language models by introducing various attention-based transformers. However, the inclusion of linear layers with large dimensions contributes to significant…

Machine Learning · Computer Science 2024-11-19 Priyansh Bhatnagar , Linfeng Wen , Mingu Kang

Recently, recurrent large language models (Recurrent LLMs) with linear computational complexity have re-emerged as efficient alternatives to self-attention-based LLMs (Self-Attention LLMs), which have quadratic complexity. However,…

Computation and Language · Computer Science 2025-07-28 Kai Liu , Zhan Su , Peijie Dong , Fengran Mo , Jianfei Gao , ShaoTing Zhang , Kai Chen

Large Language Models (LLMs) are powerful but often too slow and costly for real-world use during inference. Looped transformers save on parameters by reusing the same weights for multiple computational steps, or "loops." However, this…

Computation and Language · Computer Science 2025-10-30 Bohong Wu , Mengzhao Chen , Xiang Luo , Shen Yan , Qifan Yu , Fan Xia , Tianqi Zhang , Hongrui Zhan , Zheng Zhong , Xun Zhou , Siyuan Qiao , Xingyan Bin

The quadratic computational complexity of standard attention mechanisms presents a severe scalability bottleneck for LLMs in long-context scenarios. While hybrid attention mechanisms combining Full Attention (FA) and Sparse Attention (SA)…

Machine Learning · Computer Science 2026-04-10 Quantong Qiu , Zhiyi Hong , Yi Yang , Haitian Wang , Kebin Liu , Qingqing Dang , Juntao Li , Min Zhang

Softmax is the de facto standard in modern neural networks for language processing when it comes to normalizing logits. However, by producing a dense probability distribution each token in the vocabulary has a nonzero chance of being…

Computation and Language · Computer Science 2022-05-20 Maxat Tezekbayev , Vassilina Nikoulina , Matthias Gallé , Zhenisbek Assylbekov

Recently, numerous efficient Transformers have been proposed to reduce the quadratic computational complexity of standard Transformers caused by the Softmax attention. However, most of them simply swap Softmax with an efficient attention…

Computation and Language · Computer Science 2022-07-29 Zexiang Liu , Dong Li , Kaiyue Lu , Zhen Qin , Weixuan Sun , Jiacheng Xu , Yiran Zhong

Transformers and large language models (LLMs), powered by the attention mechanism, have transformed numerous AI applications, driving the need for specialized hardware accelerators. A major challenge in these accelerators is efficiently…

Machine Learning · Computer Science 2025-07-23 Vasileios Titopoulos , Kosmas Alexandridis , Giorgos Dimitrakopoulos

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

Transformers have demonstrated a competitive performance across a wide range of vision tasks, while it is very expensive to compute the global self-attention. Many methods limit the range of attention within a local window to reduce…

Computer Vision and Pattern Recognition · Computer Science 2022-11-01 Zhenzhe Hechen , Wei Huang , Yixin Zhao

Linear attentions have shown potential for improving Transformer efficiency, reducing attention's quadratic complexity to linear in sequence length. This holds exciting promise for (1) training linear Transformers from scratch, (2)…

Machine Learning · Computer Science 2024-02-08 Michael Zhang , Kush Bhatia , Hermann Kumbong , Christopher Ré

We describe ConvMemory, a small 3.6M-parameter learned reranker for conversational long-term memory retrieval, trained with cross-encoder teacher supervision over fused dense and lexical features. On the LongMemEval memory family,…

Computation and Language · Computer Science 2026-05-28 Taiheng Pan

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…

Machine Learning · Computer Science 2026-02-27 O. Duranthon , P. Marion , C. Boyer , B. Loureiro , L. Zdeborová

Softmax attention is a central component of transformer architectures, yet its nonlinear structure poses significant challenges for theoretical analysis. We develop a unified, measure-based framework for studying single-layer softmax…

Machine Learning · Computer Science 2025-12-15 Etienne Boursier , Claire Boyer