Skip to content

When Successful Knowledge Graph Edits Displace Correct Answers: Rank-Level Locality beyond Parameter Support

Sep 2026 · 0 citations · 22 references
Computer Science

TL;DR

A common rank-displacement audit at three scopes is introduced at three scopes: facts supported by the edited parameter, other correct answers to the target query, and correct answers across queries with the same relation.

Abstract

Editing a knowledge graph embedding (KGE) model to promote a desired answer can displace correct answers from the returned list. Locality tests based only on facts that reuse the edited parameter can miss this ranking effect. We introduce a common rank-displacement audit at three scopes: facts supported by the edited parameter, other correct answers to the target query, and correct answers across queries with the same relation. We also derive dimensional and geometric conditions for an update to improve the target while exactly preserving selected scores. On FB15k-237 with DistMult and ComplEx, direct promotion always moves the target into the top ten, but does so without damage in only 23.0--23.2\% of edits. Strict preservation causes no measured damage, yet succeeds in only 1.3--1.4\%. Support-regularized entity editing gives the highest joint success, 36.3--37.7\%, while rank-truncated preservation reaches 32.8--34.7\% and reduces the mean number of displaced answers from about 14 to 1.2. Experiments across dimensions, scorers, ranking conventions, and a learned editor show that locality depends on both the protected scope and the editing mechanism. KGE editing should therefore report correction success together with the incidence and severity of rank displacement.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

When Is Graph Structure Worth Its Cost? The Case for Structure Pricing in Retrieval-Augmented Generation

EffiRAG is presented, a graph-based RAG system designed to reduce this cost that uses the graph to locate relevant passages and generates answers from the original text, and preserves source information while keeping graph construction and query processing lightweight.

Yu-Zhong Zhang, Hao-Yang Ma, Chao Peng et al. · 0 citations
Preprint Aug 2026

Matched Excess-Outranker Regularization for Candidate-Set Interference in Continual Knowledge Graph Embedding

This work introduces Matched Excess-Outranker Regularization (MEOR), a host-level objective that compares smooth answer-relative newcomer pressure with score-blind, structurally matched old references and establishes candidate admission as a distinct source of continual rank loss.

Hao Ren, Jun-Bin Gao, Jiao-Jiao Jiang · 0 citations
Open access Aug 2026

Reliable Rule-Guided Augmentation for Knowledge Graph Completion

This method induces Horn rules from target-relation-guided random walks and assigns each candidate a reliability score that combines smoothed rule confidence, normalized support, path consistency, type validity, and redundancy.

Qing-Song Li, You Lv, Xiang-Nan Feng et al. · 0 citations
#machine learning Preprint Aug 2026

A Storage–Retrieval Gap in Parametric Knowledge Graph Memory

The results establish that parametric knowledge graph memory is feasible for storing knowledge, and identify selecting and composing the right adapters by a mechanism other than semantic similarity as the central open problem—motivating a learned, query-conditioned composition mechanism.

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov et al. · 0 citations
Preprint Aug 2026

On Scope Classification and Current Knowledge-Editing Benchmarks: A Negative Result, with INLAY as a Gradient-Free Case Study

Every memory-based knowledge editor in the SERAC lineage depends on a scope decision: given a query, does a stored edit apply? We report that current knowledge-editing benchmarks cannot measure this decision at all. Using INLAY, a gradient-free editor we built to obtain exact per-query ground truth (the model is frozen...

Aditya Singh · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.