mlsanityData to 14 Oct 2026

Optimal Expert-Attention Allocation in Mixture-of-Experts: A Scalable Law for Dynamic Model Design

arXiv 2603.10379 ↗First posted 11 Mar 2026cs.LG cs.AIcited by 0

On the map: Mixture-of-experts → MoE theory and gating functions

Abstract (arXiv)

This paper presents a novel extension of neural scaling laws to Mixture-of-Experts (MoE) models, focusing on the optimal allocation of compute between expert and attention sub-layers. As MoE architectures have emerged as an efficient method for scaling model capacity without proportionally increasing computation, determining the optimal expert-attention compute ratio becomes critical. We define the ratio r as the fraction of total FLOPs per token dedicated to the expert layers versus the attention layers, and explore how this ratio interacts with the overall compute budget and model sparsity. Through extensive experiments with GPT-style MoE Transformers, we empirically find that the optimal ratio r^* follows a power-law relationship with total compute and varies with sparsity. Our analysis leads to an explicit formula for r^*, enabling precise control over the expert-attention compute allocation. We generalize the Chinchilla scaling law by incorporating this architectural parameter, providing a new framework for tuning MoE models beyond size and data. Our findings offer practical guidelines for designing efficient MoE models, optimizing performance while respecting fixed compute budgets.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 11 of its 17 references that are in the map. First posted on arXiv 11 Mar 2026.

Builds on

11 of 17 references.

References · 11

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Scaling Laws for Neural Language Modelscited by 6,586
  3. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  4. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  5. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
  6. 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 867
  7. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
  8. 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
  9. 2022Unified Scaling Laws for Routed Language Modelscited by 253
  10. 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 173
  11. 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Modelscited by 50

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient
  2. 2025Beyond Benchmarks: Understanding Mixture-of-Experts Models through Internal Mechanisms
  3. 2025On the Expressive Power of Mixture-of-Experts for Structured Complex Tasks
  4. 2026Let's Scale Step by Step: Compute-Efficient Hyperparameter Transfer for Large-Scale Mixture-of-Experts
  5. 2023Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuning
  6. 2026Holistic Scaling Laws for Optimal Mixture-of-Experts Architecture Optimization
  7. 2026Shaping Latent Mixture-of-Experts: From Expert Geometry to Layerwise Capacity Allocation
  8. 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Experts