arXiv CS
open access
Scaling Laws for Looped Mixture of Experts
Looped transformers and Mixture-of-Experts (MoE) offer complementary routes to efficient scaling: recurrence increases computational depth at fixed parameters, while MoE sparsity expands total capacity at fixed active compute. Yet existing scaling laws model recurrence or sparsity in isolation. In t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scaling Laws for Looped Mixture of Experts#1154576
- How to Loop MoE: Flatten the Experts, Untie the Attention#1130397
- How to Loop MoE: Flatten the Experts, Untie the Attention#1108744
- Function Over Form: Distributional Orthogonalization in Mixture-of-Experts with Replica Expert Mechanism#1116729
- MoRA: MoE Pruning via Router Bias Learning and Expert Approximation#1154990
Record · ID 1136810
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive