Forgetting is Not Erasure: Recovering Latent Knowledge via Transport Keys

Archie Chaudhury
6/1/2026
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Catastrophic forgetting is often framed as a representational problem: after sequential training, a model appears to lose the features that supported performance on earlier tasks. We challenge the stronger form of this view. Across controlled continual-learning settings, we find that a significant portion of apparent forgetting can be attributed to interface drift between internal stages rather than permanent erasure of task-relevant computation. We study this phenomenon through a stitched evaluation protocol that combines early computation from a post-update network with late computation from its predecessor, optionally mediated by a compact, task-specific transport key. We describe transport keys at a systems level as compact interface-alignment operators estimated from a small set of paired anchor activations and evaluated through model stitching. On split CIFAR-100 with a ResNet-style network, transport keys recover most of the original Task A performance after sequential training on Task B. On a compact vision transformer, we observe a similar recovery pattern. These results suggest that continual learning may require better mechanisms for indexing and re-accessing latent computations, not only methods that prevent weight change.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chaudhury2026forgetting,
  title  = {Forgetting is Not Erasure: Recovering Latent Knowledge via Transport Keys},
  author = {Archie Chaudhury},
  year   = {2026},
  eprint = {2606.02860},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.02860v1}
}

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/2606.02860.svg)](https://codeofpaper.com/paper/2606.02860)

Discussion