Toward Ultra-Long-Horizon Sequential Model Editing
Mingda Liu, Zhenghan Zhu, Ze'an Miao, Katsuki Fujisawa
TL;DR
This work addresses the instability of ultra-long-horizon sequential model editing under the Locate-and-Edit framework, where repeated localized updates cause explosive growth in the edited weight norms and abrupt performance collapse. The authors provide a mechanistic analysis showing that the weight-norm evolves roughly as $E\|W_n\|^2 \approx R^n E\|W_0\|^2 + \alpha(R^n - 1)$ with $R>1$, and they prove that typical L\&E update rules can trigger this blow-up without explicit norm control. To counter this, they propose Norm-Anchor Scaling (NAS), a plug-in that rescales each edit’s target value $v^{new}$ to a fixed anchor norm $a$, yielding a stable dynamic $E\|W_n\|^2 \approx r^n E\|W_0\|^2 + \beta(1-r^n)$ with $0<r<1$. Empirically, NAS delays the collapse point by more than 4× on average and improves average editing performance by about 72% across multiple backbones (Llama3-8B, Qwen2.5-7B, GPT-J) and knowledge-editing streams (CounterFact, ZsRE), while preserving general capabilities and incurring negligible overhead. The results establish NAS as a robust, drop-in stabilization technique for lifelong knowledge updating in large language models.
Abstract
Model editing has emerged as a practical approach for mitigating factual errors and outdated knowledge in large language models (LLMs). Among existing methods, the Locate-and-Edit (L&E) paradigm is the dominant framework: it locates MLP parameters implicated in expressing a target fact, and then performs a localized update to rewrite that fact. However, long sequences of edits often trigger abrupt model collapse in L&E beyond a critical point. We empirically identify a strong correlation between collapse and explosive growth of edited MLP weight norms, and formally prove that commonly used L&E update rules can induce exponential norm growth across sequential edits in the absence of explicit norm control. To address this issue, we propose Norm-Anchor Scaling NAS, a plug-and-play norm-constrained strategy. Across extensive experiments, NAS delays the collapse point of representative L&E algorithms by more than 4 times and yields a 72.2% average relative gain in editing performance, requiring only a single additional line of code and incurring negligible computational overhead.
