Running Fewer Loops Removes Refusal Behaviour in Recurrent-Depth Language Models
cs.AI
Submitted: 2026-10-10
Updated: 2026-10-10
License: http://creativecommons.org/licenses/by/4.0/
The gist: A recurrent-depth language model reuses one block of weights several times in a row.
Abstract
A recurrent-depth language model reuses one block of weights several times in a row. The number of repetitions, which we call loops, is chosen when the model runs, not when it is trained, and running fewer is cheaper and faster, so a deployment may choose to do it. Running fewer loops also makes these models less safe, and the loss of safety is larger than the loss of anything else we measured. We study four released Ouro checkpoints and Huginn-0125. At half of its trained depth, Ouro-1.4B-Thinking still solves 0.692 of the GSM8K maths problems, against 0.775 at full depth, keeping 89% of its accuracy. Over the same reduction, the rate at which it helps with harmful requests rises from 0.038 to 0.205, 5.3 times higher. The information is not lost: a linear classifier reads whether a request is harmful from the model's internal state after a single loop, with an ROC AUC of 0.967 against 0.986 at full depth. What the missing loops remove is the refusal that should follow. We measure the effect with four instruments, one generating no text at all, and reproduce it on a second model family. Removing a single direction from Ouro-1.4B's internal state at full depth drops its refusal rate on harmful prompts from 0.950 to 0.130, identifying what the shallow model is missing. Two run-time repairs do not help: the models' early-exit rules do not spend more loops on harmful requests, and choosing a depth per request does not recover the loss. Changing the training does. Standard safety training makes the shallow model safe only by refusing 0.865 of harmless requests, while training at randomly chosen depths reaches a separation of +0.399 between harmful and harmless refusal at one loop, against +0.118. On Huginn-0125 it keeps harmful help at or below 0.040 at every depth from 1 to 32 loops, where standard training reaches 0.194, and it costs no accuracy at full depth.
Sources
- Understanding intermediate layers using linear classifier probes
- Refusal in Language Models Is Mediated by a Single Direction
- Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback
- Constitutional AI: Harmlessness from AI Feedback
- PonderNet: Learning to Ponder
- Probing Classifiers: Promises, Shortcomings, and Advances
- Eliciting Latent Predictions from Transformers with the Tuned Lens
- JailbreakBench: An Open Robustness Benchmark for Jailbreaking Large Language Models
- Assessing Adversarial Robustness of Latent Reasoning Models
- MoEUT: Mixture-of-Experts Universal Transformers
- OR-Bench: An Over-Refusal Benchmark for Large Language Models
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- Universal Transformers
- Exploiting LLM Quantization
- LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding
- Looped Transformers for Length Generalization
- Think-at-Hard: Dynamic Looped Transformers for Improved Reasoning
- Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?
- Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach
- Looped Transformers as Programmable Computers
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems