OpenMoE: An Early Effort on Open Mixture-of-Experts Language Models
Paper · 2024 · Fuzhao Xue, Zian Zheng, Yao Fu et al.
Summary
Before this work, few open Mixture-of-Experts (MoE) language models had been trained on trillion-scale, diverse data, and little was known about how their routers actually behave. The authors built and publicly released OpenMoE, a family of decoder-only MoE models with 650M to 34B parameters. The architecture follows ST-MoE and uses top-2 routing, a residual FFN alongside the experts, and MoE blocks placed only every few layers. The models were pre-trained on a code-heavy mix of RedPajama and The Stack Dedup, using the UL2 objective and the umT5 tokenizer. OpenMoE-8B/32E performs on par with dense OpenLLaMA-3B and TinyLLaMA-1.1B, which cost more to train, supporting the cost-efficiency argument for MoE. The analysis of routing found three patterns. Experts specialize by token ID rather than context. Routing becomes fixed early in training. Tokens late in a sequence are dropped more often, which hurts multi-turn chat. The authors openly describe their own mistakes and suggest remedies, making this a practical guide for future open MoE work.
Key points
- Released models: OpenMoE-Base/16E (0.65B), OpenMoE-8B/32E (about 2B active parameters, trained on >1T tokens), OpenMoE-8B/32E-Chat, and OpenMoE-34B/32E (6B active, 200B tokens).
- Fine-tuning and checkpoints: the Chat model was tuned on a 100K subset of WildChat and clearly beats the dense baselines on single-turn MT-Bench. Five intermediate checkpoints are also released, spaced 200B tokens apart.
- Code share: code made up as much as 52.25% of early pre-training data, which the authors now consider excessive. They recommend roughly 30%, the share used for OpenMoE-34B/32E.
- Tokenizer: the 256K-vocabulary umT5 tokenizer is far more compact than the LLaMA tokenizer on multilingual TED text (Arabic needs only ~0.34× as many tokens). However, it gives no savings on code.
- Proposed fixes:
- Drop the trainable router after warmup.
- Use parallel Transformer layers.
- Overlap attention computation with all-to-all communication.
- Mix instruction data into pre-training warmup so that load balancing also holds for chat-style inputs.
Institutions
📚 Shelves 5 Computer Science · 9,086 works Artificial Intelligence · 8,889 works Arts and Humanities · 9,296 works Language and Linguistics · 9,206 works Computer Vision and Pattern Recognition · 1,282 works
🧭 Topics 1 Language models & pretraining · 1,343 works
Cite
Cite as Fuzhao Xue, Zian Zheng, Yao Fu, Jinjie Ni, Zangwei Zheng, Wangchunshu Zhou and Yang You. 2024. OpenMoE: An Early Effort on Open Mixture-of-Experts Language Models. arXiv:2402.01739.
@misc{xue2024openmoe,
title = {{OpenMoE: An Early Effort on Open Mixture-of-Experts Language Models}},
author = {Fuzhao Xue, Zian Zheng, Yao Fu, Jinjie Ni, Zangwei Zheng, Wangchunshu Zhou and Yang You},
year = {2024},
doi = {10.48550/arxiv.2402.01739},
eprint = {2402.01739},
archivePrefix = {arXiv},
url = {https://doi.org/10.48550/arxiv.2402.01739}
}References
- R. Anil et al., “Palm 2 technical report,” arXiv preprint arXiv:2305.10403, 2023. Anonymous, “(inthe)wildchat: 570k chatGPT interaction logs in the wild,” in The Twelfth International Conference on Learning Representations, 2024. [Online]. Available: https://openreview.net/forum?id=Bl8u7ZRlbM. M. A… ↗ our card
- M. Joshi, E. Choi, D. Weld, and L. Zettlemoyer, “TriviaQA: A large scale distantly supervised challenge dataset for reading comprehension,” in Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), R. Barzilay and M.-Y. Kan, Eds., Vancouver,… our card
- J. D. M.-W. C. Kenton and L. K. Toutanova, “Bert: Pre-training of deep bidirectional transformers for language understanding,” in Proceedings of naacL-HLT, vol. 1, 2019, p. 2. our card
- D. Kocetkov et al., “The stack: 3 tb of permissively licensed source code,” Preprint, 2022. find
- A. Komatsuzaki et al., “Sparse upcycling: Training mixture-of-experts from dense checkpoints,” in The Eleventh International Conference on Learning Representations, 2023. [Online]. Available: https://openreview.net/forum?id=T5nUQDrM4u. ↗
- D. Lepikhin et al., “Gshard: Scaling giant models with conditional computation and automatic sharding,” arXiv preprint arXiv:2006.16668, 2020. find
- M. Lewis, S. Bhosale, T. Dettmers, N. Goyal, and L. Zettlemoyer, “Base layers: Simplifying training of large, sparse models,” in International Conference on Machine Learning, PMLR, 2021, pp. 6265–6274. find
- J. Li, Z. Zhang, and H. Zhao, “Self-prompting large language models for open-domain qa,” arXiv preprint arXiv:2212.08635, 2022. — [arXiv:2212.08635](https://arxiv.org/abs/2212.08635) find
- R. Li et al., “Starcoder: May the source be with you!” arXiv preprint arXiv:2305.06161, 2023. find
- Y. Liu et al., “Roberta: A robustly optimized bert pretraining approach,” arXiv preprint arXiv:1907.11692, 2019. find
- Y. Lou, F. Xue, Z. Zheng, and Y. You, “Cross-token modeling with conditional computation,” arXiv preprint arXiv:2109.02008, 2021. — [arXiv:2109.02008](https://arxiv.org/abs/2109.02008) find
- B. Mustafa, C. Riquelme, J. Puigcerver, R. Jenatton, and N. Houlsby, “Multimodal contrastive learning with limoe: The language-image mixture of experts,” Advances in Neural Information Processing Systems, vol. 35, pp. 9564–9576, 2022. find
- E. Nijkamp et al., “Xgen-7b technical report,” arXiv preprint arXiv:2309.03450, 2023. — [arXiv:2309.03450](https://arxiv.org/abs/2309.03450) find
- J. Puigcerver, C. Riquelme, B. Mustafa, and N. Houlsby, “From sparse to soft mixtures of experts,” arXiv preprint arXiv:2308.00951, 2023. — [arXiv:2308.00951](https://arxiv.org/abs/2308.00951) find
- J. W. Rae et al., “Scaling language models: Methods, analysis & insights from training gopher,” arXiv preprint arXiv:2112.11446, 2021. find
- C. Raffel et al., “Exploring the limits of transfer learning with a unified text-to-text transformer,” Journal of Machine Learning Research, vol. 21, no. 140, pp. 1–67, 2020. [Online]. Available: http://jmlr.org/papers/v21/20-074.html. ↗ our card
- C. Riquelme et al., “Scaling vision with sparse mixture of experts,” Advances in Neural Information Processing Systems, vol. 34, pp. 8583–8595, 2021. find
- S. Roller, S. Sukhbaatar, J. Weston, et al., “Hash layers for large sparse models,” Advances in Neural Information Processing Systems, vol. 34, pp. 17 555–17 566, 2021. find
- B. Roziere et al., “Code llama: Open foundation models for code,” arXiv preprint arXiv:2308.12950, 2023. our card
- N. Shazeer, “Glu variants improve transformer,” arXiv preprint arXiv:2002.05202, 2020. find
- N. Shazeer et al., “Outrageously large neural networks: The sparsely-gated mixture-of-experts layer,” arXiv preprint arXiv:1701.06538, 2017. find
- M. Shoeybi, M. Patwary, R. Puri, P. LeGresley, J. Casper, and B. Catanzaro, “Megatron-lm: Training multi-billion parameter language models using model parallelism,” arXiv preprint arXiv:1909.08053, 2019. find
- L. Soldaini et al., “Dolma: An Open Corpus of Three Trillion Tokens for Language Model Pretraining Research,” arXiv preprint, 2023. find
- J. Su, M. Ahmed, Y. Lu, S. Pan, W. Bo, and Y. Liu, “Roformer: Enhanced transformer with rotary position embedding,” Neurocomputing, vol. 568, p. 127 063, 2024. our card
- Y. Tay et al., “Ul2: Unifying language learning paradigms,” in The Eleventh International Conference on Learning Representations, 2022. our card
- Y. Tay et al., “Unifying language learning paradigms,” arXiv preprint arXiv:2205.05131, 2022. our card
- L.-M. Team, Llama-moe: Building mixture-of-experts from llama with continual pre-training, Dec. 2023. [Online]. Available: https://github.com/pjlab-sys4nlp/llama-moe. ↗ our card
- H. Touvron et al., “Llama: Open and efficient foundation language models,” arXiv preprint arXiv:2302.13971, 2023. our card
- B. Wang and A. Komatsuzaki, GPT-J-6B: A 6 Billion Parameter Autoregressive Language Model, https://github.com/kingoflolz/mesh-transformer-jax, May 2021. ↗
- G. Wenzek et al., “CCNet: Extracting high quality monolingual datasets from web crawl data,” English, in Proceedings of the Twelfth Language Resources and Evaluation Conference, N. Calzolari et al., Eds., Marseille, France: European Language Resources Association, May 2020, pp. 4003–4012, ISBN : 979… our card
- Y. Xu et al., “Gspmd: General and scalable parallelization for ml computation graphs,” arXiv preprint arXiv:2105.04663, 2021. — [arXiv:2105.04663](https://arxiv.org/abs/2105.04663) find
- F. Xue, X. He, X. Ren, Y. Lou, and Y. You, “One student knows all experts know: From sparse to dense,” arXiv preprint arXiv:2201.10890, 2022. — [arXiv:2201.10890](https://arxiv.org/abs/2201.10890) find
- F. Xue, Z. Shi, F. Wei, Y. Lou, Y. Liu, and Y. You, “Go wider instead of deeper,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, 2022, pp. 8779–8787. find
- P. Yu et al., “Efficient language modeling with sparse all-mlp,” arXiv preprint arXiv:2203.06850, 2022. — [arXiv:2203.06850](https://arxiv.org/abs/2203.06850) find
- P. Zhang, G. Zeng, T. Wang, and W. Lu, Tinyllama: An open-source small language model, 2024. arXiv: 2401.02385 [cs.CL]. our card
- Y. Zhang, B. Kang, B. Hooi, S. Yan, and J. Feng, “Deep long-tailed learning: A survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023. find
- L. Zheng et al., “Judging llm-as-a-judge with mt-bench and chatbot arena,” arXiv preprint arXiv:2306.05685, 2023. find
- Y. Zhou et al., “Brainformers: Trading simplicity for efficiency,” in International Conference on Machine Learning, PMLR, 2023, pp. 42 531–42 542. find
- Y. Zhou et al., “Mixture-of-experts with expert choice routing,” Advances in Neural Information Processing Systems, vol. 35, pp. 7103–7114, 2022. find
- B. Zoph et al., “St-moe: Designing stable and transferable sparse expert models,” URL https://arxiv.org/abs/2202.08906, 2022. ↗
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/xue-2024-openmoe-early-effort-open-mixture/