S2MoE: Robust Sparse Mixture of Experts via Stochastic Learning
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Sparse Mixture of Experts (SMoE) enables efficient training of large language models by routing input tokens to a select number of experts. However, training SMoE remains challenging due to the issue of representation collapse. Recent studies have focused on improving the router to mitigate this problem, but existing approaches face two key limitations: (1) expert embeddings are significantly smaller than the model's dimension, contributing to representation collapse, and (2) routing each input to the Top-K experts can cause them to learn overly similar features. In this work, we propose a novel approach called Robust Sparse Mixture of Experts via Stochastic Learning (S2MoE), which is a mixture of experts designed to learn from both deterministic and non-deterministic inputs via Learning under Uncertainty. Extensive experiments across various tasks demonstrate that S2MoE achieves performance comparable to other routing methods while reducing computational inference costs by 28%.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 6 of its 12 references that are in the map. First posted on arXiv 29 Mar 2025.
Builds on
6 of 12 references.
Closest ancestors · 1
Same direction, newest first
Other references · 5
- 2017Attention Is All You Needcited by 59,932
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2021Scaling Vision with Sparse Mixture of Expertscited by 740
- 2022Composed Image Retrieval with Text Feedback via Multi-grained Uncertainty Regularizationcited by 45
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Rethinking Sparse Mixture of Experts from a Unified Perspective
- 2024SimSMoE: Solving Representational Collapse via Similarity Measure
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clustering
- 2025Modeling Expert Interactions in Sparse Mixture of Experts via Graph Structures
- 2024On the Role of Discrete Representation in Sparse Mixture of Experts
- 2024CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competition
- 2024Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning
- 2026Eigenvectors of Experts are Training-free Non-collapsing Routers