DynaMoE: Dynamic Token-Level Expert Activation with Layer-Wise Adaptive Capacity for Mixture-of-Experts Neural Networks
On the map: Mixture-of-experts → MoE theory and gating functions
Abstract (arXiv)
Mixture-of-Experts (MoE) architectures have emerged as a powerful paradigm for scaling neural networks while maintaining computational efficiency. However, standard MoE implementations rely on two rigid design assumptions: (1) fixed Top-K routing where exactly K experts are activated per token, and (2) uniform expert allocation across all layers. This paper introduces DynaMoE, a novel MoE framework that relaxes both constraints through dynamic token-level expert activation and layer-wise adaptive capacity allocation. DynaMoE introduces a principled routing mechanism where the number of active experts per token varies based on input complexity. Concurrently, the framework implements six distinct scheduling strategies for distributing expert capacity across network depth, including descending, ascending, pyramid, and wave patterns. We theoretically analyze the expressivity gains of dynamic routing and derive bounds on computational efficiency. Through extensive experiments on MNIST, Fashion-MNIST, CIFAR-10 (image classification), and Recycling-the-Web (language modeling) across multiple model scales, we demonstrate that DynaMoE achieves superior parameter efficiency compared to static baselines. Our key finding is that optimal expert schedules are task- and scale-dependent: descending schedules (concentrating capacity in early layers) outperform uniform baselines on image classification. For language modeling, optimal schedules vary by model size, descending for Tiny, ascending for Small, and uniform for Medium. Furthermore, dynamic routing reduces gradient variance during training, leading to improved convergence stability. DynaMoE establishes a new framework for adaptive computation in neural networks, providing principled guidance for MoE architecture design.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 25 of its 32 references that are in the map. First posted on arXiv 2 Mar 2026.
Builds on
25 of 32 references.
Closest ancestors · 1
Same direction, newest first
Other references · 24
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2020Designing Network Design Spacescited by 954
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
12 more
- 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 315
- 2018Slimmable Neural Networkscited by 301
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
- 2015Conditional Computation in Neural Networks for faster modelscited by 166
- 2021ExT5: Towards Extreme Multi-Task Scaling for Transfer Learningcited by 161
- 2022On the Representation Collapse of Sparse Mixture of Expertscited by 156
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
- 2021Taming Sparsely Activated Transformer with Stochastic Expertscited by 112
- 2017Dynamic Deep Neural Networks: Optimizing Accuracy-Efficiency Trade-offs by Selective Executioncited by 59
- 2025Recycling the Web: A Method to Enhance Pre-training Data Quality and Quantity for Language Modelscited by 31
- 2017Multi-Scale Dense Networks for Resource Efficient Image Classificationcited by 15
- 2023DiT: Efficient Vision Transformers with Dynamic Token Routingcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2022Optimizing Mixture of Experts using Dynamic Recompilations
- 2026Optimal Expert-Attention Allocation in Mixture-of-Experts: A Scalable Law for Dynamic Model Design
- 2025ReXMoE: Reusing Experts with Minimal Overhead in Mixture-of-Experts
- 2023Exploiting Activation Sparsity with Dense to Dynamic-k Mixture-of-Experts Conversion
- 2025Chain-of-Experts: Unlocking the Communication Power of Mixture-of-Experts Models
- 2025How Many Experts Are Enough? Towards Optimal Semantic Specialization for Mixture-of-Experts
- 2025Input Domain Aware MoE: Decoupling Routing Decisions from Task Optimization in Mixture of Experts
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocation