Mixture of Lookup Experts

Shibo Jie, Yehui Tang, Kai Han, Yitong Li, Duyu Tang +2 more
2/14/2026

No official code found. Best implementation: JieShibo/MoLE (75 stars, MIT, last commit 2025-12-03).

Abstract

Mixture-of-Experts (MoE) activates only a subset of experts during inference, allowing the model to maintain low inference FLOPs and latency even as the parameter count scales up. However, since MoE dynamically selects the experts, all the experts need to be loaded into VRAM. Their large parameter size still limits deployment, and offloading, which load experts into VRAM only when needed, significantly increase inference latency. To address this, we propose Mixture of Lookup Experts (MoLE), a new MoE architecture that is efficient in both communication and VRAM usage. In MoLE, the experts are Feed-Forward Networks (FFNs) during training, taking the output of the embedding layer as input. Before inference, these experts can be re-parameterized as lookup tables (LUTs) that retrieves expert outputs based on input ids, and offloaded to storage devices. Therefore, we do not need to perform expert computations during inference. Instead, we directly retrieve the expert's computation results based on input ids and load them into VRAM, and thus the resulting communication overhead is negligible. Experiments show that, with the same FLOPs and VRAM usage, MoLE achieves inference speeds comparable to dense models and significantly faster than MoE with experts offloading, while maintaining performance on par with MoE.

View on arXivView PDF

Code Implementations(1)

JieShibo/MoLECommunity100%
MIT

[ICML 2025 Oral] Mixture of Lookup Experts

752C, C++Mar 17, 202510 months agoMIT

Similar Papers

Cite this paper

@article{jie2026mixture,
  title  = {Mixture of Lookup Experts},
  author = {Shibo Jie and Yehui Tang and Kai Han and Yitong Li and Duyu Tang and Zhi-Hong Deng and Yunhe Wang},
  year   = {2026},
  eprint = {2503.15798},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2503.15798},
  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/2503.15798.svg)](https://codeofpaper.com/paper/2503.15798)

Discussion