Mixture-of-experts routing
ReMoE
ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routing
Superseded baseline#14 of 1,370 most-superseded · first seen Dec 19, 2024
Superseded — cited as a baseline and beaten by newer methods
3 papers critique it · 4 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites ReMoE as a baseline.
While this directly tackles the gradient bottleneck, the resulting "soft" routing needs an auxiliary loss to enforce sparsity. In practice, these can inject interference gradients, complicate tuning, and dampen expert specialization~Wang2024LossFreeBalancing.
“However, these approaches still require the model to construct its load-balanced structure on-the-fly during training.”
“Both DynMoE and ReMoE face the challenge of needing explicit mechanisms to manage the upper bound on the number of activated experts so as to avoid potential high computation overhead.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating ReMoE. Values are copied from the source paper's tables — verify against the cited paper.
ProbMoE beats ReMoE
39.23 vs 16.99
Translation · [Qwen backbone (Top-k = 4)]
ProbMoE: Differentiable Probabilistic Routing for Mixture-of-ExpertsBlockFFN beats ReMoE
71.38 vs 42.44
DECO beats ReMoE
47.38 vs 46.37
What to use instead
Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.
- Jun 1, 2026
- May 24, 2026
- May 11, 2026
- SPHERESPHERE: Mitigating the Loss of Spectral Plasticity in Mixture-of-Experts for Deep Reinforcement LearningMay 6, 2026
- May 6, 2026
- Apr 23, 2026
- Feb 10, 2026
- Feb 9, 2026
- Feb 5, 2026
- GRIP (Geometric Routing Invariance Preservation)GRIP: Algorithm-Agnostic Machine Unlearning for Mixture-of-Experts via Geometric Router ConstraintsJan 23, 2026
- Jan 7, 2026