Self-Routing: Parameter-Free Expert Routing from Hidden States
On the map: Mixture-of-experts → Expert routing strategies
Abstract (arXiv)
Mixture-of-Experts (MoE) layers increase model capacity by activating only a small subset of experts per token, and typically rely on a learned router to map hidden states to expert assignments. In this work, we ask whether a dedicated learned router is strictly necessary for MoE routing. We propose Self-Routing, a parameter-free routing mechanism that uses a designated subspace of the token hidden state directly as expert logits, eliminating the router projection entirely while leaving the rest of the MoE layer unchanged. We evaluate Self-Routing on language modeling across different expert counts and model scales, and on ImageNet-1K classification by comparing it against a standard learned router, random-routing baselines, and dense non-MoE baselines. Our results show that Self-Routing remains competitive with the learned-router baseline while removing all dedicated routing parameters, and yields more balanced expert utilization, with about 17% higher average normalized routing entropy and no explicit load-balancing loss. On ImageNet-1K with DeiT-S/16, Self-Routing also slightly improves over the corresponding learned-router MoE. These findings suggest that effective MoE routing can emerge from the hidden representation itself without requiring a separate learned router module.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 18 of its 26 references that are in the map. First posted on arXiv 1 Apr 2026.
Builds on
18 of 26 references.
Closest ancestors · 4
Same direction, newest first
- 2024Towards an empirical understanding of MoE design choices20 Feb
- 2023Sparse MoE as the New Dropout: Scaling Dense and Self-Slimmable Transformers2 Mar
- 2022Mixture-of-Experts with Expert Choice Routing18 Feb
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan
Other references · 14
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2024Mixtral of Expertscited by 1,785
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 391
- 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 315
- 2023From Sparse to Soft Mixtures of Expertscited by 245
- 2021Hash Layers For Large Sparse Modelscited by 236
2 more
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2024Routers in Vision Mixture of Experts: An Empirical Study
- 2026MoE Routing Testbed: Studying Expert Specialization and Routing Behavior at Small Scale
- 2026Path-Constrained Mixture-of-Experts
- 2026L2R: Low-Rank and Lipschitz-Controlled Routing for Mixture-of-Experts
- 2026Equifinality in Mixture of Experts: Routing Topology Does Not Determine Language Modeling Quality
- 2026Mixture of Experts for Low-Resource LLMs
- 2025Selective Sinkhorn Routing for Improved Sparse Mixture of Experts
- 2026HERO-MoE: Historical Expert Routing with Scale-Preserving Fusion