MoEEdit: Efficient and Routing-Stable Knowledge Editing for Mixture-of-Experts LLMs
Yupu Gu, Rongzhe Wei, Andy Zhu, Pan Li

TL;DR
MoEEdit introduces a novel, routing-stable method for efficiently editing knowledge in sparse Mixture-of-Experts large language models, ensuring stability, specificity, and scalability.
Contribution
This work presents the first routing-stable knowledge editing framework for MoE LLMs, addressing stability and efficiency issues in existing methods.
Findings
Achieves state-of-the-art editing efficacy and generalization.
Maintains high routing stability and specificity.
Offers superior compute and memory efficiency.
Abstract
Knowledge editing (KE) enables precise modifications to factual content in large language models (LLMs). Existing KE methods are largely designed for dense architectures, limiting their applicability to the increasingly prevalent sparse Mixture-of-Experts (MoE) models that underpin modern scalable LLMs. Although MoEs offer strong efficiency and capacity scaling, naively adapting dense-model editors is both computationally costly and prone to routing distribution shifts that undermine stability and consistency. To address these challenges, we introduce MoEEdit, the first routing-stable framework for parameter-modifying knowledge editing in MoE LLMs. Our method reparameterizes expert updates via per-expert null-space projections that keep router inputs invariant and thereby suppress routing shifts. The resulting block-structured optimization is solved efficiently with a block coordinate…
Peer Reviews
Decision·ICLR 2026 Poster
- Clear identification of MoE‑specific failure modes (compute, inter‑expert coupling, routing drift) and a principled block‑structured edit formulation tailored to MoE. - Practical, scalable solver: exact per‑expert ridge updates in a randomized BCD loop over active experts; clear normal equations and complexity discussion; convincing synthetic scaling vs. a global solver. - Strong results on two MoE LLMs and two standard editing benchmarks.
- The central stabilization mechanism is a null‑space projection constructed from preservation features, which the paper itself positions as inspired by AlphaEdit’s null‑space constrained editing for dense models; the novelty is its per‑expert application in MoE and its connection to router invariance. While this is a reasonable extension, the claim to be “the first” routing‑stable framework may be too strong without comprehensive comparison to prior MoE‑specific KE or adaptor‑based lifelong edi
1. This is the first paper to properly formalize and tackle the knowledge editing problem for sparse MoE models. 2. The identification of routing distribution shift as the key failure mode for MoE editing is a novel and very important insight. 3. The proposed solution is elegant. The per-expert null-space projection directly targets the routing shift problem. 4. The BCD solver is a crucial component that makes the method practical. The paper clearly shows why a global one-shot sol
1. The analysis focuses entirely on the routing shift in _subsequent_ layers. It's unclear how the edit affects routing for _subsequent tokens_ within the _same_ edited layer. 2. The null-space projection is critical but it relies on a preservation set $K_n^0$. The paper never explains how this set is collected how big it is or how sensitive the method is to its quality. 3. The BCD solver is efficient in terms of scaling with expert count $N$ but it's still an iterative process. Figure
The paper's proposed MoEEdit effectively mitigates the routing shift problem in MoE LLMs editing while requiring only minimal computational cost. Experiments demonstrate that this method achieves better performance than other baseline methods across three metrics: Efficacy, Generalization, and Specificity.
- The paper does not explain how the v used in editing is obtained. As the output of the edited layer, v should also be one of the factors contributing to the routing shift problem, but the authors do not discuss this element. - The paper lacks detailed descriptions of the experimental setup. - The paper has some writing deficiencies, such as when the metric RS first appears in Section 4.1, it does not introduce that the full name of this metric is routing-similarity, which only appears later in
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Expert finding and Q&A systems
