arXiv:2603.10379cs.LGcs.AI2026-03ACL

提出专家与注意力计算分配的最优比例,实现高效模型设计。

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

  • 基于计算量和稀疏性,发现专家-注意力算力比呈幂律关系。
  • 在固定算力下,优化该比例可提升模型性能约15%以上。
  • 适合需要高效扩展的大模型研发人员参考使用。

本文将神经网络缩放定律扩展至混合专家(MoE)模型,聚焦专家层与注意力层之间的算力分配优化。定义算力比 $r$ 为每标记专家层所占总浮点运算量的比例,研究其与总体算力预算及模型稀疏性的关系。通过在类 GPT 的 MoE 变压器上进行大规模实验,发现最优算力比 $r^*$ 随总计算量呈幂律变化,并随稀疏性调整。由此推导出 $r^*$ 的显式公式,实现对算力分配的精准控制。我们拓展了 Chinchilla 缩放定律,引入这一架构参数,为超越模型规模与数据量的 MoE 模型调优提供新框架。研究结果为在固定算力下设计高效 MoE 模型提供了实用指导。

原文摘要 · Abstract (English)

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.

MoE缩放定律算力分配模型优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。