MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocation
On the map: Mixture-of-experts → Expert routing strategies
Abstract (arXiv)
Sparsely-activated Mixture-of-Experts (MoE) Transformers universally fix the same number of routed experts across all layers, a convention that ignores the well-documented heterogeneity in layer-wise redundancy. We demonstrate that this uniformity is systematically suboptimal and propose MAPLE, a plug-and-play framework that reallocates the routed-expert budget heterogeneously across layers of any pretrained MoE LLM, without modifying weights or requiring retraining. Our core contribution is a closed-form sensitivity-guided allocation: we probe each layer's response to variation in expert count, quantify sensitivity using three measures, and derive an analytically optimal budget assignment that directs capacity towards sensitive layers and absorbs reductions in redundant layers. This closed-form solution is further refined by a sensitivity-constrained genetic search that uses layer-wise sensitivity as a prior to guide exploration, yielding faster convergence and superior allocation quality. On four MoE models spanning different scales and architectures, MAPLE outperforms uniform and pruning-based baselines under a 75% routed-expert budget. Notably, on DeepSeek-MoE-16B, MAPLE uses only 75% of the experts yet surpasses the original 100% expert-uniform baseline on ARC-E, ARC-C, and BoolQ, improving accuracy from 65.09 to 71.40, 48.49 to 51.50, and 80.03 to 82.38, respectively. These accuracy gains translate into measured deployment efficiency: implementing MAPLE in SGLang reduces single-GPU end-to-end serving latency by 32.2% and improves throughput by 47.4%. These results show that well-designed heterogeneous allocation can be more effective than simply activating more experts, establishing it as a principled and practical axis for improving MoE efficiency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 51 of its 62 references that are in the map. First posted on arXiv 15 Aug 2026.
Builds on
51 of 62 references.
Closest ancestors · 5
Same direction, newest first
- 2025Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrations9 Apr
- 2024Layerwise Recurrent Router for Mixture-of-Experts13 Aug
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy2 Oct
- 2022Mixture-of-Experts with Expert Choice Routing18 Feb
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan
Other references · 46
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
34 more
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2018CBAM: Convolutional Block Attention Modulecited by 2,463
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2024Mixtral of Expertscited by 1,785
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 391
- 2019HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precisioncited by 387
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2024OLMoE: Open Mixture-of-Experts Language Modelscited by 291
- 2019HAWQ-V2: Hessian Aware trace-Weighted Quantization of Neural Networkscited by 250
- 2020Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluationcited by 183
- 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 146
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 140
- 2024Higher Layers Need More LoRA Expertscited by 101
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Routercited by 58
- 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decompositioncited by 57
- 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costscited by 51
- 2025MoNE: Replacing Redundant Experts with Lightweight Novices for Structured Pruning of MoEcited by 12
- 2024Condense, Don't Just Prune: Enhancing Efficiency and Performance in MoE Layer Pruningcited by 10
- 2025LExI: Layer-Adaptive Active Experts for Efficient MoE Model Inferencecited by 5
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Synergistic Intra- and Cross-Layer Regularization Losses for MoE Expert Specialization
- 2026UniPool: A Globally Shared Expert Pool for Mixture-of-Experts
- 2026DECO: Sparse Mixture-of-Experts with Dense-Comparable Performance on End-Side Devices
- 2026MoE Lens -- An Expert Is All You Need
- 2026MoRE: Mixture of Reused Experts
- 2026Hierarchical Mixture-of-Experts with Two-Stage Optimization
- 2026Meta-Learning Where to Allocate Experts: Task-Conditioned Layer-Wise Compression for MoEs
- 2026Share First, Route What Remains: A Unified Framework for Token-Adaptive MoE Computation