HyperPatch: Sequential Knowledge Editing Under n-ary Structural Drift
- URL: http://arxiv.org/abs/2606.03179v1
- Date: Tue, 02 Jun 2026 05:35:57 GMT
- Title: HyperPatch: Sequential Knowledge Editing Under n-ary Structural Drift
- Abstract summary: Large Language Models (LLMs) rely on Knowledge Editing (KE) to maintain temporal validity, yet real-world knowledge is inherently n-ary.<n>We demonstrate that in non-stationary environments, sequential updates to complex relations induce N-ary Structural Drift.<n>We propose HyperPatch, a parameter-preserving framework that reformulates sequential KE as a stability problem over hypergraph manifold.
- Score: 21.753671073125602
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Hierarchical Consistency Learning for Test-time Adaptation in Camouflage Perception [50.278200968044665]
Camouflaged object detection (COD) aims to localize targets that exhibit minimal perceptual differences from backgrounds through physical attributes.<n>Existing methods, constrained by the static train-then-freeze paradigm, suffer from domain rigidity and dependency annotation.<n>We propose the hierarchical consistency learning framework, which integrates test-time adaptation for dynamic representation recalibration.
arXiv Detail & Related papers (2026-05-25T09:57:46Z) - High-Dimensional Latents Should Be Diagnosed Through Phase Structure [56.362776482614976]
We study autoencoder and variational-autoencoder latent spaces through the lens of spin-glass theory.<n>We formalize a latent-space spin-glass dictionary for a fixed decoder.<n>We show that driving the latent system toward the edge-of-stability of the topological trivialization regime has concrete downstream consequences.
arXiv Detail & Related papers (2026-05-23T06:17:23Z) - scHelix: Asymmetric Dual-Stream Integration via Explicit Gene-Level Disentanglement [84.88065404629079]
scHelix is a dataset-adaptive framework that fundamentally changes how features are processed.<n> scHelix utilizes a dual-stream sparse diffusion encoder equipped with stop-gradient graph caching.<n> scHelix outperforms state-of-the-art methods.
arXiv Detail & Related papers (2026-05-18T15:55:13Z) - Improving Spatio-Temporal Residual Error Propagation by Mitigating Over-Squashing [4.62541204592513]
We introduce Teger, a structured uncertainty module that overcomes the spa- tial and temporal limitations of error-related autoregressive forecasting.<n>Teger is backbone-agnostic, requiring only the latent state produced by any autoregressive encoder.
arXiv Detail & Related papers (2026-05-18T08:51:33Z) - DOC-GS: Dual-Domain Observation and Calibration for Reliable Sparse-View Gaussian Splatting [80.43237927269575]
In this paper, we revisit sparse-view 3DGS reconstruction from a new perspective.<n>We identify the core challenge as the unobservability of Gaussian primitive reliability.<n>Motivated by this observation, we propose a unified Dual-domain Observation and geometrics in rendered images framework.
arXiv Detail & Related papers (2026-04-08T07:01:24Z) - A Systematic Empirical Study of Grokking: Depth, Architecture, Activation, and Regularization [0.0]
Grokking the delayed transition from memorization to generalization in neural networks remains poorly understood.<n>We present a controlled study that systematically disentangles factors on modular addition (mod 97)<n>Our central finding is that grokking dynamics are not primarily determined by architecture, but by interactions between stability and regularization.
arXiv Detail & Related papers (2026-03-26T04:16:01Z) - JPmHC Dynamical Isometry via Orthogonal Hyper-Connections [2.4311915994390403]
JPmHC is a framework that replaces identity skips with a trainable linear mixer acting on n parallel streams.<n>It prevents gradient pathologies and enhances stability.<n>It achieves faster convergence, higher accuracy, and lower computational cost compared to bistochastic baselines.
arXiv Detail & Related papers (2026-02-20T16:06:01Z) - GHS-TDA: A Synergistic Reasoning Framework Integrating Global Hypothesis Space with Topological Data Analysis [27.271992201673083]
Chain-of-Thought (CoT) has been shown to significantly improve the reasoning accuracy of large language models (LLMs)<n>Existing CoT methods suffer from two fundamental limitations.
arXiv Detail & Related papers (2026-02-10T14:00:30Z) - CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs [53.199517625701475]
CoG is a training-free framework inspired by Dual-Process Theory that mimics the interplay between intuition and deliberation.<n>CoG significantly outperforms state-of-the-art approaches in both accuracy and efficiency.
arXiv Detail & Related papers (2026-01-16T07:27:40Z) - T3former: Temporal Graph Classification with Topological Machine Learning [4.4924444466378555]
Temporal graph classification plays a critical role in applications such as cybersecurity, brain connectivity analysis, and traffic monitoring.<n>We introduce T3former, a novel Topological Temporal Transformer that leverages sliding-window topological and spectral descriptors as first-class tokens, integrated via a specialized Descriptor-Attention mechanism.<n>T3former achieves state-of-the-art performance across multiple benchmarks, including dynamic social networks, brain functional connectivity datasets, and traffic networks.
arXiv Detail & Related papers (2025-10-15T17:46:32Z) - Flow-Matching Guided Deep Unfolding for Hyperspectral Image Reconstruction [53.26903617819014]
Flow-Matching-guided Unfolding network (FMU) is first to integrate flow matching into HSI reconstruction.<n>To further strengthen the learned dynamics, we introduce a mean velocity loss.<n>Experiments on both simulated and real datasets show that FMU significantly outperforms existing approaches in reconstruction quality.
arXiv Detail & Related papers (2025-10-02T11:32:00Z) - Energy-Regularized Sequential Model Editing on Hyperspheres [59.47007547581175]
Large language models (LLMs) require constant updates to remain aligned with evolving real-world knowledge.<n> sequential editing often destabilizes representations and induces catastrophic forgetting.<n>We propose SPHERE (Sparse Projection for Hyperspherical Energy-Regularized Editing), an HE-driven regularization strategy that stabilizes neuron weight distributions.
arXiv Detail & Related papers (2025-10-01T17:55:43Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.