Scaling Laws for Upcycling Mixture-of-Experts Language Models

Seng Pei Liew, Takuya Kato, Sho Takase
2/14/2026

No official code found. Best implementation: sbintuitions/sparse-upcycling-scaling-laws (10 stars, Apache-2.0, last commit 2025-05-16).

Abstract

Pretraining large language models (LLMs) is resource-intensive, often requiring months of training time even with high-end GPU clusters. There are two approaches of mitigating such computational demands: reusing smaller models to train larger ones (upcycling), and training computationally efficient models like mixture-of-experts (MoE). In this paper, we study the upcycling of LLMs to MoE models, of which the scaling behavior remains underexplored. Through extensive experiments, we identify empirical scaling laws that describe how performance depends on dataset size and model configuration. Particularly, we show that, while scaling these factors improves performance, there is a novel interaction term between the dense and upcycled training dataset that limits the efficiency of upcycling at large computational budgets. Based on these findings, we provide guidance to scale upcycling, and establish conditions under which upcycling outperforms from-scratch trainings within budget constraints.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

[ICML 2025] Scaling Laws for Upcycling Mixture-of-Experts Language Models

100Jupyter NotebookMay 13, 20251 years agoApache-2.0

Similar Papers

Cite this paper

@article{liew2026scaling,
  title  = {Scaling Laws for Upcycling Mixture-of-Experts Language Models},
  author = {Seng Pei Liew and Takuya Kato and Sho Takase},
  year   = {2026},
  eprint = {2502.03009},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2502.03009},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.03009.svg)](https://codeofpaper.com/paper/2502.03009)

Discussion