Born a Transformer -- Always a Transformer? On the Effect of Pretraining on Architectural Abilities
Not on the map. Why?
Abstract (arXiv)
Transformers have theoretical limitations in modeling certain sequence-to-sequence tasks, yet it remains largely unclear if these limitations play a role in large-scale pretrained LLMs, or whether LLMs might effectively overcome these constraints in practice due to the scale of both the models themselves and their pretraining data. We explore how these architectural constraints manifest after pretraining, by studying a family of textitretrieval and textitcopying tasks inspired by Liu et al. [2024a]. We use a recently proposed framework for studying length generalization [Huang et al., 2025] to provide guarantees for each of our settings. Empirically, we observe an textitinduction-versus-anti-induction asymmetry, where pretrained models are better at retrieving tokens to the right (induction) rather than the left (anti-induction) of a query token. This asymmetry disappears upon targeted fine-tuning if length-generalization is guaranteed by theory. Mechanistic analysis reveals that this asymmetry is connected to the differences in the strength of induction versus anti-induction circuits within pretrained transformers. We validate our findings through practical experiments on real-world tasks demonstrating reliability risks. Our results highlight that pretraining selectively enhances certain transformer capabilities, but does not overcome fundamental length-generalization limits.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 61 of its 69 references that are in the map. First posted on arXiv 27 May 2025.
Builds on
61 of 69 references.
References · 61
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
38 more
- 2022Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Taskscited by 1,057
- 2022In-context Learning and Induction Headscited by 930
- 2022PAL: Program-aided Language Modelscited by 635
- 2024A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Modelscited by 450
- 2019Are Transformers universal approximators of sequence-to-sequence functions?cited by 404
- 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 286
- 2023Mathematical Capabilities of ChatGPTcited by 263
- 2024Retrieval Head Mechanistically Explains Long-Context Factualitycited by 219
- 2022Neural Networks and the Chomsky Hierarchycited by 214
- 2022Predictability and Surprise in Large Generative Modelscited by 209
- 2024Repeat After Me: Transformers are Better than State Space Models at Copyingcited by 208
- 2022Exploring Length Generalization in Large Language Modelscited by 204
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
- 2023What Algorithms can Transformers Learn? A Study in Length Generalizationcited by 198
- 2022The Parallelism Tradeoff: Limitations of Log-Precision Transformerscited by 191
- 2024The Illusion of State in State-Space Modelscited by 181
- 2023MathCoder: Seamless Code Integration in LLMs for Enhanced Mathematical Reasoningcited by 155
- 2024Evaluation of Retrieval-Augmented Generation: A Surveycited by 146
- 2023Representational Strengths and Limitations of Transformerscited by 132
- 2019On the Turing Completeness of Modern Neural Network Architecturescited by 129
- 2023What Formal Languages Can Transformers Express? A Surveycited by 120
- 2024Unlocking State-Tracking in Linear RNNs Through Negative Eigenvaluescited by 97
- 2024What needs to go right for an induction head? A mechanistic study of in-context learning circuits and their formationcited by 86
- 2023Exposing Attention Glitches with Flip-Flop Language Modelingcited by 74
- 2024Why are Sensitive Functions Hard for Transformers?cited by 74
- 2023Generalization on the Unseen, Logic Reasoning and Degree Curriculumcited by 73
- 2021Chess as a Testbed for Language Model State Trackingcited by 69
- 2025DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Productscited by 69
- 2023Length Generalization in Arithmetic Transformerscited by 64
- 2024Induction Heads as an Essential Mechanism for Pattern Matching in In-context Learningcited by 46
- 2024Unveiling Induction Heads: Provable Training Dynamics and Feature Learning in Transformerscited by 46
- 2024From Tokens to Words: On the Inner Lexicon of LLMscited by 46
- 2024The Expressive Capacity of State Space Models: A Formal Language Perspectivecited by 45
- 2023Entity Tracking in Language Modelscited by 44
- 2024A Formal Framework for Understanding Length Generalization in Transformerscited by 44
- 2024Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformerscited by 39
- 2024Answer, Assemble, Ace: Understanding How LMs Answer Multiple Choice Questionscited by 35
- 2023Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priorscited by 33
50 most cited of 61 All 61 (JSON)
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2025Quantitative Bounds for Length Generalization in Transformerscited by 8
- 2025The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architecturescited by 3
- 2025Induction Signatures Are Not Enough: A Matched-Compute Study of Load-Bearing Structure in In-Context Learningcited by 2
- 2026On the Ability of Transformers to Verify Planscited by 1
- 2026Barriers to Universal Reasoning With Transformers (And How to Overcome Them)cited by 1
- 2026Length Generalization for Transformers via Compressioncited by 0
- 2026Length Generalization for Transformers via Compression8 Sep 2026
- 2026Barriers to Universal Reasoning With Transformers (And How to Overcome Them)28 Apr 2026
- 2026On the Ability of Transformers to Verify Plans20 Mar 2026
- 2025Quantitative Bounds for Length Generalization in Transformers30 Oct 2025
- 2025The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures6 Oct 2025
- 2025Induction Signatures Are Not Enough: A Matched-Compute Study of Load-Bearing Structure in In-Context Learning26 Sep 2025