Can Mixture-of-Experts Surpass Dense LLMs Under Strictly Equal Resources?

Houyi Li, Ka Man Lo, Ziqi Wang, Zili Wang, Wenzhen Zheng +3 more
6/13/2025
cs.CLcs.AI

No official code found. Best implementation: kamanphoebe/moe-surpass-dense.github.io (0 stars, last commit 2025-06-25).

Abstract

Mixture-of-Experts (MoE) language models dramatically expand model capacity and achieve remarkable performance without increasing per-token compute. However, can MoEs surpass dense architectures under strictly equal resource constraints - that is, when the total parameter count, training compute, and data budget are identical? This question remains under-explored despite its significant practical value and potential. In this paper, we propose a novel perspective and methodological framework to study this question thoroughly. First, we comprehensively investigate the architecture of MoEs and achieve an optimal model design that maximizes the performance. Based on this, we subsequently find that an MoE model with activation rate in an optimal region is able to outperform its dense counterpart under the same total parameter, training compute and data resource. More importantly, this optimal region remains consistent across different model sizes. Although additional amount of data turns out to be a trade-off for the enhanced performance, we show that this can be resolved via reusing data. We validate our findings through extensive experiments, training nearly 200 language models at 2B scale and over 50 at 7B scale, cumulatively processing 50 trillion tokens. All models will be released publicly.

View on arXivView PDF

Code Implementations(1)

Can Mixture-of-Experts Surpass Dense LLMs Under Strictly Equal Resources?

00CSS, HTMLJun 1, 20251 years ago

Similar Papers

Cite this paper

@article{li2025mixtureofexperts,
  title  = {Can Mixture-of-Experts Surpass Dense LLMs Under Strictly Equal Resources?},
  author = {Houyi Li and Ka Man Lo and Ziqi Wang and Zili Wang and Wenzhen Zheng and Shuigeng Zhou and Xiangyu Zhang and Daxin Jiang},
  year   = {2025},
  eprint = {2506.12119},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.12119v1}
}

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/2506.12119.svg)](https://codeofpaper.com/paper/2506.12119)

Discussion