AIAny
Icon for item

Loop the Loopies!

A looped-Transformer LLM series using Mixture-of-Experts (20B with 2B active; 6B with 0.6B active) that trades extra pretraining compute for repeated looping. Shows superior compute-efficiency versus matched-compute vanilla baselines and attains gold-medal performance on 2025 IMO and IPhO after a post-training pipeline.

Introduction

Most scaling strategies buy capability by adding parameters; Loopie flips that trade-off: it reuses parameters by looping a Transformer multiple times and couples looping with sparse MoE routing plus a targeted post-training pipeline to convert extra compute into reasoning gains. The surprising core insight is that, with the right MoE sparsity and post-training, repeated application of a smaller parameter set can outperform simply enlarging the model under the same compute budget.

Key Findings
  • Compute-for-looping trade-off: Trains two MoE looped variants (20B model with ~2B active parameters; 6B model with ~0.6B active parameters) and shows that increased pretraining compute applied via looping can beat enlarging the parameter count when budgets are matched — i.e., a looped model can be more compute‑efficient than a vanilla parameter‑scaled model given the same total compute.

  • Empirical superiority vs parameter-scaling baselines: Extensive ablations (including a vanilla 30B-A3B baseline trained on equivalent compute) indicate consistent gains across held-out validation metrics, implying looped execution plus MoE routing yields practical returns beyond naive looping.

  • Post-training pipeline enables strong reasoning: A dedicated post-training stage materially improves multi-step and math-style reasoning, enabling the model to reach gold-medal performance on the 2025 IMO and IPhO benchmarks without external tools — highlighting that architectural gains need to be paired with task-focused fine‑tuning to unlock reasoning abilities.

Who It's For and Trade-offs

Great fit if you are researching compute-efficient scaling strategies, exploring sparse/MoE routing for looped execution, or need high reasoning performance from mid-sized parameter budgets. The approach is especially relevant for labs with nontrivial pretraining compute who want alternatives to raw parameter scaling.

Look elsewhere if your primary constraints are single-pass throughput, low-latency real-time inference, or simple deployment: looped models increase sequential compute per token and complicate parallelism and sharding. They also require careful MoE routing, hyperparameter tuning, and a post-training regimen to realize the reported reasoning gains. For pure throughput-optimized or latency-critical production services, a conventional larger dense model or other inference-optimized architectures may be preferable.

Where It Fits

Loopie sits between dense parameter-scaling and research into algorithmic efficiency: it is a practical instantiation showing looping + sparsity + post-training can be a viable path to stronger reasoning from mid-sized model families. It should be evaluated alongside other compute-budgeted scaling choices (e.g., MoE at larger scale, ensemble/mixture strategies, or longer-context dense models) when deciding how to allocate finite training FLOPs.

Information

  • Websitearxiv.org
  • AuthorsZitian Gao, Yilong Chen, Yihao Xiao, Xinyu Yang, Ran Tao, Joey Zhou, Bryan Dai
  • Published date2026/07/17

More Items

Introduces Declarative Attention (DA), a zero-shot protocol that has LMs declare which parts of long context to attend to during chain-of-thought, letting the runtime build dynamic attention masks and skip most KV-cache reads. Produces large token savings (up to ~52% on Gemma-4-31B) with modest accuracy loss.

Generates compact keyword sets for both queries and items with LLMs and matches them directly via an inverted index. Uses supervised fine-tuning to align keyword spaces, then alternates GRPO-based reinforcement learning on query- and item-side generators to co-evolve representations and maximize retrieval F1 while staying compatible with keyword-based infrastructure.

Studies looping shared transformer layers in Mixture-of-Experts models under matched budgets and proposes SMELT: loop the middle half twice while matching per-token FLOPs, non-embedding parameters, and KV cache. Shows 6.8–18.0% training-FLOPs savings on the compute-optimal frontier, stronger downstream gains on code and long-context tasks.