Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes It
Not on the map. Why?
Abstract (arXiv)
Pretrained transformers use little of their depth to follow references in context. Thirteen base models reliably follow only 1.4-3.6 lines, and extra pretrained loops add little. A task-trained rank-8 LoRA at one early layer extends this computation with all model weights frozen. Qwen3-8B improves from 15.5% to 99% exact accuracy on 24-line chains; a longer-trained LoRA reaches 50 lines. Ouro-1.4B reaches 60 lines after four loops and at least 160 after eight. The LoRA starts a relay: program lines pass on their chain identity through a short range of middle layers. Frozen heads read progressively further up the chain, and removing parent-line attention stops the relay. A frozen-model measurement locates the last useful intervention layer within tolerance in three of four held-out models. Task-specific LoRAs also improve MuSiQue. Default answers therefore understate the computation accessible through a tiny edit. Code and an interactive demo are available at https://lunamos.github.io/stop-thinking-too-early/
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 60 of its 63 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
60 of 63 references.
References · 60
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2025Qwen3 Technical Reportcited by 8,820
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2025Gemma 3 Technical Reportcited by 1,824
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
- 2023Representation Engineering: A Top-Down Approach to AI Transparencycited by 1,336
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
- 2023Steering Llama 2 via Contrastive Activation Additioncited by 1,085
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,075
- 2022In-context Learning and Induction Headscited by 964
38 more
- 2023Steering Language Models With Activation Engineeringcited by 922
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 916
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 797
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
- 2018Universal Transformerscited by 647
- 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 528
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
- 2022Transformers Learn Shortcuts to Automatacited by 268
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 240
- 2023Looped Transformers as Programmable Computerscited by 237
- 2024ReFT: Representation Finetuning for Language Modelscited by 197
- 2024Let's Think Dot by Dot: Hidden Computation in Transformer Language Modelscited by 191
- 2024Do Large Language Models Latently Perform Multi-Hop Reasoning?cited by 169
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 165
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
- 2024Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Trackingcited by 149
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
- 2021Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networkscited by 117
- 2023How do Language Models Bind Entities in Context?cited by 108
- 2022Unveiling Transformers with LEGO: a synthetic reasoning taskcited by 106
- 2024Looped Transformers for Length Generalizationcited by 99
- 2024Transformers, parallel computation, and logarithmic depthcited by 79
- 2024Hopping Too Late: Exploring the Limitations of Large Language Models on Multi-Hop Queriescited by 78
- 2024LoFiT: Localized Fine-tuning on LLM Representationscited by 57
- 2025Do Language Models Use Their Depth Efficiently?cited by 50
- 2024A Mechanistic Analysis of a Transformer Trained on a Symbolic Multi-Step Reasoning Taskcited by 49
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrencecited by 47
- 2023Entity Tracking in Language Modelscited by 44
- 2025Language Models use Lookbacks to Track Beliefscited by 39
- 2026Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformerscited by 37
- 2022End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinkingcited by 33
- 2026A Mechanistic Analysis of Looped Reasoning Language Modelscited by 33
- 2025Latent Chain-of-Thought? Decoding the Depth-Recurrent Transformercited by 27
- 2025Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughtscited by 24
- 2025Back Attention: Understanding and Enhancing Multi-Hop Reasoning in Large Language Modelscited by 23
- 2025How Do Transformers Learn Variable Binding in Symbolic Programs?cited by 21
- 2025How Do LLMs Perform Two-Hop Reasoning in Context?cited by 20
- 2024Transformers Struggle to Learn to Searchcited by 19
50 most cited of 60 All 60 (JSON)
Built on by
Not cited yet.