Sparse Layers are Critical to Scaling Looped Language Models
On the map: Mixture-of-experts → MoE large language models
also in 1 more
Abstract (arXiv)
Looped language models repeat a set of transformer layers through depth, reducing memory costs and providing natural early-exit points at loop boundaries. However, looped models do not scale as favorably as standard transformers with unique layers. We compare standard and Mixture-of-Experts (MoE) transformers, with and without looping, and find two main results. First, we find Looped-MoE models scale better than the standard baseline while dense looped models do not. We trace this to routing divergence between loops: in Looped-MoE models, different experts are activated on each pass through the same shared layers, recovering expressivity without additional parameters. Our second finding is that looped models have better compute-quality trade-offs with early exits than standard models. Because each loop ends with the same layers that produce the final output, loop boundaries are superior exit points, as confirmed by earlier output convergence at these points. In sum, we provide a clear direction for scaling looped models: a Looped-MoE model with early exits can not only beat standard transformers at scale, but also enable significant memory and inference savings with minimal degradation in quality.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 24 of its 28 references that are in the map. First posted on arXiv 9 May 2026.
Builds on
24 of 28 references.
Closest ancestors · 2
Same direction, newest first
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Models17 Feb
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer23 Jan
Other references · 22
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019Root Mean Square Layer Normalizationcited by 1,425
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 694
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
- 2022Confident Adaptive Language Modelingcited by 297
10 more
- 2022Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfercited by 272
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2024OLMES: A Standard for Language Model Evaluationscited by 100
- 2025Don't be lazy: CompleteP enables compute-efficient deep transformerscited by 69
- 2026Parcae: Scaling Laws For Stable Looped Language Modelscited by 45
- 2023SwitchHead: Accelerating Transformers with Mixture-of-Experts Attentioncited by 34
- 2023Approximating Two-Layer Feedforward Networks for Efficient Transformerscited by 27
- 2025Training Dynamics of the Cooldown Stage in Warmup-Stable-Decay Learning Rate Schedulercited by 9
Built on by
Citing papers per year: 2026: 10.
10 papers.
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformerscited by 12
- 2026Dense Supervision Is Not Enough: The Readout Blind Spot in Looped Language Modelscited by 5
- 2026Loop the Loopies!cited by 4
- 2026Depth-adaptive Inference of Looped Language Models via Continuous Depth Batchingcited by 4
- 2026Allocating Recurrent Compute in Looped Language Modelscited by 4
- 2026Improving Test-Time Scaling with Adaptive Looped Transformerscited by 0
- 2026What Makes Recurrence Effective in Looped Language Models?cited by 0
- 2026Scheduling Recursive Reasoning in Looped Transformerscited by 0
- 2026Scaling Laws for Looped Mixture of Expertscited by 0
- 2026Looping Beyond Twice: A Scalable Recipe for Looped Mixture-of-Expertscited by 0
- 2026Looping Beyond Twice: A Scalable Recipe for Looped Mixture-of-Experts1 Oct 2026
- 2026Scaling Laws for Looped Mixture of Experts30 Sep 2026
- 2026Scheduling Recursive Reasoning in Looped Transformers29 Sep 2026
- 2026What Makes Recurrence Effective in Looped Language Models?29 Sep 2026
- 2026Improving Test-Time Scaling with Adaptive Looped Transformers28 Sep 2026
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers1 Sep 2026
- 2026Allocating Recurrent Compute in Looped Language Models18 Aug 2026
- 2026Depth-adaptive Inference of Looped Language Models via Continuous Depth Batching10 Aug 2026
- 2026Loop the Loopies!17 Jul 2026
- 2026Dense Supervision Is Not Enough: The Readout Blind Spot in Looped Language Models12 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2026LoopMoE: Unifying Iterative Computation with Mixture-of-Experts for Language Modeling
- 2026Tying the Loop -- Tied Expert Layers in Mixture-of-Experts Language Models
- 2026Looped Diffusion Language Models
- 2021Efficient Large Scale Language Modeling with Mixtures of Experts
- 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Models
- 2026Hidden Decoding at Scale: Latent Computation Scaling for Large Language Models
- 2024Scaling Laws Across Model Architectures: A Comparative Analysis of Dense and MoE Models in Large Language Models
- 2026Loop Dropout: Regularizing Shared Updates in Looped Language Models