mlsanityData to 14 Oct 2026

Recirculation

arXiv 2608.17981 ↗First posted 18 Aug 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We describe an inference-time architectural enhancement for off-the-shelf foundation models that systematically reduces perplexity and boosts accuracy across generation and reasoning tasks. Our approach incurs essentially no additional latency during generation, though it requires serial processing in the prefill phase. Motivated by the fundamental limitation that state updates in feedforward transformers are bounded by model depth, our technique, recirculation, introduces a specific form of recurrence that allows the model to act as a dynamical system and track belief states. We distinguish this technique from chain-of-thought computation---which is better reserved for complex inferences rather than basic state tracking---as well as from popular depth-recurrence techniques (looping) and the costly training of recurrent transformers. We also propose and evaluate an adaptive variant of recirculation which requires only light tuning of hyperparameters while freezing the original model weights. Relative to the off-the-shelf baseline, adaptive recirculation achieves surprising gains on the Gemma3 family, including a consistent reduction in perplexity on a suite of datasets, a 21% increase in relative accuracy on GSM8k, and reliable improvements in accuracy on other downstream tasks. Our training-free approach succeeds by leveraging the model itself to inform architectural modifications, suggesting a route to architectural evolution guided by a trained network's properties rather than forced, arbitrary design choices.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 18 of its 29 references that are in the map. First posted on arXiv 18 Aug 2026.

Builds on

18 of 29 references.

References · 18

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  6. 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  10. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  11. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
  12. 2020On Layer Normalization in the Transformer Architecturecited by 922
6 more
  1. 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 799
  2. 2018Universal Transformerscited by 647
  3. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
  4. 2020Understanding the Difficulty of Training Transformerscited by 210
  5. 2022Recurrent Memory Transformercited by 203
  6. 2022Block-Recurrent Transformerscited by 110

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026RecurTrace: Adaptive Latent Reasoning with Loop-Time Memory
  2. 2026Scheduling Recursive Reasoning in Looped Transformers
  3. 2026Steering Recurrent Reasoners at Inference Time with Readout Feedback
  4. 2026ReTreVal: Reasoning Tree with Validation and Cross-Problem Memory for Large Language Models
  5. 2026Energy-guided Recursive Model
  6. 2026Input-Conditioned Search for Efficient Test-Time Scaling of Recursive Reasoners
  7. 2026Generative Recursive Reasoning
  8. 2026Beyond the Training Horizon: Mechanisms and Limits of Length Generalization in Looped Transformers