Rotate the Loop: Blockwise Conformality for Looped Transformers
cs.LG, cs.AI, stat.ML
Submitted: 2026-09-30
Updated: 2026-09-30
Comments: Accepted at NeurIPS 2026 Workshop "Transitioning from Pre-Training to Post-Training"
License: http://creativecommons.org/licenses/by/4.0/
The gist: Looped transformers reuse one shared block across many recurrent steps, so depth becomes a quantity that can be spent at runtime rather than a stack of distinct layers.
Terminology
Abstract
Looped transformers reuse one shared block across many recurrent steps, so depth becomes a quantity that can be spent at runtime rather than a stack of distinct layers. Those extra steps help only if a write made on one recurrent step is still readable on later ones, and that depends on the linear map applied to the residual between recurrent steps. We show that whether the loop learns to track state is a geometric question about the form of this map, and we propose blockwise conformal injections: the residual splits into coordinate-aligned groups and rotates inside each one, so every group has its own timescale while the geometry stays exact within it. Our experiments show a performance increase on a demanding form of state tracking - last-token accuracy when the rest of the prefix is already correct - and on language modelling, where a signal written earlier has to be retrieved at the end of the sequence.
Sources
- LT2: Linear-Time Looped Transformers
- Solve the Loop: Attractor Models for Language and Reasoning
- Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach
- Group and Shuffle: Efficient Structured Orthogonal Parametrization
- Equilibrium Reasoners: Learning Attractors Enables Scalable Reasoning
- A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers
- Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers
- Parcae: Scaling Laws For Stable Looped Language Models
- How Much Is One Recurrence Worth? Iso-Depth Scaling Laws for Looped Language Models
- On the Residual Scaling of Looped Transformers: Stability and Transferability
- Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?
- Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models
- Group Representational Position Encoding
- Scaling Latent Reasoning via Looped Language Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks