Rotate the Loop: Blockwise Conformality for Looped Transformers
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 41 of its 45 references that are in the map. First posted on arXiv 30 Sep 2026.
Builds on
41 of 45 references.
References · 41
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2018Universal Transformerscited by 647
- 2022On the Parameterization and Initialization of Diagonal State Space Modelscited by 424
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 408
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2022Transformers Learn Shortcuts to Automatacited by 268
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 240
- 2022The Parallelism Tradeoff: Limitations of Log-Precision Transformerscited by 193
- 2024The Illusion of State in State-Space Modelscited by 187
29 more
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 165
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
- 2021Saturated Transformers are Constant-Depth Threshold Circuitscited by 139
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
- 2023What Formal Languages Can Transformers Express? A Surveycited by 124
- 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 114
- 2024Unlocking State-Tracking in Linear RNNs Through Negative Eigenvaluescited by 101
- 2024Looped Transformers for Length Generalizationcited by 99
- 2017On orthogonality and learning recurrent networks with long term dependenciescited by 83
- 2025DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Productscited by 75
- 2014A Clockwork RNNcited by 72
- 2023Tighter Bounds on the Expressivity of Transformer Encoderscited by 66
- 2016Tunable Efficient Unitary Neural Networks (EUNN) and their application to RNNscited by 65
- 2026Parcae: Scaling Laws For Stable Looped Language Modelscited by 55
- 2025A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformerscited by 53
- 2024The Expressive Capacity of State Space Models: A Formal Language Perspectivecited by 46
- 2022Path Independent Equilibrium Models Can Better Exploit Test-Time Computationcited by 38
- 2024On Expressive Power of Looped Transformers: Theoretical Analysis and Enhancement via Timestep Encodingcited by 36
- 2025PaTH Attention: Position Encoding via Accumulating Householder Transformationscited by 34
- 2026Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformerscited by 28
- 2026How Much Is One Recurrence Worth? Iso-Depth Scaling Laws for Looped Language Modelscited by 24
- 2026Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Modelscited by 21
- 2026Equilibrium Reasoners: Learning Attractors Enables Scalable Reasoningcited by 18
- 2026Solve the Loop: Attractor Models for Language and Reasoningcited by 13
- 2014Learning Longer Memory in Recurrent Neural Networkscited by 12
- 2024Group and Shuffle: Efficient Structured Orthogonal Parametrizationcited by 11
- 2026On the Residual Scaling of Looped Transformers: Stability and Transferabilitycited by 10
- 2026LT2: Linear-Time Looped Transformerscited by 7
- 2026Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?cited by 6
Built on by
Not cited yet.