arXiv:2604.19835cs.LGcs.AI2026-04

通过专家复制提升大模型能力,节省32%训练时间。

Expert Upcycling: Shifting the Compute-Efficient Frontier of Mixture-of-Experts

  • 训练中逐步复制专家并扩展路由,保持推理成本不变。
  • 新模型验证损失达基线水平,节省32% GPU小时。
  • 适合资源有限但需扩展模型能力的团队使用。

Mixture-of-Experts(MoE)通过稀疏路由实现参数量与每令牌计算量解耦,是当前大模型扩展的主流架构。然而,大规模MoE训练代价高昂,因内存和跨设备通信随总参数量增长。本文提出专家升级(expert upcycling):在持续预训练(CPT)过程中,通过复制专家并扩展路由器,在固定Top-K路由下增加专家数量,从而提升模型容量而不增加推理开销。复制提供良好初始化,使新模型起始损失远低于随机初始化;后续CPT打破重复专家对称性,推动专业化。我们建立理论框架,将性能差距分解为容量项与初始化项。引入基于梯度重要性的专家选择策略,非均匀复制可使性能差距缩小超三倍。在7B至13B参数量实验中,升级后模型达到固定规模基线的验证损失表现,同时节省32% GPU小时。跨模型规模、激活率、结构及训练预算的全面消融实验,给出可落地的部署方案,证明该方法是训练大型MoE的高效替代路径。

原文摘要 · Abstract (English)

Mixture-of-Experts (MoE) has become the dominant architecture for scaling large language models: frontier models routinely decouple total parameters from per-token computation through sparse expert routing. Scaling laws show that under fixed active computation, model quality scales predictably with total parameters, and MoEs realize this by increasing expert count. However, training large MoEs is expensive, as memory requirements and inter-device communication both scale with total parameter count. We propose expert upcycling, a method for progressively expanding MoE capacity by increasing the number of experts during continued pre-training (CPT). Given a trained E-expert model, the upcycling operator constructs an mE-expert model through expert duplication and router extension while holding top-K routing fixed, preserving per-token inference cost. Duplication provides a warm initialization: the expanded model inherits the source checkpoint's learned representations, starting from a substantially lower loss than random initialization. Subsequent CPT then breaks the symmetry among duplicated experts to drive specialization. We formalize the upcycling operator and develop a theoretical framework decomposing the quality gap into a capacity term and an initialization term. We further introduce utility-based expert selection, which uses gradient-based importance scores to guide non-uniform duplication, more than tripling gap closure when CPT is limited. In our 7B-13B total parameter experiments, the upcycled model matches the fixed-size baseline on validation loss while saving 32% of GPU hours. Comprehensive ablations across model scales, activation ratios, MoE architectures, and training budgets yield a practical recipe for deploying expert upcycling, establishing it as a principled, compute-efficient alternative to training large MoE models from scratch.

MoE模型压缩持续训练效率优化

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