Pith. sign in

REVIEW 1 cited by

Lifelong Knowledge Editing requires Better Regularization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.01636 v2 pith:SRP4RZDA submitted 2025-02-03 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords editingregularizationdegradationknowledgemethodsmodellifelonglocate-then-edit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Knowledge editing is a promising way to improve factuality in large language models, but recent studies have shown significant model degradation during sequential editing. In this paper, we formalize the popular locate-then-edit methods as a two-step fine-tuning process, allowing us to precisely identify the root cause of this degradation. We show that model degradation occurs due to (1) over-optimization of internal activations and (2) continuous norm-growth of edited matrices. To mitigate these issues, we introduce two regularization techniques: (1) Most-Probable Early Stopping (MPES) and (2) explicit Frobenius norm-constraint. We demonstrate that applying these simple yet effective regularization techniques at key points in the editing process can substantially mitigate model degradation. Combining these regularization methods enables scaling locate-then-edit methods to 10,000 edits while reducing editing time by 42-61%. These results show that targeted regularization is essential for lifelong knowledge editing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Knowledge Editing via Minimal Precomputation

    cs.CL 2025-06 conditional novelty 6.0 of 10

    Precomputing only a few thousand hidden vectors instead of 44 million is enough for MEMIT, ROME, and EMMET editing to match full-precomputation scores on CounterFact.

Pith tools