RouterInterp: Understanding Superposed Specialisation in Mixture of Experts Routing
Not on the map. Why?
Abstract (arXiv)
Sparse Mixture of Experts (MoE) models scale more efficiently than dense models by routing tokens to modular expert networks that are only active for processing a fraction of tokens. A leading hypothesis for the performance of MoE models is that each expert specialises in a single, coherent domain. However, interpretability efforts that assume this hypothesis have generally been unsuccessful. We propose and present evidence for an alternative account that we call the Superposed Specialisation Hypothesis (SSH): experts specialise in a disjoint union of fine-grained features rather than one broad domain. Leveraging the SSH, we introduce RouterInterp, a method for interpreting expert routing that identifies Sparse Autoencoder features most predictive of routing decisions and produces unified natural language explanations. On gpt-oss-20b, RouterInterp explains expert routing with ~65% higher detection accuracy than prior token statistics based methods. This work provides a scalable method for generating more accurate explanations of expert routing and increases our understanding of a previously uninterpretable component of foundation models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 94 references that are in the map. First posted on arXiv 8 Oct 2026.
Builds on
23 of 94 references.
References · 23
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2025Qwen3 Technical Reportcited by 8,195
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2024Mixtral of Expertscited by 1,785
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,258
- 2024DeepSeek-V3 Technical Reportcited by 724
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 579
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 391
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2013k-Sparse Autoencoderscited by 209
11 more
- 2025AxBench: Steering LLMs? Even Simple Baselines Outperform Sparse Autoencoderscited by 199
- 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 166
- 2022A Review of Sparse Expert Models in Deep Learningcited by 147
- 2026Do Sparse Autoencoders Capture Concept Manifolds?cited by 25
- 2025Sparse Autoencoders for Hypothesis Generationcited by 24
- 2021Clusterability in Neural Networkscited by 23
- 2024On the Complexity of Neural Computation in Superpositioncited by 21
- 2024Understanding polysemanticity in neural networks through coding theorycited by 17
- 2025Interpretable Embeddings with Sparse Autoencoders: A Data Analysis Toolkitcited by 9
- 2024The Local Interaction Basis: Identifying Computationally-Relevant and Sparsely Interacting Features in Neural Networkscited by 8
- 2025Evaluating Explanations: An Explanatory Virtues Framework for Mechanistic Interpretability -- The Strange Science Part I.iicited by 2
Built on by
Not cited yet.