Ouroboros: Dynamic Weight Generation for Recursive Transformers via Input-Conditioned LoRA Modulation
Not on the map. Why?
Abstract (arXiv)
Recursive transformers reuse a shared weight block across multiple depth steps, trading parameters for compute. A core limitation: every step applies the same transformation, preventing the model from composing distinct operations across depth. We present Ouroboros, a system that attaches a compact Controller hypernetwork to a recursive transformer block. The Controller observes the current hidden state, produces a per-step diagonal modulation vector, and applies it to frozen SVD-initialized LoRA bases, making each recurrence step input-dependent. We combine this with gated recurrence (bias-initialized to 88% retention) and per-step LayerNorm for stable deep iteration. On Qwen2.5-3B split into a Prelude/Recurrent/Coda architecture (17 of 36 layers retained), Ouroboros reduces training loss by 43.4% over the unmodified 17-layer baseline, recovering 51.3% of the performance gap caused by layer removal. The full system adds only 9.2M trainable parameters (Controller, gate, and per-step norms) yet outperforms equivalently-sized static per-step LoRA by 1.44 loss points at depth 1 and remains ahead across all tested depths (1, 4, 8, 16) and ranks (8, 32, 64). We also find that gated recurrence is essential: without it, recursive layer application makes the model strictly worse. These gains are measured on the training distribution; on held-out text, the Controller does not yet improve over the baseline, a limitation we attribute to frozen downstream layers and discuss in detail. Code: https://github.com/RightNow-AI/ouroboros
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 18 references that are in the map. First posted on arXiv 2 Apr 2026.
Builds on
13 of 18 references.
References · 13
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2016HyperNetworkscited by 1,027
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 797
- 2018Universal Transformerscited by 647
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
- 2023Looped Transformers as Programmable Computerscited by 237
- 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 78
- 2025Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinkingcited by 57
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrencecited by 47
- 2025RingFormer: Rethinking Recurrent Transformer with Adaptive Level Signalscited by 6
1 more
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026What Makes Recurrence Effective in Looped Language Models?29 Sep 2026