From Growing to Looping: A Unified View of Iterative Computation in LLMs
Not on the map. Why?
Abstract (arXiv)
Looping, reusing a block of layers across depth, and depth growing, training shallow-to-deep models by duplicating middle layers, have both been linked to stronger reasoning, but their relationship remains unclear. We provide a mechanistic unification: looped and depth-grown models exhibit convergent depth-wise signatures, including increased reliance on late layers and recurring patterns aligned with the looped or grown block. These shared signatures support the view that their gains stem from a common form of iterative computation. Building on this connection, we show that the two techniques are adaptable and composable: applying inference-time looping to the middle blocks of a depth-grown model improves accuracy on some reasoning primitives by up to 2×, despite the model never being trained to loop. Both approaches also adapt better than the baseline when given more in-context examples or additional supervised fine-tuning data. Additionally, depth-grown models achieve the largest reasoning gains when using higher-quality, math-heavy cooldown mixtures, which can be further boosted by adapting a middle block to loop. Overall, our results position depth growth and looping as complementary, practical methods for inducing and scaling iterative computation to improve reasoning.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 37 of its 45 references that are in the map. First posted on arXiv 18 Feb 2026.
Builds on
37 of 45 references.
References · 37
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
- 2018Universal Transformerscited by 613
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 579
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
25 more
- 2021A Diverse Corpus for Evaluating and Developing English Math Word Problem Solverscited by 314
- 2025SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Modelcited by 307
- 2025Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Modelscited by 291
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
- 2023SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scalingcited by 172
- 2025Hierarchical Reasoning Modelcited by 167
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 135
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2024Looped Transformers for Length Generalizationcited by 91
- 2021Lessons on Parameter Sharing across Layers in Transformerscited by 85
- 2023Learning to Grow Pretrained Models for Efficient Transformer Trainingcited by 81
- 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 72
- 2025The Curse of Depth in Large Language Modelscited by 58
- 2024MoEUT: Mixture-of-Experts Universal Transformerscited by 55
- 2024Does your data spark joy? Performance gains from domain upsampling at the end of trainingcited by 51
- 2025Do Language Models Use Their Depth Efficiently?cited by 48
- 2024Stacking Your Transformers: A Closer Look at Model Growth for Efficient LLM Pre-Trainingcited by 42
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrencecited by 41
- 2018Recurrent Stacking of Layers for Compact Neural Machine Translation Modelscited by 38
- 2025Nemotron-CC-Math: A 133 Billion-Token-Scale High Quality Math Pretraining Datasetcited by 34
- 2023Masked Structural Growth for 2x Faster Language Model Pre-trainingcited by 32
- 2025Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughtscited by 23
- 2024On the Inductive Bias of Stacking Towards Improving Reasoningcited by 18
- 2025Do Depth-Grown Models Overcome the Curse of Depth? An In-Depth Analysiscited by 5
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformerscited by 21
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformerscited by 12
- 2026From Words to Amino Acids: Does the Curse of Depth Persist?cited by 2
- 2026Improving Test-Time Scaling with Adaptive Looped Transformerscited by 0
- 2026Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes Itcited by 0
- 2026Looped Actor: Depth-Recurrent Reasoning Models for Reinforcement Learningcited by 0
- 2026Looped Actor: Depth-Recurrent Reasoning Models for Reinforcement Learning29 Sep 2026
- 2026Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes It29 Sep 2026
- 2026Improving Test-Time Scaling with Adaptive Looped Transformers28 Sep 2026
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers1 Sep 2026
- 2026Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers16 Jun 2026
- 2026From Words to Amino Acids: Does the Curse of Depth Persist?25 Feb 2026