Impact of recurrent depth on transformer performance
Determine how recurrent depth affects the performance of transformer-based language models by rigorously characterizing the relationship between the number of recurrent iterations and model performance across tasks and conditions.
References
Many works study the impact of depth for transformers both theoretically and practically \citep{levine2020depth,merrill2022saturated,mcleish2025gemstones,zuo2025falcon,merrill2025little,csordas2025language}, it is still an open question how recurrent depth impacts the performance of transformers.
Applying such interventions during generation would require evaluating their effects on subsequent states, answer quality, and computation cost. The present measurements identify recoverable losses within individual updates; how these losses accumulate over a recurrent trajectory remains to be established.
We have not established whether training with sampled depth from initialization avoids the peak performance penalty.
Both checkpoints evaluated here are substantially undertrained relative to modern standards; hence, the conclusion that distinct iterations contribute near zero may reflect the training phase rather than architectural limits.
We have yet to study an intermediate approach in which each stack is recirculated exactly $r$ times.
Each data point in Figure~\ref{fig:compute} is a model that is trained separately, so these results do not establish whether an already trained model benefits from additional inference passes.
Future work can further study how such latent trajectories develop across reasoning depth and whether different stages of computation benefit from different prediction horizons or levels of abstraction.