Reference-Guided Machine Unlearning

March 11, 2026 ยท Grace Period ยท ๐Ÿ› three ICLR 2026 workshops: Test-Time Updates

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Jonas Mirlach, Sonia Laguna, Julia E. Vogt arXiv ID 2603.11210 Category cs.LG: Machine Learning Citations 0 Venue three ICLR 2026 workshops: Test-Time Updates
Abstract
Machine unlearning aims to remove the influence of specific data from trained models while preserving general utility. Existing approximate unlearning methods often rely on performance-degradation heuristics, such as loss maximization or random labeling. However, these signals can be poorly conditioned, leading to unstable optimization and harming the model's generalization. We argue that unlearning should instead prioritize distributional indistinguishability, aligning the model's behavior on forget data with its behavior on truly unseen data. Motivated by this, we propose Reference-Guided Unlearning (ReGUn), a framework that leverages a disjoint held-out dataset to provide a principled, class-conditioned reference for distillation. We demonstrate across various model architectures, natural image datasets, and varying forget fractions that ReGUn consistently outperforms standard approximate baselines, achieving a superior forgetting-utility trade-off.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning