mlsanityData to 7 Oct 2026

When Model Merging Breaks Routing: Training-Free Calibration for MoE

arXiv 2606.03391 ↗First posted 2 Jun 2026cs.LG cs.AI cs.CLcited by 1

On the map: Mixture-of-experts → Expert routing strategies

Abstract (arXiv)

Model merging has emerged as a cost-effective approach for consolidating the capabilities of multiple LLMs without retraining. However, existing merging techniques, largely based on linear parameter arithmetic or optimization, struggle when applied to Mixture-of-Experts (MoE) architectures. We identify a critical failure mode in MoE merging, termed routing breakdown, in which the merged router fails to dispatch tokens to suitable experts. Routing breakdown stems from the sensitivity of the non-linear softmax and discrete Top-k routing mechanisms to parameter perturbations from merging, a sensitivity further amplified by load-balancing constraints imposed during MoE pretraining. Because fine-tuned experts exhibit distinct specializations, even modest misrouting can cause severe performance degradation. To address this issue, we propose Hessian-Aware Router Calibration (HARC), a training-free framework that leverages second-order curvature information to realign the merged router. This approach admits a closed-form solution that can be efficiently solved using a matrix-free conjugate gradient method. Experiments on mathematical reasoning and code generation tasks show that HARC effectively mitigates routing breakdown across diverse MoE merging baselines and leads to substantial performance improvements. Our code is available at https://github.com/huangcb01/HARC.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 15 of its 29 references that are in the map. First posted on arXiv 2 Jun 2026.

Builds on

15 of 29 references.

References · 15

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2025Qwen3 Technical Reportcited by 8,195
  3. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
  4. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  5. 2024OLMoE: Open Mixture-of-Experts Language Modelscited by 291
  6. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
  7. 2024OpenMathInstruct-2: Accelerating AI for Math with Massive Open-Source Instruction Datacited by 194
  8. 2024DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Samplingcited by 77
  9. 2025Whoever Started the Interference Should End It: Guiding Data-Free Model Merging via Task Vectorscited by 59
  10. 2024FuseChat: Knowledge Fusion of Chat Modelscited by 53
  11. 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
  12. 2025Activation-Informed Merging of Large Language Modelscited by 29
3 more
  1. 2024Multi-Task Model Merging via Adaptive Weight Disentanglementcited by 22
  2. 2025Step-KTO: Optimizing Mathematical Reasoning through Stepwise Binary Feedbackcited by 22
  3. 2025Leveraging Submodule Linearity Enhances Task Arithmetic Performance in LLMscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compression
  2. 2026Routing-Free Mixture-of-Experts
  3. 2024Auxiliary-Loss-Free Load Balancing Strategy for Mixture-of-Experts
  4. 2024Read-ME: Refactorizing LLMs as Router-Decoupled Mixture of Experts with System Co-Design
  5. 2026Router Prior Bias: Preserving Base Routing Structure in MoE Post-Training
  6. 2026Redesign Mixture-of-Experts Routers with Manifold Power Iteration
  7. 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation
  8. 2026MoE Routing Testbed: Studying Expert Specialization and Routing Behavior at Small Scale