mlsanityData to 14 Oct 2026

HyperPatch: Sequential Knowledge Editing Under n-ary Structural Drift

arXiv 2606.03179 ↗First posted 2 Jun 2026cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 2 Jun 2026.

Builds on

22 of 41 references.

References · 22

  1. 2017Graph Attention Networkscited by 8,923
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  4. 2024From Local to Global: A Graph RAG Approach to Query-Focused Summarizationcited by 1,453
  5. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  6. 2022Mass-Editing Memory in a Transformercited by 1,001
  7. 2018Hypergraph Neural Networkscited by 488
  8. 2024The Faiss librarycited by 376
  9. 2023Editing Large Language Models: Problems, Methods, and Opportunitiescited by 372
  10. 2023MQuAKE: Assessing Knowledge Editing in Language Models via Multi-Hop Questionscited by 300
  11. 2020Document-Level Relation Extraction with Adaptive Thresholding and Localized Context Poolingcited by 115
  12. 2019Compositional Questions Do Not Necessitate Multi-hop Reasoningcited by 88
10 more
  1. 2023Memory Augmented Large Language Models are Computationally Universalcited by 47
  2. 2023PokeMQA: Programmable knowledge editing for Multi-hop Question Answeringcited by 23
  3. 2024GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learningcited by 21
  4. 2025Question Decomposition for Retrieval-Augmented Generationcited by 11
  5. 2024Knowledge Editing with Dynamic Knowledge Graphs for Multi-Hop Question Answeringcited by 10
  6. 2025Tailoring Table Retrieval from a Field-aware Hybrid Matching Perspectivecited by 7
  7. 2025Is Model Editing Built on Sand? Revealing Its Illusory Success and Fragile Foundationcited by 7
  8. 2025Decoupling Spatio-Temporal Prediction: When Lightweight Large Models Meet Adaptive Hypergraphscited by 4
  9. 2026Are We Evaluating the Edit Locality of LLM Model Editing Properly?cited by 4
  10. 2024Modeling Edge-Specific Node Features through Co-Representation Neural Hypergraph Diffusioncited by 2

Built on by

Not cited yet.