Skip to content

Training-Free Halving of Activated Experts in Fine-Grained Mixture-of-Experts Models

Sep 2026 · 0 citations · 24 references
Computer Science

TL;DR

It is found that perplexity and downstream accuracy favor different MoE experts, cautioning against selecting MoE compression settings using unlabeled text alone, and showing that expert identity matters substantially more than expert weighting, while balanced and domain-specialized routing leaves limited room for expert pruning.

Abstract

Modern fine-grained Mixture-of-Experts (MoE) models route each token to a small number of experts and renormalize their router probabilities. We show that this renormalization implicitly calibrates expert output gain to the training top-$k$: reducing $k$ at inference changes not only which experts are used but also the strength of the expert branch. We separate these effects by activating the top $k_1$ experts while normalizing by the probability mass of the top $k_2$ experts, introducing one integer with no parameters, training, or measurable compute overhead. On Qwen3.6-35B-A3B, reducing from 8 to 4 experts causes a 4.65-point MMLU drop under standard renormalization but only 0.35 points with $k_2=16$, while halving routed-expert compute. The result replicates on the $11\times$ larger Qwen3.5-397B-A17B, where reducing from 10 to 5 experts loses only 0.55 points with an appropriate reference set. Removing renormalization entirely is catastrophic, showing that preserving a suitable reference mass is crucial. We further find that perplexity and downstream accuracy favor different $k_2$, cautioning against selecting MoE compression settings using unlabeled text alone. Analyses also show that expert identity matters substantially more than expert weighting, while balanced and domain-specialized routing leaves limited room for expert pruning.

View source

Similar papers

#machine learning Preprint Sep 2026

RAZOR: Pruning Replaceable Experts in LLMs

RAZOR, a training-free pruning method based on consensus residuals, the deviations of expert outputs from their original weighted mixture, gives the exact output change for a single deletion under survivor renormalization and router refill.

Ming-Yang Song, Mao Zheng · 0 citations
#machine learning Preprint Oct 2026

Dense Mixture-of-Experts as a Reparameterized Wide FFN: A Granularity Sweep at Fixed Compute

Sparse Mixture-of-Experts (MoE) models combine learned routing with selection from a large expert pool. We isolate the contribution of dynamic expert combination using a dense analogue: $K$ SwiGLU experts, all active for every token and combined by a softmax gate, at fixed total FFN width. With no larger pool or discre...

Vu Quang Hoang, Nghia Hieu Nguyen · 0 citations
#artificial intelligence Preprint Oct 2026

Distributionally Robust Mixture-of-Experts Training

Mixture-of-Experts (MoE) transformers scale capacity by activating only a few experts per token, but this sparsity creates a hidden reliability problem: when routing is imperfect, load-balanced models may send tokens to experts that are insufficiently trained for the assigned inputs. We propose Distributionally Robust...

Xin Teng, Mu-Xi Li, Hong-Yi Wen · 0 citations
#artificial intelligence Preprint Sep 2026

Higher-order pruning of experts in mixture-of-experts language models

Mixture-of-Experts (MoE) language models suffer from large parameter counts, which create a significant memory bottleneck. Expert pruning is the most direct approach for reducing this parameter count, yet existing methods make pruning decisions for each expert independently, and assume experts'contributions are purely...

Alex M. Tseng, Prannay Kaul, L. Zancato et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts

Layer-wise Distribution Alignment (LDA), a lightweight inference-time correction that uses layer-wise calibration statistics to align reduced-routing representations with the default configuration, is proposed, recovering much of the performance lost induced by the distributional shift under reduced routing while prese...

Dohyeon Kim, Bedionita Soro, Sung Ju Hwang · 0 citations
#machine learning Preprint Sep 2026

Towards a Statistical Understanding of Mixture-of-Experts

This paper derives oracle risk bounds for learning dense and sparse routing with evolving experts, separating approximation, expert-learning, and router-estimation errors, and characterize how sparse Top-K routing can retain the benefits of localized aggregation while controlling per-input computation.

Si-Yuan He, Bo-Kai Yang, Jie Hu et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.