Robust Knowledge Editing via Explicit Reasoning Chains for Distractor-Resilient Multi-Hop QA

Yuchen Wu, Liang Ding, Li Shen, Dacheng Tao
9/1/2025
cs.CL

No official code found. Best implementation: YukinoshitaKaren/Reason-KE (3 stars, Apache-2.0, last commit 2026-01-23).

Abstract

Large language models (LLMs) encode vast amounts of world knowledge but remain static once trained, making the timely integration of emerging facts prohibitively expensive via full retraining. Knowledge-editing techniques have thus emerged to inject or overwrite specific facts into LLMs, yet they either over-rely on superficial cues or incur complex, iterative pipelines that collapse under noisy, multi-hop conditions. We introduce Reason-KE, an end-to-end reasoning-chain-based editing framework that steers a pretrained LLM through four structured stages-fact acknowledgment, relevance determination, selective application, and final reasoning-to filter distractors in a single pass. Trained on MQuAKE-CF with up to four irrelevant facts, Reason-KE elevates Qwen2.5-7B's multi-hop QA accuracy to 90.2% while suffering merely a 6.3% drop under heavy distraction and <1% when answers are leaked. Our quantitative analysis confirms Reason-KE's resilience and efficiency, establishing a new state-of-the-art for reliable LLM knowledge updates.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

[EMNLP 2025 Findings] Robust Knowledge Editing via Explicit Reasoning Chains for Distractor-Resilient Multi-Hop QA

30Jinja, ShellSep 1, 20259 months agoApache-2.0
knowledge-editingknowlegellamaqwensft

Similar Papers

Cite this paper

@article{wu2025robust,
  title  = {Robust Knowledge Editing via Explicit Reasoning Chains for Distractor-Resilient Multi-Hop QA},
  author = {Yuchen Wu and Liang Ding and Li Shen and Dacheng Tao},
  year   = {2025},
  eprint = {2509.01468},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.01468v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.01468.svg)](https://codeofpaper.com/paper/2509.01468)

Discussion