LoopMoE: Unifying Iterative Computation with Mixture-of-Experts for Language Modeling
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Mixture-of-Experts (MoE) and looped architectures scale models along two orthogonal axes, namely parameter capacity and effective depth. However, mainstream looped architectures rely on dense backbones that couple parameter count with per-token FLOPs, which makes it impossible to isolate the effect of iterative computation under matched budgets. To this end, we present LoopMoE, a looped MoE language model that integrates sparse routing with iterative weight-shared computation through two designs. The first is IterAdaLN, which resolves weight-sharing symmetry via a modulation signal jointly conditioned on the iteration index and the per-token hidden state. The second is a capacity-balancing strategy that recovers the attention-to-FFN active parameter ratio of well-tuned non-looped references. Together, these designs enable the first strictly controlled, head-to-head evaluation of a looped MoE against a Vanilla MoE under identical total parameters, per-token FLOPs, and active sublayer ratios. Across nine downstream benchmarks, LoopMoE's average improvement over its matched vanilla MoE increases from over 1 point at the 3B scale to approximately 3 points at the 9B scale. These results provide initial evidence that the benefits of iterative sparse computation may strengthen with scale, positioning LoopMoE as a promising architecture for scalable looped language models.
Key facts. Cited by 7 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 31 of its 49 references that are in the map. First posted on arXiv 3 Jun 2026.
Builds on
31 of 49 references.
Closest ancestors · 4
Same direction, newest first
- 2024OLMoE: Open Mixture-of-Experts Language Models3 Sep
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
- 2024OpenMoE: An Early Effort on Open Mixture-of-Experts Language Models29 Jan
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding30 Jun
Other references · 27
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
- 2017Arbitrary Style Transfer in Real-time with Adaptive Instance Normalizationcited by 1,998
- 2019Root Mean Square Layer Normalizationcited by 1,425
15 more
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2025GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Modelscited by 446
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2023CoLT5: Faster Long-Range Transformers with Conditional Computationcited by 84
- 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 72
- 2026LoopFormer: Elastic-Depth Looped Transformers for Latent Reasoning via Shortcut Modulationcited by 48
- 2024Disentangling Memory and Reasoning Ability in Large Language Modelscited by 43
- 2025Teaching Pretrained Language Models to Think Deeper with Retrofitted Recurrencecited by 41
- 2023CoTFormer: A Chain-of-Thought Driven Architecture with Budget-Adaptive Computation Cost at Inferencecited by 27
- 2024Power Scheduler: A Batch Size and Token Number Agnostic Learning Rate Schedulercited by 26
- 2025Dr.LLM: Dynamic Layer Routing in LLMscited by 10
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformerscited by 12
- 2026Loop the Loopies!cited by 4
- 2026Allocating Recurrent Compute in Looped Language Modelscited by 4
- 2026Tying the Loop -- Tied Expert Layers in Mixture-of-Experts Language Modelscited by 2
- 2026How to Loop MoE: Flatten the Experts, Untie the Attentioncited by 0
- 2026Scheduling Recursive Reasoning in Looped Transformerscited 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
- 2026Scheduling Recursive Reasoning in Looped Transformers29 Sep 2026
- 2026How to Loop MoE: Flatten the Experts, Untie the Attention28 Sep 2026
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers1 Sep 2026
- 2026Allocating Recurrent Compute in Looped Language Models18 Aug 2026
- 2026Loop the Loopies!17 Jul 2026
- 2026Tying the Loop -- Tied Expert Layers in Mixture-of-Experts Language Models15 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2026Sparse Layers are Critical to Scaling Looped Language Models
- 2025Ban&Pick: Enhancing Performance and Efficiency of MoE-LLMs via Smarter Routing
- 2025ReXMoE: Reusing Experts with Minimal Overhead in Mixture-of-Experts
- 2025DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs
- 2026Multi-Head LatentMoE and Head Parallel: Communication-Efficient and Deterministic MoE Parallelism
- 2025Grove MoE: Towards Efficient and Superior MoE LLMs with Adjugate Experts
- 2025Towards Greater Leverage: Scaling Laws for Efficient Mixture-of-Experts Language Models
- 2023Pipeline MoE: A Flexible MoE Implementation with Pipeline Parallelism