inference/research
verifiedhigh · 0.85updated 2026-10-04

Mixture-of-Experts with Expert Choice Routing

routing · neurips

Fields

id
papers/expert-choice-routing
arXiv
2202.09368
Venue
neurips
Venue track
main
Year
2022
Category
routing
Adoption
research-only
Authors
Zhou, Lepikhin, Klyushko, Dettmers, et al. (Google)
Affiliations
Google Research
Problem
Top-k gating gives every token the same number of experts regardless of how important the token is, and load imbalance leaves some experts under-trained and under-specialized.
Mechanism
INVERTS THE ROUTING DIRECTION: instead of each token selecting its top-k experts, each EXPERT selects its top-k tokens. Each expert therefore gets a FIXED BUCKET SIZE (a constant, known compute cost) while each token receives a VARIABLE number of experts - so an easy token can be handled by one expert and a hard token by eight. The fixed bucket is also what removes the load-imbalance problem that makes token-choice routing expensive to serve.
Speedup reported
Paper's own claim (abstract): systematically studied against Switch Transformer top-1 and GShard top-2 gating AT THE SAME COMPUTATIONAL RESOURCES, and improves TRAINING CONVERGENCE TIME BY MORE THAN 2x; higher performance fine-tuning 11 selected GLUE/SuperGLUE tasks at the same computational cost; and at lower activation cost it beats the T5 dense model on 7 of 11 tasks. COMPRESSION RATIO: not applicable (a routing scheme). Note the caveat that matters for serving: fixed bucket size means the dispatch buffers are static and computationally predictable, which is precisely the property token-choice routing lacks.
notes
arXiv ID 2202.09368 verified via /abs/; venue NeurIPS 2022 from Semantic Scholar; year = venue year 2022. The 2x figure is a TRAINING convergence-time claim against two named baselines at matched compute - not an inference latency claim, and the paper's own framing is about expert specialization and balance. arXiv ID and title verified by fetching https://arxiv.org/abs/2202.09368 and reading the citation_title meta tag on 2026-10-03. Venue and year from the Semantic Scholar graph API batch endpoint (paper/arXiv:2202.09368) unless the record's notes say otherwise. VENUE_TRACK BACKFILL 2026-10-04 (paper-fields pass, agent w3p): venue_track 'main'. This is STRUCTURAL rather than researched: neurips has no Findings volume and no workshop track in which a paper could appear, so 'main' is the only possible honest value and no per-paper evidence was needed. The field is annotated here so that 'findings' and 'workshop' remain MEANINGFUL - a filter for findings=true must return only the papers that actually are findings, which requires every other paper to be explicitly NOT findings.

Notes

arXiv ID 2202.09368 verified via /abs/; venue NeurIPS 2022 from Semantic Scholar; year = venue year 2022. The 2x figure is a TRAINING convergence-time claim against two named baselines at matched compute - not an inference latency claim, and the paper's own framing is about expert specialization and balance. arXiv ID and title verified by fetching https://arxiv.org/abs/2202.09368 and reading the citation_title meta tag on 2026-10-03. Venue and year from the Semantic Scholar graph API batch endpoint (paper/arXiv:2202.09368) unless the record's notes say otherwise.

VENUE_TRACK BACKFILL 2026-10-04 (paper-fields pass, agent w3p): venue_track 'main'. This is STRUCTURAL rather than researched: neurips has no Findings volume and no workshop track in which a paper could appear, so 'main' is the only possible honest value and no per-paper evidence was needed. The field is annotated here so that 'findings' and 'workshop' remain MEANINGFUL - a filter for findings=true must return only the papers that actually are findings, which requires every other paper to be explicitly NOT findings.

Cross-references

This record references no other records — it is a leaf. It is cited by 0.