mlsanityData to 7 Oct 2026

DeepLoop: Depth Scaling for Looped Transformers

arXiv 2607.13491 ↗First posted 15 Jul 2026cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Looped Transformers scale sequential computation by applying a compact stack of physical blocks for multiple rounds, increasing unrolled depth without increasing stored parameters. This reuse changes the residual-scaling problem: in an untied Transformer, each residual branch receives and applies its own parameter update, whereas in a looped Transformer one shared update aggregates gradients from repeated visits and is read back by those same visits in the next linearized forward pass. We formalize this tied-depth effect through a first-order perturbation bound controlled by a visit-alignment coefficient kappaR. The bound recovers the DeepNorm exponent when visits decorrelate, but in the conservative aligned regime it requires the exponent to increase from 1/4 to 1/2 as loop count grows at fixed physical depth. The resulting method, DeepLoop, keeps the Post-LN DeepNorm architecture and sets α=(2N)1/2 and β=(8N)-1/2 for unrolled depth N. On GPT-style looped language models at GPT-2 small and GPT-2 medium scale, DeepLoop is neutral when no physical block is revisited and improves validation loss and downstream accuracy once recurrent depth is activated. These results show that stable recurrent depth requires residual scaling rules that account for parameter visits, not only nominal layer count.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 39 references that are in the map. First posted on arXiv 15 Jul 2026.

Builds on

27 of 39 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Scaling Laws for Neural Language Modelscited by 6,411
  3. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  4. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  5. 2020On Layer Normalization in the Transformer Architecturecited by 906
  6. 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
  7. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
  8. 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
  9. 2020ReZero is All You Need: Fast Convergence at Large Depthcited by 260
  10. 2023Think before you speak: Training Language Models With Pause Tokenscited by 254
  11. 2023Looped Transformers as Programmable Computerscited by 224
  12. 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
15 more
  1. 2020Understanding the Difficulty of Training Transformerscited by 210
  2. 2019Fixup Initialization: Residual Learning Without Normalizationcited by 194
  3. 2022DeepNet: Scaling Transformers to 1,000 Layerscited by 176
  4. 2025Hierarchical Reasoning Modelcited by 167
  5. 2021PonderNet: Learning to Pondercited by 156
  6. 2019Transformers without Tears: Improving the Normalization of Self-Attentioncited by 153
  7. 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
  8. 2023Looped Transformers are Better at Learning Learning Algorithmscited by 135
  9. 2021Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networkscited by 108
  10. 2023Tensor Programs VI: Feature Learning in Infinite-Depth Neural Networkscited by 94
  11. 2023Depthwise Hyperparameter Transfer in Residual Networks: Dynamics and Scaling Limitcited by 64
  12. 2024Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?cited by 60
  13. 2021Subformer: Exploring Weight Sharing for Parameter Efficiency in Generative Transformerscited by 42
  14. 2026Deep Delta Learningcited by 7
  15. 2026DiscoLoop: Looping Discrete Embeddings and Continuous Hidden States for Multi-hop Reasoningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.