Skip to content
Preprint

Beyond Routing: Decoupling Expert Dispatch and Aggregation in Sparse Mixture-of-Experts

Aug 2026 · 0 citations · 10 references
Computer Science

TL;DR

A cross-architecture distinction between expert selection and expert commitment is supported betweenparse Mixture-of-Experts (MoE) routers and DeepSeek-V2-Lite, which uses Top-6 routed experts plus shared experts.

Abstract

Sparse Mixture-of-Experts (MoE) routers commonly use the same scores both to select experts and to weight their already-computed outputs. We study whether these two roles, dispatch and aggregation, should be coupled. On pretrained OLMoE-1B-7B, we keep selected Top-8 expert IDs, expert computation, and total selected router mass fixed and change only within-set aggregation. A structured oracle improves full-horizon cross-entropy by 0.0160 +/- 0.0039 across three seeds; the router's top-scored expert is the counterfactual-best vertex only 17.2% of the time, with router-utility Spearman 0.030. We therefore train Fixed-Dispatch Adaptive Aggregation (FDAA), a 301K-parameter post-compute head optimized directly with the language-modeling objective while freezing the backbone, router, and experts. On OLMoE, FDAA improves fresh WikiText-103 test by Delta CE = -0.1523 +/- 0.0031 across three seeds, and mixed-domain training gives robust gains on WikiText-103, C4, and held-out Penn Treebank under frozen confirmatory evaluation. We also replicate the fixed-dispatch audit on DeepSeek-V2-Lite, which uses Top-6 routed experts plus shared experts. Best-vertex headroom remains significant on WikiText and C4, while router Top1 identifies the best selected expert in only 12.5% and 16.7% of audited examples. In a one-seed mixed-domain replication, FDAA improves locked WikiText and PTB, while C4 is statistically neutral. These results support a cross-architecture distinction between expert selection and expert commitment.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

A Persistent State for Auditable Mixture-of-Experts Routing

Mixture-of-Experts (MoE) models repeatedly route tokens to sparse subsets of experts, but conventional routers expose no routing-specific record of how cross-layer influences accumulate. We introduce Scratchpad-Augmented Mixture-of-Experts (SA-MoE), which gives each router access to a low-dimensional persistent state t...

Abdurrahman Javat, A. Kazakov · 0 citations
Open access Sep 2026

CARE-MoE: Conflict-Aware Routing-Guided Expert Mixture-of-Experts for Continual Learning

Continual learning (CL) aims to learn new tasks sequentially while retaining prior knowledge. Although recent mixture-of-experts (MoE) architectures mitigate catastrophic forgetting by reducing global parameter sharing, they introduce a new bottleneck: expert-level interference. Because multiple tasks inevitably share...

SeonGyoung Lee, DaeHo Kim, SoYeop Yoo et al. · 0 citations
Preprint Aug 2026

UniMoMo: Expert Merging-Based MoE Acceleration for Large Recommendation Models

UniMoMo, a post-training compression framework formulated as a constrained graph coarsening problem, is introduced, and a layer-adaptive protection mechanism that restricts the merging of high-traffic experts based on their routing exposure is introduced.

Lei Xin, Bin Gu, Peize Li et al. · 3 citations
#artificial intelligence Preprint Sep 2026

When Load-Balancing Goes Too Far: Expert Pruning in Over-Dispersed Mixture-of-Experts Models

The results indicate that over-dispersed routing is a qualitatively distinct pruning regime in which standard assumptions fail, and that recognizing it is a prerequisite for principled expert pruning of load-balanced MoE models.

Berkcan Kapusuzoglu, Connor Pryor, Sangwoo Cho et al. · 0 citations
#machine learning Preprint Sep 2026

Score the Update, Not the Token: Descent-Aligned Routing for Combinatorial LoRA Experts

Mixture-of-LoRA-experts methods raise the capacity of low-rank adaptation by routing each token to a few low-rank experts. Nearly all of them tie one input-side factor to one output-side factor per expert, and nearly all of them route by scoring the token: the router picks experts without seeing what any of them would...

Priya Nair, Lukas Brenner, Maya Lindqvist et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.