Mixture-of-experts routing
MC-SMoE
Heavily superseded — a standard baseline that newer methods routinely beat
8 papers critique it · 12 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites MC-SMoE as a baseline.
However, this approach inherently diminishes the model's representational diversity, and identifying an optimal merging strategy is non-trivial. Furthermore, while MC-SMoE employs progressive low-rank decomposition during retraining for further expert compression, it introduces substantial training overhead.
“When applied to MoE models with low-similarity experts, these methods generally fail due to significant parameter conflicts during the merging process.”
“While this reduces computational costs, it sacrifices the token-level routing flexibility that makes MoE models powerful.”
“existing expert pruning methods such as MC-SMoE li2024merge and RS he2024demystifying remove experts from MoE models primarily based on the expert access frequency. However, as shown in Figure intro (b), this feature alone fails to fully capture the expert redundancy”
“This idealized assumption often limits performance.”
“Nevertheless, in task-agnostic settings without retraining, relying on frequency information for clustering proves ineffective in Table~{tab:qwen and Table~tab:mixtral}. This approach faces three main issues. First, frequency varies across tasks, as shown in Appendix sec:freq-analysis, making it an unreliable indicator for deciding how many experts to retain in each layer. Second, high-frequency experts within the same layer are rarely merged, overlooking their functional similarities in the feature space. Moreover, grouping based on router information can be problematic, as it depends on dataset-dependent statistics.”
“More recently, MC-SMoE~li2024mergecompressdemystifyefficient dynamically merges experts during inference time, though it is limited to specific tasks.”
“M-SMoE demonstrates the potential of clustering and merging experts to reduce model size, but its merging algorithm is heuristic in nature and lacks theoretical support.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating MC-SMoE. Values are copied from the source paper's tables — verify against the cited paper.
EASY-EP beats MC-SMoE
45.22 vs 1.52
Avg · [DeepSeek-R1, domain-specific, 64 experts]
Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot DemonstrationsREAP beats MC-SMoE
0.441 vs 0.089
Code Avg · [ERNIE-4.5-21B-A3B-PT, 50% compression]
REAP the Experts: Why Pruning Prevails for One-Shot MoE compressionResMoE beats MC-SMoE
22.05 vs 278.76
approximation_error · [Switch Transformer]
ResMoE: Space-efficient Compression of Mixture of Experts LLMs via Residual RestorationHC-SMoE beats MC-SMoE
0.5729 vs 0.3251
Average · [Mixtral 4x7B]
Retraining-Free Merging of Sparse MoE via Hierarchical ClusteringDERN beats MC-SMoE
55.50 vs 31.52
Average · [DeepSeek 12.7B]
Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMsMoNE beats MC-SMoE
59.46 vs 43.93
Average accuracy · [Moonlight, 50% pruning]
MoNE: Replacing Redundant Experts with Lightweight Novices for Structured Pruning of MoEHodgeCover beats MC-SMoE
66.7 vs 52.0
DS-Avg (9-task unweighted average accuracy) · [66% expert reduction on Qwen 3.5-35B-A3B]
HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-ExpertsLightMoE beats MC-SMoE
48.1 vs 42.5
Average · [50% compression]
LightMoE: Reducing Mixture-of-Experts Redundancy through Expert ReplacingMergeMoE beats MC-SMoE
71.58 vs 68.87
Hellaswag · [10B compression]
MergeMoE: Efficient Compression of MoE Models via Expert Output MergingCD-MoE beats MC-SMoE
62.6 vs 61.8
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 4, 2026
- May 19, 2026
- CoX-MoECoX-MoE: Coalesced Expert Execution for High-Throughput MoE Inference with AMX-Enabled CPU-GPU Co-ExecutionMay 18, 2026
- HodgeCoverHodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-ExpertsMay 13, 2026
- Apr 22, 2026
- Apr 12, 2026
- Alloc-MoEAlloc-MoE: Budget-Aware Expert Activation Allocation for Efficient Mixture-of-Experts InferenceApr 9, 2026
- Mar 19, 2026
- Mar 13, 2026
- Mar 12, 2026
- Mar 6, 2026