Beyond Hard Writes and Rigid Preservation: Soft Recursive Least-Squares for Lifelong LLM Editing
Not on the map. Why?
Abstract (arXiv)
Model editing updates a pre-trained LLM with new facts or rules without retraining while preserving unrelated behavior. In real deployment, edits arrive as long streams, creating a plasticity-stability dilemma: repeated locate-then-edit "hard writes" can accumulate interference over time, while rigid preservation constraints may protect only explicitly constrained directions, allowing past edits or unconstrained behaviors to deviate. We propose RLSEdit, a recursive least-squares editor for long sequential editing. RLSEdit formulates editing as an online quadratic optimization with soft constraints, minimizing a cumulative key-value fitting objective together with two regularizers that control deviation from the pre-trained weights and from a designated anchor mapping. This objective admits an efficient Woodbury-based online recursion, with per-edit cost independent of history length and scaling only with the current edit size. We further provide deviation bounds and an asymptotic characterization of the adherence-preservation trade-off in the many-edits regime. Experiments on CounterFact and ZsRE across multiple model families show stable scaling to 10K edits, outperforming strong baselines in both edit success and holistic stability, while retaining early edits and preserving general capabilities on GLUE and held-out reasoning/code benchmarks.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 36 references that are in the map. First posted on arXiv 22 Jan 2026.
Builds on
25 of 36 references.
References · 25
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2022Mass-Editing Memory in a Transformercited by 976
- 2018Neural Network Acceptability Judgmentscited by 952
- 2021Editing Factual Knowledge in Language Modelscited by 548
13 more
- 2021Fast Model Editing at Scalecited by 491
- 2017Zero-Shot Relation Extraction via Reading Comprehensioncited by 425
- 2022Aging with GRACE: Lifelong Model Editing with Discrete Key-Value Adaptorscited by 267
- 2024AlphaEdit: Null-Space Constrained Knowledge Editing for Language Modelscited by 224
- 2020Modifying Memories in Transformer Modelscited by 222
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2024Model Editing at Scale leads to Gradual and Catastrophic Forgettingcited by 92
- 2024WISE: Rethinking the Knowledge Memory for Lifelong Model Editing of Large Language Modelscited by 90
- 2025AnyEdit: Edit Any Knowledge Encoded in Language Modelscited by 74
- 2024Lifelong Knowledge Editing for LLMs with Retrieval-Augmented Continuous Prompt Learningcited by 40
- 2024Everything is Editable: Extend Knowledge Editing to Unstructured Data in Large Language Modelscited by 18
- 2025EvoEdit: Evolving Null-space Alignment for Robust and Efficient Knowledge Editingcited by 7
- 2025Resona: Improving Context Copying in Linear Recurrence Models with Retrievalcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.