∞-MoE: Generalizing Mixture of Experts to Infinite Experts
On the map: Mixture-of-experts → MoE theory and gating functions
Abstract (arXiv)
The Mixture of Experts (MoE) selects a few feed-forward networks (FFNs) per token, achieving an effective trade-off between computational cost and performance. In conventional MoE, each expert is treated as entirely independent, and experts are combined in a discrete space. As a result, when the number of experts increases, it becomes difficult to train each expert effectively. To stabilize training while increasing the number of experts, we propose ∞-MoE that selects a portion of the parameters of large FFNs based on continuous values sampled for each token. By considering experts in a continuous space, this approach allows for an infinite number of experts while maintaining computational efficiency. Experiments show that a GPT-2 Small-based ∞-MoE model, with 129M active and 186M total parameters, achieves comparable performance to a dense GPT-2 Medium with 350M parameters. Adjusting the number of sampled experts at inference time allows for a flexible trade-off between accuracy and speed, with an improvement of up to 2.5% in accuracy over conventional MoE.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 15 of its 22 references that are in the map. First posted on arXiv 25 Jan 2026.
Builds on
15 of 22 references.
References · 15
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,883
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
- 2022Unified Scaling Laws for Routed Language Modelscited by 249
3 more
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2023Revisiting Single-gated Mixtures of Experts
- 2025Symphony-MoE: Harmonizing Disparate Pre-trained Models into a Coherent Mixture-of-Experts
- 2025DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Models
- 2024MoE++: Accelerating Mixture-of-Experts Methods with Zero-Computation Experts
- 2026MoE-DisCo:Low Economy Cost Training Mixture-of-Experts Models
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts
- 2022Task-Specific Expert Pruning for Sparse Mixture-of-Experts
- 2024Unchosen Experts Can Contribute Too: Unleashing MoE Models' Power by Self-Contrast