English
Related papers

Related papers: Transformers in Uniform TC$^0$

200 papers

Transformers have emerged as a widely used neural network model for various natural language processing tasks. Previous research explored their relationship with constant-depth threshold circuits, making two assumptions: average-hard…

Computation and Language · Computer Science 2023-08-23 Lena Strobl

This paper analyzes three formal models of Transformer encoders that differ in the form of their self-attention mechanism: unique hard attention (UHAT); generalized unique hard attention (GUHAT), which generalizes UHAT; and averaging hard…

Computational Complexity · Computer Science 2022-04-15 Yiding Hao , Dana Angluin , Robert Frank

We contribute to the study of formal languages that can be recognized by transformer encoders. We focus on two self-attention mechanisms: (1) UHAT (Unique Hard Attention Transformers) and (2) AHAT (Average Hard Attention Transformers). UHAT…

Formal Languages and Automata Theory · Computer Science 2023-10-09 Pablo Barcelo , Alexander Kozachinskiy , Anthony Widjaja Lin , Vladimir Podolskii

Existing expressivity results for transformers typically rely on hardmax attention, high precision, and other architectural modifications that disconnect them from the models used in practice. We bridge this gap by analyzing standard…

Machine Learning · Computer Science 2026-05-19 Moritz Brösamle , Stephan Eckstein

Recent advances in transformer-based Large Language Models (LLMs) have demonstrated remarkable capabilities across various tasks. However, their quadratic computational complexity concerning sequence length remains a significant bottleneck…

Computation and Language · Computer Science 2025-06-05 Zichuan Fu , Wentao Song , Yejing Wang , Xian Wu , Yefeng Zheng , Yingying Zhang , Derong Xu , Xuetao Wei , Tong Xu , Xiangyu Zhao

Formal language theory has recently been successfully employed to unravel the power of transformer encoders. This setting is primarily applicable in Natural Language Processing (NLP), as a token embedding function (where a bounded number of…

Formal Languages and Automata Theory · Computer Science 2024-11-13 Pascal Bergsträßer , Chris Köcher , Anthony Widjaja Lin , Georg Zetzsche

Hard attention Chain-of-Thought (CoT) transformers are known to be Turing-complete. However, it is an open problem whether softmax attention Chain-of-Thought (CoT) transformers are Turing-complete. In this paper, we prove a stronger result…

Formal Languages and Automata Theory · Computer Science 2025-11-26 Hongjian Jiang , Michael Hahn , Georg Zetzsche , Anthony Widjaja Lin

Attention is a key part of the transformer architecture. It is a sequence-to-sequence mapping that transforms each sequence element into a weighted sum of values. The weights are typically obtained as the softmax of dot products between…

Transformers have become a standard neural network architecture for many NLP problems, motivating theoretical analysis of their power in terms of formal languages. Recent work has shown that transformers with hard attention are quite…

Computation and Language · Computer Science 2022-04-12 William Merrill , Ashish Sabharwal , Noah A. Smith

This note is a survey of various results on the capabilities of unique hard attention transformers encoders (UHATs) to recognize formal languages. We distinguish between masked vs. non-masked, finite vs. infinite image and general vs.…

Machine Learning · Computer Science 2025-06-05 Leonid Ryvkin

We study conditions under which transformers using soft attention can simulate hard attention, that is, effectively focus all attention on a subset of positions. First, we examine several subclasses of languages recognized by hard-attention…

Machine Learning · Computer Science 2025-06-27 Andy Yang , Lena Strobl , David Chiang , Dana Angluin

Transformer has become the dominant architecture for sequence modeling, yet a detailed understanding of how its structural parameters influence expressive power remains limited. In this work, we study the approximation properties of…

Machine Learning · Computer Science 2026-04-01 Penghao Yu , Haotian Jiang , Zeyu Bao , Ruoxi Yu , Qianxiao Li

Despite their empirical success, the internal mechanism by which transformer models align tokens during language processing remains poorly understood. This paper provides a mechanistic and theoretical explanation of token alignment in LLMs.…

Machine Learning · Computer Science 2025-12-19 Hadi Daneshmand

Looped Transformers (LT) have emerged as a powerful architecture by iterating their layers multiple times before decoding the final token. However, pairing them with full attention retains quadratic complexity, making them computationally…

Machine Learning · Computer Science 2026-05-26 Chunyuan Deng , Yizhe Zhang , Rui-Jie Zhu , Yuanyuan Xu , Jiarui Liu , T. S. Eugene Ng , Hanjie Chen

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…

Computation and Language · Computer Science 2025-11-11 Dhananjay Ram , Wei Xia , Stefano Soatto

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…

Computation and Language · Computer Science 2026-04-09 Wonsuk Lee

Transformers have driven remarkable breakthroughs in natural language processing and computer vision, yet their standard attention mechanism still imposes O(N^2) complexity, hindering scalability to longer sequences. We introduce…

Machine Learning · Computer Science 2026-01-06 Yoshihiro Yamada

Most of the Neural Machine Translation (NMT) models are based on the sequence-to-sequence (Seq2Seq) model with an encoder-decoder framework equipped with the attention mechanism. However, the conventional attention mechanism treats the…

Computation and Language · Computer Science 2018-08-28 Junyang Lin , Xu Sun , Xuancheng Ren , Muyu Li , Qi Su

While linear-complexity attention mechanisms offer a promising alternative to Softmax attention for overcoming the quadratic bottleneck, training such models from scratch remains prohibitively expensive. Inheriting weights from pretrained…

Computer Vision and Pattern Recognition · Computer Science 2026-05-29 Yining Li , Dongchen Han , Zeyu Liu , Hanyi Wang , Yulin Wang , Gao Huang

Understanding the expressive power of transformers has recently attracted attention, as it offers insights into their abilities and limitations. Many studies analyze unique hard attention transformers, where attention selects a single…

Machine Learning · Computer Science 2025-11-14 Selim Jerad , Anej Svete , Jiaoda Li , Ryan Cotterell
‹ Prev 1 2 3 10 Next ›