2026· IEEE Transactions on Information Forensics and Security· Vol 21, pp. 7576-7589· 0 citations· 57 references
Abstract
Machine unlearning (MU) aims to remove the influence of selected data from trained models, offering an efficient alternative to full retraining. With the rise of increasingly stringent privacy regulations, including the right to be forgotten, machine learning models must incorporate mechanisms that ensure compliance while preserving performance. However, existing MU methods often suffer from performance degradation, and limited granularity, leaving residual traces that adversaries can exploit. We propose DeepU, a fine-grained unlearning framework that performs within-layer, weight-level analysis and quantifies the influence of individual weights using the signal-to-noise ratio (SNR) derived from the gradients of sensitive and non-sensitive data. DeepU categorizes weights as influential, intra-dependent, or non-influential and applies targeted weight updates: resetting or perturbing influential weights, decaying intra-dependent ones, and stabilizing the remaining ones via limited backpropagation. We evaluated DeepU on standard datasets including CIFAR-10, CIFAR-100, Tiny ImageNet, and CelebA, demonstrating a 60–90% reduction in successful membership inference attacks with less than a 3% drop in accuracy, significantly outperforming existing benchmark methods. Re-tuning requires only 20.75 seconds and 102.47 MB, making DeepU up to 36.6 times faster than competing methods. We further evaluate robustness against Generative Adversarial Network (GAN) and diffusion-based model inversion attacks across white-box, black-box, and label-only threat models, demonstrating that DeepU consistently reduces reconstruction of forgotten data.
Machine unlearning, which aims to remove the influence of specific training data from a trained model, is a key requirement for privacy, accountability, and adaptive deployment. We argue that many unlearning methods are vulnerable to a simple clustering attack, which can recover class structure in an unsupervised manner, limiting their suitability for continual deployment where removal requests must be handled reliably on demand. To address this, we propose DECAF (DE-Clustering for Adaptive Forgetting), a post-hoc method that operates only on the forget set and is designed to break the cluster. DECAF combines input noise, confidence suppression, and entropy-based output diversification to disrupt the residual feature-space structure associated with forgotten data. On CIFAR-10 with ResNet-18, DECAF attains 0.10% forget-class accuracy, 79.4% retain accuracy, and an AUS of 0.88, surpassing all other baselines. In cluster-based analysis, it attains performance comparable to that of unlearning methods that use the full training set, while being significantly more efficient. Code: https://github.com/ale256/representation_unlearning.
Anjie Le, Can Peng, Hongcheng Guo et al.· arXiv.org· 0 citations
This work proposes a novel one-shot unlearning approach, abandoning iterative optimization in favor of a direct, exact analytical solution, and achieves state-of-the-art forgetting-utility trade-offs on TOFU-5%, TOFU-10%, MUSE-Books, MUSE-News and WMDP, significantly reducing computational overhead without sacrificing overall model performance.
Paweł Batorski, P. Spurek, Paul Swoboda· 0 citations
The findings suggest that, in the studied setting, representation-level forgetting is primarily governed by gradient concentration and representation geometry rather than by the specific identity of saliency-selected weights.
Billel Habbati, A. Merlo, Luca Verderame et al.· arXiv.org· 0 citations
This work conducts a comparative empirical study of five MU methods across symmetric, asymmetric, instance-dependent, and open-set noise on CIFAR-10, CIFAR-100, and the real-world noisy dataset Food-101N and finds that the appropriate unlearning strategy is conditioned on the noise structure.
HIFN-T is presented, a framework extending the Variational Information Bottleneck through four jointly learnable per-layer parameters: information retention, entropy budget, magnitude scaling, and global information gates that generalizes standard VIB as a special case and characterize the role of the entropy budget as an early-training stabilizer that prevents variance explosion before convergence.
This paper studies what happens to the rest of the model when a class is forgotten, using a label-conditioned energy-based model (EBM) that assigns per-class energies, making the effect directly observable.
Syed Ali Ahmed, Syed Bilal Ahsan, Muhammad Zaigham Zaheer National University of Computer et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.