Source-Free Class Relearning: Diagnosing Forgetting in Class Unlearning
cs.LG, cs.CV
Submitted: 2026-09-02
Updated: 2026-09-02
Code: https://github.com/Yasaman-dt/SFRA
License: http://creativecommons.org/licenses/by/4.0/
The gist: Class unlearning aims to remove a model's ability to recognize designated forget classes while preserving performance on retain classes.
Terminology
Abstract
Class unlearning aims to remove a model's ability to recognize designated forget classes while preserving performance on retain classes. However, low forget accuracy after unlearning does not necessarily mean the class structure has been erased. Approximate unlearning methods can alter classifier decision boundaries while leaving recoverable structure in the representation. Prior work has shown that forget classes can be recovered, but existing approaches require real forget or retain samples, auxiliary data, or reference checkpoints. We study class relearning in a strictly source-free setting, asking whether a forget class can be recovered through a classifier-head update using only the unlearned model. Our approach rests on a theoretical analysis establishing a sufficient alignment condition under which a single gradient step on a synthetic probe set increases the expected logit margin of the forget class. Building on this, we propose a white-box Source-Free Relearning Audit (SFRA), which generates candidate embeddings in representation space and uses model-guided confidence filtering to construct high-confidence retain probes and low-confidence boundary-adjacent probes that are relabelled as the forget class. Gaussian sampling and Softmax confidence are used by default, while ablations with alternative proposal distributions and uncertainty criteria show that recoverability is not specific to these choices. To quantify recoverability, we introduce the Relearning Score (RS), which jointly measures forget-class recovery and retain-accuracy preservation, and report class-matched Δ RS relative to a retrained reference. Experiments on CIFAR-10, CIFAR-100, and TinyImageNet with ResNet-18, ViT-B/16, and Swin-T show that several unlearning methods exhibit substantial source-free recoverability, and that for a subset of methods this recoverability exceeds the matched retrained reference.
Sources
- RULER: Representation-Level Verification of Machine Unlearning
- Do Unlearning Methods Remove Information from Language Model Weights?
- Revisiting Privacy Leakage in Machine Unlearning: Membership Inference Beyond the Forgotten Set
- Erase at the Core: Representation Unlearning for Machine Unlearning
- LoRA Fine-tuning Efficiently Undoes Safety Training in Llama 2-Chat 70B
- Eight Methods to Evaluate Robust Unlearning in LLMs
- Selective Forgetting of Deep Networks at a Finer Level than Samples
- UnUnlearning: Unlearning is not sufficient for content regulation in advanced generative AI
- Are we making progress in unlearning? Findings from the first NeurIPS unlearning competition
- Do Vision Models Truly Forget? New Findings from Representation-Level Certification of Visual Unlearning in Vertical Federated Learning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks