解决大模型知识更新中的复杂关系断裂问题,提升长期记忆准确性。
HyperPatch: Sequential Knowledge Editing Under n-ary Structural Drift

- 将知识编辑建模为超图流形上的稳定性问题,保留多主体关系完整性。
- 在两个基准上分别提升96.24%和21.06%的跳数准确率,显著优于基线。
- 适合持续更新复杂知识的场景,如动态知识库或实时推理系统。
大型语言模型依赖知识编辑(KE)保持知识时效性,但现实世界知识具有天然的多元结构。我们发现,在非平稳环境中,对复杂关系的连续更新会引发n-ary结构漂移,即把n元事件二元化为三元组会导致关系原子性破坏,进而引发结构依赖的知识传递失败,常被误判为参数幻觉。为此,我们提出HyperPatch,一种参数不变的框架,将序列知识编辑重构为超图流形上的稳定性问题。HyperPatch通过三个阶段保持事件完整性:(i) 结构先验初始化,利用超图神经网络(HGNN)进行对比学习,建立拓扑感知嵌入空间以捕捉高阶相关性;(ii) 序列拓扑编辑,采用双阶段机制,通过SimHash实现拓扑对齐快速解决冲突,并使用拓扑LoRA适配追踪漂移而无需重训练主干;(iii) 结构条件推理,融合语言与结构流形的全局一致证据。在MQuAKE-CF和MQuAKE-T基准上,HyperPatch相对最强基线分别取得96.24%和21.06%的跳数准确率(H-Acc)提升。进一步消融实验表明,在连续n-元更新流下表现更稳定,而标准基于知识图谱的变体因结构错位导致最高达88.3%的准确率崩溃。
原文摘要 · Abstract (English)
Large Language Models (LLMs) rely on Knowledge Editing (KE) to maintain temporal validity, yet real-world knowledge is inherently n-ary. We demonstrate that in non-stationary environments, sequential updates to complex relations induce N-ary Structural Drift, a phenomenon where the binary reification of n-ary events into triples fractures relational atomicity. This precipitates Structure-Conditioned Knowledge Transfer Failure, a systematic mis-grounding of the retriever frequently misdiagnosed as parametric hallucination. To tackle this, we propose HyperPatch, a parameter-preserving framework that reformulates sequential KE as a stability problem over hypergraph manifolds. HyperPatch preserves event integrity through three phases: (i) Structural Prior Initialization, establishing a topology-aware embedding space via contrastive learning on a Hypergraph Neural Network (HGNN) to capture high-order correlations; (ii) Sequential Topology Editing, utilizing a dual-stage mechanism that employs SimHash-based Topological Alignment for rapid conflict resolution and Topological LoRA Adaptation to track drift without backbone retraining; and (iii) Structure-Conditioned Reasoning, which integrates globally consistent evidence from fused linguistic and structural manifolds. On the MQuAKE-CF and MQuAKE-T benchmarks, HyperPatch achieves relative gains in Hop-wise Accuracy (H-Acc) of 96.24% and 21.06% over the strongest baseline, respectively. Further ablations demonstrate superior reliability under continuous n-ary update streams, whereas the standard KG-based variant suffers H-Acc collapses of up to 88.3% due to structural misalignment.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。