Do Depth-Grown Models Overcome the Curse of Depth? An In-Depth Analysis
Not on the map. Why?
Abstract (arXiv)
Gradually growing the depth of Transformers during training can not only reduce training cost but also lead to improved reasoning performance, as shown by MIDAS (Saunshi et al., 2024). Thus far, however, a mechanistic understanding of these gains has been missing. In this work, we establish a connection to recent work showing that layers in the second half of non-grown, pre-layernorm Transformers contribute much less to the final output distribution than those in the first half - also known as the Curse of Depth (Sun et al., 2025, Csord'as et al., 2025). Using depth-wise analyses, we demonstrate that growth via gradual middle stacking yields more effective utilization of model depth, alters the residual stream structure, and facilitates the formation of permutable computational blocks. In addition, we propose a lightweight modification of MIDAS that yields further improvements in downstream reasoning benchmarks. Overall, this work highlights how the gradual growth of model depth can lead to the formation of distinct computational circuits and overcome the limited depth utilization seen in standard non-grown models.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 41 of its 54 references that are in the map. First posted on arXiv 9 Dec 2025.
Builds on
41 of 54 references.
References · 41
- 2017Attention Is All You Needcited by 60,361
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
29 more
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2021A Diverse Corpus for Evaluating and Developing English Math Word Problem Solverscited by 318
- 2023MQuAKE: Assessing Knowledge Editing in Language Models via Multi-Hop Questionscited by 300
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 240
- 2023SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scalingcited by 172
- 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 170
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2023OpenWebMath: An Open Dataset of High-Quality Mathematical Web Textcited by 155
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
- 2024The Remarkable Robustness of LLMs: Stages of Inference?cited by 146
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
- 2023MatFormer: Nested Transformer for Elastic Inferencecited by 85
- 2023Learning to Grow Pretrained Models for Efficient Transformer Trainingcited by 83
- 2025Don't be lazy: CompleteP enables compute-efficient deep transformerscited by 78
- 2025The Curse of Depth in Large Language Modelscited by 62
- 2024MoEUT: Mixture-of-Experts Universal Transformerscited by 59
- 2025Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinkingcited by 57
- 2024Transformer Layers as Painterscited by 54
- 2025Do Language Models Use Their Depth Efficiently?cited by 50
- 2025MesaNet: Sequence Modeling by Locally Optimal Test-Time Trainingcited by 47
- 20251000 Layer Networks for Self-Supervised RL: Scaling Depth Can Enable New Goal-Reaching Capabilitiescited by 45
- 2024Stacking Your Transformers: A Closer Look at Model Growth for Efficient LLM Pre-Trainingcited by 43
- 2024Mix-LN: Unleashing the Power of Deeper Layers by Combining Pre-LN and Post-LNcited by 37
- 2024Hype, Sustainability, and the Price of the Bigger-is-Better Paradigm in AIcited by 35
- 2023Masked Structural Growth for 2x Faster Language Model Pre-trainingcited by 33
- 2024On the Inductive Bias of Stacking Towards Improving Reasoningcited by 19
- 2023Composable Function-preserving Expansions for Transformer Architecturescited by 13
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026From Growing to Looping: A Unified View of Iterative Computation in LLMscited by 7
- 2026When Does Sparsity Mitigate the Curse of Depth in LLMscited by 4
- 2026From Words to Amino Acids: Does the Curse of Depth Persist?cited by 2
- 2026Layer Collapse in Diffusion Language Modelscited by 2
- 2026Gradient Smoothing: Coupling Layer-wise Updates for Improved Optimizationcited by 0
- 2026Growing to See: Efficient Pretraining of Self-Supervised Vision Transformerscited by 0
- 2026Growing to See: Efficient Pretraining of Self-Supervised Vision Transformers12 Oct 2026
- 2026Gradient Smoothing: Coupling Layer-wise Updates for Improved Optimization29 Jun 2026
- 2026Layer Collapse in Diffusion Language Models7 May 2026
- 2026When Does Sparsity Mitigate the Curse of Depth in LLMs16 Mar 2026
- 2026From Words to Amino Acids: Does the Curse of Depth Persist?25 Feb 2026
- 2026From Growing to Looping: A Unified View of Iterative Computation in LLMs18 Feb 2026