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

Builds structured knowledge graphs for retrieval-augmented generation via a multi-step GraphRAG pipeline that separates extraction from consolidation. Key features include typed two-stage extraction, DBSCAN-backed deduplication, LLM summarization, Leiden community detection, and a compact 7B extractor model (Meno-Lite-0.1).

Specialized LLM for clinical workflows trained via a human-gated self-evolution loop to improve patient consultation, multimodal clinical reasoning, interactive diagnosis, and EHR tool use. Iteratively refines targeted synthetic and curated data based on benchmark failures to raise specific capabilities without broad regressions.

Expands a Transformer’s residual stream into many parallel streams and introduces xHC to scale Hyper-Connections beyond N=4. Combines temporal feature augmentation with sparse residual updates (update k=4 of N=16) and xHC-Flash memory optimizations to raise downstream scores while cutting effective compute and memory traffic.