Beyond What Seems Necessary: Hidden Gains from Scaling Training-Time Reasoning Length under Outcome Supervision
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Training LLMs to think and reason for longer has become a key ingredient in building state-of-the-art models that can solve complex problems previously out of reach. Recent efforts pursue this in different ways, such as RL fine-tuning to elicit long CoT or scaling latent reasoning through architectural recurrence. This makes reasoning length an important scaling knob. In this work, we identify a novel phenomenon (both theoretically and experimentally): under outcome-only supervision, out-of-distribution (OOD) performance can continue improving as training-time reasoning length (e.g., the token budget in RL, or the loop count in looped Transformers) increases, even after in-distribution (ID) performance has saturated. This suggests that robustness may require a larger budget than ID validation alone would indicate. We provide theoretical explanations via two mechanisms: (i) self-iteration can induce a stronger inductive bias in the hypothesis class, reshaping ID-optimal solutions in ways that improve OOD generalization; and (ii) when shortcut solutions that work for ID samples but not for OOD samples persist in the hypothesis class, regularization can reduce the learned solution's reliance on these shortcuts as the number of self-iterations increases. We complement the theory with empirical evidence from two realizations of scaling training-time reasoning length: increasing the number of loops in looped Transformers on a synthetic task, and increasing token budgets during RL fine-tuning of LLMs on mathematical reasoning.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 30 of its 45 references that are in the map. First posted on arXiv 31 Jan 2026.
Builds on
30 of 45 references.
Closest ancestors · 4
Same direction, newest first
- 2025e3: Learning to Explore Enables Extrapolation of Test-Time Compute for LLMs10 Jun
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformers24 Feb
- 2025s1: Simple test-time scaling31 Jan
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
Other references · 26
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
- 2023Let's Verify Step by Stepcited by 3,598
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
- 2015Trust Region Policy Optimizationcited by 2,503
- 2020Shortcut Learning in Deep Neural Networkscited by 1,928
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
- 2018Universal Transformerscited by 613
14 more
- 2024Chain of Thought Empowers Transformers to Solve Inherently Serial Problemscited by 256
- 2023Looped Transformers as Programmable Computerscited by 224
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 135
- 2024Looped Transformers for Length Generalizationcited by 91
- 2025The Art of Scaling Reinforcement Learning Compute for LLMscited by 91
- 2024Transformers, parallel computation, and logarithmic depthcited by 75
- 2024Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?cited by 60
- 2025OMEGA: Can LLMs Reason Outside the Box in Math? Evaluating Exploratory, Compositional, and Transformative Generalizationcited by 48
- 2025Transformers Learn to Implement Multi-step Gradient Descent with Chain of Thoughtcited by 32
- 2024Simulation of Graph Algorithms with Looped Transformerscited by 29
- 2024On Expressive Power of Looped Transformers: Theoretical Analysis and Enhancement via Timestep Encodingcited by 28
- 2025Do We Need to Verify Step by Step? Rethinking Process Supervision from a Theoretical Perspectivecited by 16
- 2024On the Role of Depth and Looping for In-Context Learning with Task Diversitycited by 11
- 2025Escaping the Verifier: Learning to Reason via Demonstrationscited by 7
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Inverse Scaling in Test-Time Compute
- 2025Longer Context, Deeper Thinking: Uncovering the Role of Long-Context Ability in Reasoning
- 2025Towards Thinking-Optimal Scaling of Test-Time Compute for LLM Reasoning
- 2025Why Does Reasoning Length Converge? Unveiling the Underfitting-Overfitting Trade-off in Chain-of-Thought
- 2025Demystifying Long Chain-of-Thought Reasoning in LLMs
- 2026APR: Penalizing Structural Redundancy in Large Reasoning Models via Anchor-based Process Rewards
- 2026Batched Contextual Reinforcement: A Task-Scaling Law for Efficient Reasoning
- 2026When More Thinking Hurts: Overthinking in LLM Test-Time Compute Scaling