It is shown that continual unlearning operations accumulate geometric constraints in parameter space, leading to saturated subspaces that restrict future updates, a critical barrier to the long-term reliability of machine unlearning systems and motivate the development of plasticity-preserving unlearning algorithms.
Abstract
Machine unlearning enables deep neural networks to selectively remove the influence of specific data in response to privacy and regulatory requirements. While prior work largely studies single-shot unlearning, real-world systems must accommodate continual unlearning, where multiple unlearning requests occur sequentially over time. In this work, we identify a fundamental limitation of this setting: plasticity collapse, a progressive breakdown in a model's ability to effectively forget. Through theoretical analysis of continual unlearning dynamics, we show that continual unlearning operations accumulate geometric constraints in parameter space, leading to saturated subspaces that restrict future updates. This structural effect induces two distinct failure modes: (1) Forward failure -- diminishing forgetting quality for subsequent tasks, and (2) Backward failure -- spontaneous re-memorization of previously forgotten information. Extensive experiments across multiple architectures, datasets, and methods in image classification confirm that plasticity collapse is not an artifact of specific implementations, but a pervasive phenomenon inherent to continual unlearning. Our findings reveal a critical barrier to the long-term reliability of machine unlearning systems and motivate the development of plasticity-preserving unlearning algorithms. Our code is available at https://github.com/TIML-Group/Continual-Machine-Unlearning-Plasticity-Collapse
Plasticity loss has emerged as a critical challenge in continual learning that significantly hinders the acquisition of sequential tasks. While optimizing activation designs offers a potential solution, current fixed-form functions suffer from an inherent spectral bias towards low-frequency variations, whereas learnabl...
Zeyang Zhang, Tie-Liang Gong, Junyan Lu et al.· 0 citations
This work proposes Gradient-Coupled Continual Backpropagation (G-CBP), which modulates layer-wise replacement rates from normalized gradient norms and constrains early turnover through an Adaptive Moving Envelope, and identifies an empirical reconstruction–perturbation relationship.
Wei-Bang Zhou, Xiang-Sheng Huang, Xiao Yang et al.· Evolutionary Systematics· 0 citations
Approximate machine unlearning seeks to remove the influence of a forget set from a trained model without full retraining. Existing gradient-based methods require data-dependent hyperparameter search, struggle when forget and retain knowledge are entangled, and offer little insight into where unlearning actually happen...
Hao-Ran Tang, Andrew Tan, Rajiv Khanna· 0 citations
A continual data unlearning framework that uses completed deletion transitions as directional references to regularize future updates and achieves a better balance between deletion persistence and generative utility than existing unlearning baselines as requests accumulate.
Sunbeom Jeong, Sehwan Kim, Sang-Woo Hong et al.· 0 citations
By repurposing Selective Gradient Masking, a suite of six 254M-parameter language models on English Wikipedia with graded levels of disentanglement between biology and non-biology knowledge are trained, it is found that more disentangled models consistently achieve better retain-forget trade-offs.
Evžen Wybitul, Tim G. J. Rudner, C. D. de Witt· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduSep 29, 2026
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.