Skip to content

KLOD: Locality-Preserving Knowledge Editing via Non-Target Distribution Preservation

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

KLOD is proposed, a bounded and distribution-preserving objective for fine-tuning-based knowledge editing that separates the intended target update from distributions that should remain stable and substantially mitigates locality degradation while maintaining high edit reliability.

Abstract

Fine-tuning-based knowledge editing is simple and architecture-agnostic, but standard cross-entropy increases the edited target probability without explicitly constraining changes in the non-target output distribution. In sequential editing, such unconstrained redistribution can accumulate as distributional drift and contribute to locality degradation. We propose KLOD, a bounded and distribution-preserving objective for fine-tuning-based knowledge editing that separates the intended target update from distributions that should remain stable. KLOD stops target amplification once a probability threshold is reached, while preserving the target-excluded non-target distribution at target positions and the full next-token distribution at prefix positions. Experiments on CounterFact and ZsRE with Llama3-8B-Instruct and Qwen2.5-7B-Instruct show that KLOD substantially mitigates locality degradation while maintaining high edit reliability. The target probability threshold further provides a controllable Generalization--Locality trade-off. Ablation, multi-seed, and distributional KL analyses support the interpretation that KLOD's locality gains are associated with preserving output distributions rather than simply weakening the edit. Code is available on GitHub https://github.com/Hostoday/KLOD .

View source

Similar papers

#artificial intelligence Preprint Sep 2026

ALOE: Semantically Addressed Low-Rank Operators for Knowledge Editing

Knowledge editing changes what a model knows by modifying parameters so that a requested fact updates while unrelated behavior is preserved. This is usually treated as a write problem, but editing also involves an address problem: deciding which hidden states should receive the new residual. An update that activates to...

Zeyan Li, Hu Xu, Jian-Feng Xu · 0 citations
#machine learning Preprint Oct 2026

FedAlphaEdit: Null-Space-Aligned Merging for Collaborative Knowledge Editing

Multiple institutions may each hold their own private knowledge edits and wish to integrate them into a single large language model without sharing raw edit requests. Null-space-constrained editing methods such as AlphaEdit mathematically guarantee that each update leaves unrelated knowledge intact, while collaborative...

Sota Sugawara, Yukihiko Okada · 0 citations
Preprint Aug 2026

Local Gains and Fixed-Assignment Set Losses in Shared Set Decoders

A query-relation deletion can improve the edited slot while reducing the utility of the prediction set that contains it, and selection-conditional deletion sensitivity whose persistence depends on the readout and intervention operator is studied.

Zexi Zhang, Yang Zhang · 0 citations
#natural language process... Preprint Sep 2026

Selective Knowledge Edit Reversal via Gated Singular Vector Shrinkage

Results suggest that different edits are sparsely encoded within dominant singular components and can be separable when the number of edits is moderate, making selective spectral reversal a promising direction for locating edit-specific components and repairing edited language models.

Wei-Feng Jiang, Rui-Rui Chen, Qian-Ren Mao et al. · 0 citations
#artificial intelligence Preprint Sep 2026

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

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.

Yi-Cheng Lai, Jerry Wang, Hsin-Ling Hsu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Beyond Average Safety: Chance-Constrained LLM Fine-tuning

This work proposes a chance-constrained formulation for safety-preserving fine-tuning that limits the fraction of safety examples whose degradation relative to a reference model exceeds a prescribed threshold and develops a constraint-aware gradient descent method that treats the majorized constraint as a safe set in p...

Taha Entesari, Mahyar Fazlyab · 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.