arXiv Machine Learning By Jonas Mirlach, Sonia Laguna, Julia E. Vogt

Reference-Guided Machine Unlearning

Read the original on arXiv Machine Learning →

Reference-Guided Machine Unlearning (ReGUn) is a vision unlearning framework that prioritizes distributional indistinguishability over degradation-based heuristics. It uses disjoint held-out data to create a class-conditioned reference distribution for distillation, guiding forget samples toward non-member behavior without explicitly degrading predictions. Experiments across various architectures and datasets show that ReGUn achieves a competitive forgetting–utility trade-off and closely matches retrain-like membership inference behavior.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 28

Models Designed to Forget: Machine Unlearning via Key Deletion

The paper introduces MUNKEY, a memory‑augmented transformer that enables machine unlearning by design. By decoupling instance‑specific memorization from model weights, unlearning is achieved simply by deleting an instance‑identifying key, allowing zero‑shot forgetting without retraining or accessing original data. Experiments on natural image, fine‑grained visual recognition, and medical datasets show that MUNKEY outperforms existing post‑hoc unlearning methods while maintaining predictive performance.

By Sonia Laguna, Jorge da Silva Goncalves, Moritz Vandenhirtz, Alain Ryser, Irene Cannistraci, Julia E. Vogt
arXiv Machine Learning
Oct 9

Class Machine Unlearning for Complex Data via Concepts Inference and Data Poisoning

The paper introduces a concept-guided poisoning unlearning framework that explicitly identifies semantic concepts most strongly linked to a target class or knowledge. For image classification, it uses a Post-hoc Concept Bottleneck Model to locate relevant image regions and creates poisoned samples; for large language models, it aggregates Integrated Gradients over multiple question responses to mask important content and generate poisoned training targets. Experiments across several datasets demonstrate effective unlearning while largely preserving model utility.

By Wenhan Chang, Tianqing Zhu, Heng Xu, Wenjian Liu, Wanlei Zhou
arXiv Machine Learning
Nov 5

Sample-Grained Approximate Unlearning with Provable Per-Sample Bounds

The paper introduces SALA, a plug‑in optimization framework that enables approximate machine unlearning methods to operate at the level of individual samples by aligning each example’s likelihood with its correct target distribution. It defines a sample‑grained distribution gap metric to quantify per‑sample discrepancies between approximate unlearning and exact retraining, and provides theoretical guarantees that SALA contracts this gap. Experiments on classification and generation tasks show that SALA can reduce the distribution gap by up to 86.67% and improve robustness to unlearning hyperparameters.

By Yaxin Xiao, Yulin Jin, Li Tang, Haoyang LI, Huadi Zheng, Qingqing Ye, Haibo Hu
arXiv Machine Learning
Sep 3

Source-Free Class Relearning: Diagnosing Forgetting in Class Unlearning

The paper investigates whether a model that has undergone class unlearning can still recover forgotten classes without access to original data. It introduces a white‑box audit method that generates synthetic probes in representation space, filters them by confidence, and relabels boundary‑adjacent probes as the forgotten class. The authors define a Relearning Score to quantify recovery while preserving retain performance, and demonstrate that several unlearning techniques on CIFAR‑10, CIFAR‑100, and TinyImageNet can be fully recovered in a source‑free setting, sometimes even outperforming a retrained reference.

By Zahra Dehghani, Pablo Piantanida, Mohammadhadi Shateri
arXiv Machine Learning
Oct 8

Why Forget-Only Unlearning Needs Memorization

The paper investigates the feasibility of forget‑only unlearning, where a deletion algorithm can only access the trained model and the examples to forget, without any retained data or additional training information. It demonstrates that the possibility of successful unlearning depends on the learning method, showing that different datasets can yield identical models yet require distinct post‑deletion outputs. The authors establish lower bounds on the accuracy of unlearning relative to retraining and prove that, for certain learners, the algorithm must memorize a substantial portion of the training data—potentially the entire dataset—to handle arbitrary deletion requests, implying that models designed for forget‑only unlearning may need to retain more information than standard training does.

By Luka Radi\'c, Vikrant Singhal, Amartya Sanyal