Interference and Retention in Continual Learning
arXiv:2607.09202
2026
Optimization
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper gives a precise quadratic notion of forgetting in the frozen-feature regime: the loss increase on an old task is exactly the old task's feature-covariance energy of the parameter displacement. This reveals why isotropic parameter penalties are inefficient: movement in directions outside the old task's covariance support is harmless, whereas movement along high-variance directions causes large interference. The most direct neural-network transfer is a covariance-aware trust-region optimizer for linear heads, adapters, or LoRA parameters that limits old-task interference without replay or Fisher estimation. It should preserve more plasticity than unconditional gradient projection while maintaining comparable retention.
Ideas from this paper
✗ Failed on benchmark
2026
Replace isotropic parameter penalties and diagonal Fisher estimates with a task-covariance interference budget. The update is damped only in directions where old-task features have large variance, while directions absent from old-task feature support remain available for learning the new task. This may preserve old-task performance with less loss of plasticity than unconditional projection.
Useful7/10
Difficulty5/10
Novelty6/10