Monitoring latent reasoning in looped language models
On the map: LLM reasoning → Test-time compute and efficient thinking also fits: Reasoning benchmarks and evaluation
Abstract (arXiv)
Looped language models (LMs) reuse one block of layers several times per token generation, promising more latent computation at no additional storage cost. Despite their rising popularity, the analysis of looped LMs is still in its infancy: little is known about whether the iterative transformations actually improve their capabilities, or whether these models remain stable under prompt perturbation. We construct an inspection protocol rooted in Mechanistic Interpretability comprising five diverse lenses. We apply it to examine eight looped LMs from four families. Models differ in many aspects but the key one is whether the prompt is transmitted only within the looped state (carry loops: Ouro, LoopUS) or re-supplied at every iteration (re-read loops: Parcae, and Rec-OLMo & Huginn from the Raven family). The results of our study provide valuable insights concerning safety and efficient use of looped language models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 40 of its 63 references that are in the map. First posted on arXiv 13 Oct 2026.
Builds on
40 of 63 references.
Closest ancestors · 7
Same direction, newest first
- 2026Monitoring the Internal Monologue: Probe Trajectories Reveal Reasoning Dynamics18 May
- 2026LoopUS: Recasting Pretrained LLMs into Looped Latent Refinement Models10 May
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrence10 Nov
- 2025Scaling Latent Reasoning via Looped Language Models29 Oct
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformers24 Feb
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach7 Feb
- 2025s1: Simple test-time scaling31 Jan
Other references · 33
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2024HarmBench: A Standardized Evaluation Framework for Automated Red Teaming and Robust Refusalcited by 1,429
- 2023Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Promptingcited by 1,122
21 more
- 2024Refusal in Language Models Is Mediated by a Single Directioncited by 1,032
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 1,003
- 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 886
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
- 2024WildChat: 1M ChatGPT Interaction Logs in the Wildcited by 629
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
- 2019Deep Equilibrium Modelscited by 615
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
- 2019Neural Text Generation with Unlikelihood Trainingcited by 503
- 2024Latent Adversarial Training Improves Robustness to Persistent Harmful Behaviors in LLMscited by 173
- 2021PonderNet: Learning to Pondercited by 168
- 2021Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networkscited by 117
- 2024Soft Prompt Threats: Attacking Safety Alignment and Unlearning in Open-Source LLMs through the Embedding Spacecited by 91
- 2023CValues: Measuring the Values of Chinese Large Language Models from Safety to Responsibilitycited by 85
- 2026Parcae: Scaling Laws For Stable Looped Language Modelscited by 55
- 2025Latent Chain-of-Thought? Decoding the Depth-Recurrent Transformercited by 27
- 2026Adaptive Depth in Looped Transformers: Diagnosing Learned Halting Gates and Trajectory Readoutscited by 12
- 2026Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?cited by 6
- 2026Investigating Single-Block Recurrence in Vision Transformers for Image Recognitioncited by 4
- 2026Same path, different: a mechanistic comparison of looped and stacked transformer encoders on 12-lead ECGcited by 1
- 2026Prediction Dynamics in Depth-Recurrent Language Modelscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026A Mechanistic Analysis of Looped Reasoning Language Models
- 2026LoopCD: Loop-wise Contrastive Decoding for Improving Reasoning in Looped Language Models
- 2026Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models
- 2026Closing the Loop: Practical Training Recipes for Looped Language Models
- 2026Bridging the Gap Between Latent and Explicit Reasoning with Looped Transformers
- 2026LatentMT: Machine Translation with Latent Reasoning
- 2026Can We Break LLMs Out of Self-Loops? Fine-Grained Reasoning Control with Activation Steering
- 2026On the Chain-of-Thought Monitorability of Looped Language Models