Awakening Dormant Experts:Counterfactual Routing to Mitigate MoE Hallucinations
On the map: Mixture-of-experts → Expert routing strategies
Abstract (arXiv)
Sparse Mixture-of-Experts (MoE) models have achieved remarkable scalability, yet they remain vulnerable to hallucinations, particularly when processing long-tail knowledge. We identify that this fragility stems from static Top-k routing: routers tend to favor high-frequency patterns over rare factual associations. Consequently, ``specialist experts'' possessing critical long-tail knowledge are often assigned low gating scores and remain ``dormant'' -- under-prioritized for specific tokens despite their proven causal importance on other inputs. To address this, we propose Counterfactual Routing (CoR), a training-free inference framework designed to awaken these dormant experts. CoR integrates layer-wise perturbation analysis with the Counterfactual Expert Impact (CEI) metric to dynamically shift computational resources from syntax-dominant to knowledge-intensive layers while maintaining a constant total activation count, effectively retrieving causally decisive experts via virtual ablation. Extensive experiments on TruthfulQA, FACTOR, and TriviaQA demonstrate that CoR improves factual accuracy by 3.1% on average without increasing the inference budget, establishing a superior Pareto frontier compared to static scaling strategies.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 27 of its 39 references that are in the map. First posted on arXiv 15 Apr 2026.
Builds on
27 of 39 references.
Closest ancestors · 2
Same direction, newest first
- 2022Mixture-of-Experts with Expert Choice Routing18 Feb
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan
Other references · 25
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2023Inference-Time Intervention: Eliciting Truthful Answers from a Language Modelcited by 1,259
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,258
- 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,103
- 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
13 more
- 2021Documenting Large Webtext Corpora: A Case Study on the Colossal Clean Crawled Corpuscited by 481
- 2022Factuality Enhanced Language Models for Open-Ended Text Generationcited by 200
- 2023Head-to-Tail: How Knowledgeable are Large Language Models (LLMs)? A.K.A. Will LLMs Replace Knowledge Graphs?cited by 167
- 2023Generating Benchmarks for Factuality Evaluation of Language Modelscited by 103
- 2025Frequency-Aligned Knowledge Distillation for Lightweight Spatiotemporal Forecastingcited by 53
- 2025SepPrune: Structured Pruning for Efficient Deep Speech Separationcited by 31
- 2024SGLP: A Similarity Guided Fast Layer Partition Pruning for Compressing Large Deep Modelscited by 24
- 202452B to 1T: Lessons Learned via Tele-FLM Seriescited by 11
- 2024Co-occurrence is not Factual Association in Language Modelscited by 11
- 2026Distilling Time Series Foundation Models for Efficient Forecastingcited by 11
- 2025Mosaic Pruning: A Hierarchical Framework for Generalizable Pruning of Mixture-of-Experts Modelscited by 10
- 2025MR-UIE: Multi-Perspective Reasoning with Reinforcement Learning for Universal Information Extractioncited by 6
- 2025Making Every Head Count: Sparse Attention Without the Speed-Performance Trade-offcited by 6
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026When Are Experts Misrouted? Counterfactual Routing Analysis in Mixture-of-Experts Language Models
- 2026It Takes a MAESTRO To Prune Bad Experts
- 2026Expert-Aware Causal Tracing of Factual Recall in Sparse MoE Language Models
- 2026MoE Lens -- An Expert Is All You Need
- 2026Knowledge Injection Exists in MoE? Exploring Expert-Aware Contrast Decoding in MoE for Mitigating LLMs'Hallucinations
- 2026Sticky Routing: Training MoE Models for Memory-Efficient Inference
- 2026Beyond Geometric Complementarity: Coherent Overlap in Sparse Mixture-of-Experts Routing
- 2026Elbow-Based MoE Routing: A Training-Free Inference Time Plugin for Expert Selection