English
Related papers

Related papers: Masked Hard-Attention Transformers Recognize Exact…

200 papers

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

Transformer-based language models (LMs) have achieved widespread empirical success, but their theoretical expressive power remains only partially understood. In this work, we analyze a restricted idealization of fixed-precision transformers…

Computation and Language · Computer Science 2025-12-04 Jiaoda Li , Ryan Cotterell

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

Transformers are extremely successful machine learning models whose mathematical properties remain poorly understood. Here, we rigorously characterize the behavior of transformers with hardmax self-attention and normalization sublayers as…

Computation and Language · Computer Science 2026-05-14 Albert Alcalde , Giovanni Fantuzzi , Enrique Zuazua

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

Large Language Model (LLM) based text-to-speech (TTS) systems have demonstrated remarkable capabilities in handling large speech datasets and generating natural speech for new speakers. However, LLM-based TTS models are not robust as the…

Attention, specifically scaled dot-product attention, has proven effective for natural language, but it does not have a mechanism for handling hierarchical patterns of arbitrary nesting depth, which limits its ability to recognize certain…

Computation and Language · Computer Science 2024-01-25 Brian DuSell , David Chiang

We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…

Formal Languages and Automata Theory · Computer Science 2026-05-18 Pascal Bergsträßer , Ryan Cotterell , Anthony W. Lin

Masked diffusion language models (MDLMs) have emerged as a promising alternative to dominant autoregressive approaches. Although they achieve competitive performance on several tasks, a substantial gap remains in open-ended text generation.…

Computation and Language · Computer Science 2026-02-02 Mengyu Ye , Ryosuke Takahashi , Keito Kudo , Jun Suzuki

Causal transformer language models (LMs), such as GPT-3, typically require some form of positional encoding, such as positional embeddings. However, we show that LMs without any explicit positional encoding are still competitive with…

Computation and Language · Computer Science 2022-12-07 Adi Haviv , Ori Ram , Ofir Press , Peter Izsak , Omer Levy

Chain of thought is a natural inference-time method for increasing the computational power of transformer-based large language models (LLMs), but comes at the cost of sequential decoding. Are there more efficient alternatives to expand a…

Machine Learning · Computer Science 2025-11-07 William Merrill , Ashish Sabharwal

The transformer is the most popular neural architecture for language modeling. The cornerstone of the transformer is its global attention mechanism, which lets the model aggregate information from all preceding tokens before generating the…

Computation and Language · Computer Science 2026-05-20 Jiaoda Li , Ryan Cotterell

While the Self-Attention mechanism in the Transformer model has proven to be effective in many domains, we observe that it is less effective in more diverse settings (e.g. multimodality) due to the varying granularity of each token and the…

Computer Vision and Pattern Recognition · Computer Science 2024-06-06 Wayner Barrios , SouYoung Jin

Transformers serve as the foundation of most modern large language models. To mitigate the quadratic complexity of standard full attention, various efficient attention mechanisms, such as linear and hybrid attention, have been developed. A…

Machine Learning · Computer Science 2026-02-03 Xiaowei Ye , Xiaoyu He , Chao Liao , Chen Wu , Pinyan Lu

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

This paper reveals that large language models (LLMs), despite being trained solely on textual data, are surprisingly strong encoders for purely visual tasks in the absence of language. Even more intriguingly, this can be achieved by a…

Computer Vision and Pattern Recognition · Computer Science 2024-05-07 Ziqi Pang , Ziyang Xie , Yunze Man , Yu-Xiong Wang

The state of the art in learning meaningful semantic representations of words is the Transformer model and its attention mechanisms. Simply put, the attention mechanisms learn to attend to specific parts of the input dispensing recurrence…

Computation and Language · Computer Science 2020-12-24 Dongsheng Wang , Casper Hansen , Lucas Chaves Lima , Christian Hansen , Maria Maistro , Jakob Grue Simonsen , Christina Lioma

Transformer-based Large Language Models (LLMs) are the state-of-the-art for natural language tasks. Recent work has attempted to decode, by reverse engineering the role of linear layers, the internal mechanisms by which LLMs arrive at their…

Computation and Language · Computer Science 2023-10-26 Mansi Sakarvadia , Arham Khan , Aswathy Ajith , Daniel Grzenda , Nathaniel Hudson , André Bauer , Kyle Chard , Ian Foster

Large language models (LLMs) are powerful models that can learn concepts at the inference stage via in-context learning (ICL). While theoretical studies, e.g., \cite{zhang2023trained}, attempt to explain the mechanism of ICL, they assume…

Machine Learning · Computer Science 2024-06-19 Yue Xing , Xiaofeng Lin , Chenheng Xu , Namjoon Suh , Qifan Song , Guang Cheng

Natural languages are believed to be (mildly) context-sensitive. Despite underpinning remarkably capable large language models, transformers are unable to model many context-free language tasks. In an attempt to address this limitation in…

Computation and Language · Computer Science 2024-05-15 Jiaoda Li , Jennifer C. White , Mrinmaya Sachan , Ryan Cotterell
‹ Prev 1 2 3 10 Next ›