mlsanityData to 14 Oct 2026

Beyond Depth Truncation: Controlled Evaluation of Depth Utilization in Recursive Language Models

arXiv 2609.19934 ↗First posted 17 Sep 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Depth-recurrent language models iteratively apply a small layer stack, decoupling per-token compute from distinct parameter count. To determine whether such a model genuinely utilizes its depth, both recurrence and layer-pruning literatures rely on a shared evaluation: truncating depth at inference time, plotting quality against retained depth fraction, and reading off the slope. While cheap and training-free, this metric suffers from an unexamined flaw: it extracts a single scalar from an intervention that alters multiple model properties simultaneously. Depth truncation concurrently reduces the number of block applications, decreases the volume of distinct computation performed, and pushes the readout head onto an out-of-distribution residual stream. The observed slope conflates all three factors, yet is conventionally interpreted as reflecting solely the second. We propose the Depth Control Protocol (DCP), a diagnostic suite that disentangles these three quantities. DCP comprises three positive controls that isolate each factor while varying the others, a negative control applying the identical interventions to dense transformers to ensure the effect is not an artifact of the measurement protocol, and a controlled training intervention to verify causality. The linchpin control, running the full budget of block applications while executing only a single distinct iteration, is strictly realizable only in depth-wise weight-sharing architectures, since in a dense network repeating a layer yields an entirely different model rather than the same model in an alternative configuration.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 27 references that are in the map. First posted on arXiv 17 Sep 2026.

Builds on

22 of 27 references.

References · 22

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2017On Calibration of Modern Neural Networkscited by 4,960
  3. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  4. 2016Deep Networks with Stochastic Depthcited by 979
  5. 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 797
  6. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  7. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
  8. 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
  9. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  10. 2022Confident Adaptive Language Modelingcited by 310
  11. 2024Quiet-STaR: Language Models Can Teach Themselves to Think Before Speakingcited by 301
  12. 2019Depth-Adaptive Transformercited by 236
10 more
  1. 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
  2. 2021PonderNet: Learning to Pondercited by 168
  3. 2026Think Shallow, Solve Deep: Controlling Recurrent Dynamics for Reliable Test-Time Depthcited by 9
  4. 2026DeepLoop: Depth Scaling for Looped Transformerscited by 7
  5. 2026Retrofitting Recurrent Depth into a Pretrained Language Model: Installation, Extrapolation, Transfer, and Retention at Two Parameter Budgetscited by 6
  6. 2025When Fewer Layers Break More Chains: Layer Pruning Harms Test-Time Scaling in LLMscited by 5
  7. 2026Allocating Recurrent Compute in Looped Language Modelscited by 4
  8. 2026SCORE: Replacing Layer Stacking with Contractive Recurrent Depthcited by 2
  9. 2026Understanding Performance Collapse in Layer-Pruned Large Language Models via Decision Representation Transitionscited by 2
  10. 2026The Ignition Is Real, and It Lives at the Readout: Latent composition, difficulty-clocked ignition, and the interface-constituted commit in a recurrent-depth reasonercited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.