English
Related papers

Related papers: Transformers Are Born Biased: Structural Inductive…

200 papers

"Induction heads" are attention heads that implement a simple algorithm to complete token sequences like [A][B] ... [A] -> [B]. In this work, we present preliminary and indirect evidence for a hypothesis that induction heads might…

Strong inductive biases enable learning from little data and help generalization outside of the training distribution. Popular neural architectures such as Transformers lack strong structural inductive biases for seq2seq NLP tasks on their…

Computation and Language · Computer Science 2024-07-11 Matthias Lindemann , Alexander Koller , Ivan Titov

Despite their central role in the success of foundational models and large-scale language modeling, the theoretical foundations governing the operation of Transformers remain only partially understood. Contemporary research has largely…

Machine Learning · Computer Science 2025-06-02 Sagar Ghosh , Kushal Bose , Swagatam Das

This article introduces the concept of the algorithmic unconscious to designate the set of structural determinations that operate within large language models (LLMs) without being accessible either to the model's own reflexivity or to that…

Computers and Society · Computer Science 2026-02-24 Philippe Boisnard

Word embeddings are the interface between the world of discrete units of text processing and the continuous, differentiable world of neural networks. In this work, we examine various random and pretrained initialization methods for…

Computation and Language · Computer Science 2017-11-28 Tom Kocmi , Ondřej Bojar

Next-token prediction serves as the dominant component in current neural language models. During the training phase, the model employs teacher forcing, which predicts tokens based on all preceding ground truth tokens. However, this approach…

Computation and Language · Computer Science 2024-10-28 Yongjing Yin , Junran Ding , Kai Song , Yue Zhang

Transformers predict over a representation of a sequence. The same data can be written as bytes, characters, or subword tokens, and these representations may be lossless. Yet, under a fixed context window, they need not expose the same…

Machine Learning · Computer Science 2026-05-14 Amirmehdi Jafari Fesharaki , Mohammadamin Rami , Aslan Tchamkerten

Training vision transformer networks on small datasets poses challenges. In contrast, convolutional neural networks (CNNs) can achieve state-of-the-art performance by leveraging their architectural inductive bias. In this paper, we…

Computer Vision and Pattern Recognition · Computer Science 2024-01-24 Jianqiao Zheng , Xueqian Li , Simon Lucey

Transformers often appear to perform Bayesian reasoning in context, but verifying this rigorously has been impossible: natural data lack analytic posteriors, and large models conflate reasoning with memorization. We address this by…

Machine Learning · Computer Science 2026-05-19 Naman Agarwal , Siddhartha R. Dalal , Vishal Misra

Predicting a label correctly does not necessarily require representing the operation that produces it. Transformer representations are known to carry label-level information, but whether they encode semantic operations producing those…

Computation and Language · Computer Science 2026-05-26 Nura Aljaafari , Marco Valentino , André Freitas

Machine translation has seen rapid progress with the advent of Transformer-based models. These models have no explicit linguistic structure built into them, yet they may still implicitly learn structured relationships by attending to…

Fingerprinting Large Language Models (LLMs)is essential for provenance verification and model attribution. Existing fingerprinting methods are primarily evaluated after fine-tuning, where models have already acquired stable signatures from…

Cryptography and Security · Computer Science 2026-04-15 Yao Tong , Haonan Wang , Siquan Li , Kenji Kawaguchi , Tianyang Hu

Recurrent neural networks have a strong inductive bias towards learning temporally compressed representations, as the entire history of a sequence is represented by a single vector. By contrast, Transformers have little inductive bias…

Machine Learning · Computer Science 2022-10-26 Aniket Didolkar , Kshitij Gupta , Anirudh Goyal , Nitesh B. Gundavarapu , Alex Lamb , Nan Rosemary Ke , Yoshua Bengio

We propose a causal interpretation of self-attention in the Transformer neural network architecture. We interpret self-attention as a mechanism that estimates a structural equation model for a given input sequence of symbols (tokens). The…

Artificial Intelligence · Computer Science 2023-11-01 Raanan Y. Rohekar , Yaniv Gurwicz , Shami Nisimov

Recent advancements in LLMs have revolutionized motion generation models in embodied applications. While LLM-type auto-regressive motion generation models benefit from training scalability, there remains a discrepancy between their token…

Artificial Intelligence · Computer Science 2025-03-27 Ran Tian , Kratarth Goel

Automatic sleep staging commonly adopts Transformers under the assumption that they learn complex long-range dependencies. We challenge this view by revealing a neglected property of sleep sequences: strong local temporal continuity. We…

Machine Learning · Computer Science 2026-05-12 Guisong Liu , Xin Gao , Martin Dresler , Jiansong Zhang , Pengfei Wei

Finding the right initialisation for neural networks is crucial to ensure smooth training and good performance. In transformers, the wrong initialisation can lead to one of two failure modes of self-attention layers: rank collapse, where…

Machine Learning · Statistics 2026-05-22 Alessio Giorlandino , Sebastian Goldt

The statistical properties of deep neural networks (DNNs) at initialization play an important role to comprehend their trainability and the intrinsic architectural biases they possess before data exposure Well established mean field (MF)…

Machine Learning · Computer Science 2026-03-03 Alberto Bassi , Marco Baity-Jesi , Aurelien Lucchi , Carlo Albert , Emanuele Francazi

Large language models (LLMs) often concentrate their attention on a few specific tokens referred to as attention sinks. Common examples include the first token, a prompt-independent sink, and punctuation tokens, which are prompt-dependent.…

Computation and Language · Computer Science 2025-09-23 Stephen Zhang , Mustafa Khan , Vardan Papyan

Grokking, a delayed generalization in neural networks after perfect training performance, has been observed in Transformers and MLPs, but the components driving it remain underexplored. We show that embeddings are central to grokking:…

Machine Learning · Computer Science 2025-05-22 H. V. AlquBoj , Hilal AlQuabeh , Velibor Bojkovic , Munachiso Nwadike , Kentaro Inui