DOW-KE backpropagates the final editing objective through the complete model, jointly optimizing the updates of all edited layers so cross-layer propagation and coupling enter every gradient step, and achieves the highest overall Score and neighborhood Specificity among the evaluated baselines.
Abstract
Multi-layer locate-then-edit methods for knowledge editing first optimize target residual-stream activations (anchors) at selected layers, then realize them layer by layer as weight updates. This pipeline optimizes an intermediate representation but deploys multi-layer weight updates whose joint effect through the true forward pass is never itself optimized: regardless of how anchors are set or propagated, each update comes from a local solve, so propagation-induced attenuation and distortion go uncorrected, leaving a closure gap between anchor targets and realized edits. We propose DOW-KE, an anchor-free method built on a single principle: what is optimized must be exactly what is deployed. DOW-KE backpropagates the final editing objective through the complete model, jointly optimizing the updates of all edited layers so cross-layer propagation and coupling enter every gradient step. The same principle dictates where preservation resides: embedding the preservation projection in the update parameterization, inside the computation graph, makes every gradient act on the deployed update; post-hoc constraints would reopen the gap, and the constrained search keeps edits clear of protected knowledge. In large-scale sequential editing on two datasets and three models, DOW-KE achieves the highest overall Score and neighborhood Specificity in five of six model-dataset settings among the evaluated baselines.
This work introduces AnchorFold, a training-free focus-then-fold framework for document-side index compression, which consistently outperforms all evaluated training-free baselines at $\gamma \leq 0.20$.
CoBind is introduced, a training-free framework for stage-aware compositional binding that parses a prompt into a composition graph of entities, attributes, and relations and adapts the guidance strength according to the current satisfaction of each constraint, reducing unnecessary latent updates.
Kaijie Chen, Ethan Caldwell, M. Vossen et al.· arXiv.org· 0 citations
A unified paradigm based on Cross-View Semantic Propagation (CVSP), a plug-and-play framework that effectively improves anchor quality and generalization capability when integrated with various existing methods is proposed.
Su-Yuan Liu, Si-Wei Wang, Ke Liang et al.· IEEE Transactions on Pattern...· 1 citation
This four-stage passage-retrieval pipeline exploits inter-document reference signals to recover multi-hop evidence chains without requiring the construction of graphs from expensive pretrained language model calls.
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.
Hojun Jeong, Gyunyeop Kim, Sangwoo Kang· 0 citations
CR-Refiner is presented, a training-free reranker that wraps any base retriever's top-K candidates with three components and consistently improves hard-subset R@1 and mAP@10 on every edit axis.
Hao Wu, Jinjin Zhu, N. Wu et al.· arXiv.org· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.