When Forgetting is not Catastrophic: On the Mechanics of Spurious Forgetting

Vedant Palit, Florent Draye, Nicolas Zucchet, Zhijing Jin, Bernhard Schölkopf
10/6/2026
cs.CLcs.LG

No official code found. Best implementation: vedantpalit/spurious-forgetting-mechanics (0 stars, last commit 2026-10-01).

Abstract

Knowledge that a language model appears to forget during finetuning often remains stored and can be recovered, a phenomenon called spurious forgetting. Finetuning on new facts can even produce forgetting that undoes itself: recall of the old facts collapses, recovers as training continues on new facts alone, and only then erodes for good. We seek to understand when such forgetting is not catastrophic. A minimal associative memory reproduces these dynamics with three ingredients: keys with shared structure, concentrated new values, and normalization in the network. Finetuning moves all old representations along a common direction, hiding the old facts while preserving their relative geometry; normalization withdraws this shift once the new facts are learned, whereas fact-specific changes accumulate and cause the erosion. Moreover, subtracting the common shift eliminates the collapse in a Transformer trained on synthetic data, and removing a single direction from each weight update restores old facts in a pretrained language model. Forgetting thus combines a shared, reversible loss of access with a slow erosion of individual facts, and only the second is catastrophic. Which one dominates depends on whether the new data move old memories together or apart.

View on arXivView PDF

Code Implementations(1)

Companion codebase for the paper "When Forgetting Is Not Catastrophic: On the Mechanics of Spurious Forgetting", Palit et al., 2026

00Sep 30, 20262 weeks ago

Similar Papers

Cite this paper

@article{palit2026when,
  title  = {When Forgetting is not Catastrophic: On the Mechanics of Spurious Forgetting},
  author = {Vedant Palit and Florent Draye and Nicolas Zucchet and Zhijing Jin and Bernhard Schölkopf},
  year   = {2026},
  eprint = {2610.08718},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.08718v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2610.08718.svg)](https://codeofpaper.com/paper/2610.08718)

Discussion