arXiv:2507. 07754v3 Announce Type: replace-cross Abstract: Machine unlearning is usually evaluated by what the classifier outputs: forget-set accuracy, confidence, membership-inference scores.
By Jaeheun Jung, Bosung Jung, Suhyun Bae, Donghun Lee
The paper introduces Unmerge, an efficient machine unlearning algorithm that treats unlearning as the inverse of task arithmetic. By representing the forget component as a low‑rank basis at each layer, Unmerge optimizes three goals—matching the merged vector, suppressing leakage, and bounding correction size—to limit forget leakage and retain damage. Experiments on ResNet‑50, ViT‑S/16, and Llama‑3.2‑3B show significant performance gains over existing methods while maintaining privacy and feature‑distribution fidelity.
By Haoran Tang, Andrew Tan, Rajiv Khanna
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,...
arXiv:2606. 03808v1 Announce Type: cross Abstract: We propose PURGE, a machine unlearning algorithm built on a simple but an under-exploited observation: continual learning (CL) and machine unlearning (MU) which are fundamentally dual problems.
By Vedant Jawandhia, Daksh Ahuja, Ghufran Alam Siddiqui, Prashant Trivedi, Yash Sinha, Pratik Narang
PredErase is a training‑free method that removes objects and their photometric effects by guiding a frozen Fill model with predictive latent cues. It expands the user‑provided mask to a contact‑band region, uses I‑JEPA to generate a context‑conditioned target for the hole, and aligns Fill’s completions with this target while keeping surrounding pixels fixed. On benchmarks such as RemovalBench, RORD‑Val, and DEFACTO‑Val, PredErase improves the native FLUX.2 backbone for instance‑only masks, though supervised removers still outperform it on full‑image metrics.
By Waikit Xiu, Qiang Lu, Junbiao Chen, Xiying Li
Machine unlearning aims to remove the influence of specific training data while preserving model utility. Many state-of-the-art approaches pursue this goal by restricting the forgetting update to a subset of parameters selected through gradient-based saliency.
arXiv:2607. 21353v1 Announce Type: new Abstract: Machine unlearning aims to remove the influence of specific training data while preserving model utility.
By Billel Habbati, Alessio Merlo, Luca Verderame, Meriem Guerar
arXiv:2609.36612v1 Announce Type: new
Abstract: Unlearning in large language models (LLMs) is typically evaluated at the output level, where a model appears to suppress sensitive or undesirable conte...
By Hadi Reisizadeh, Jiajun Ruan, Sijia Liu, Mingyi Hong
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
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.
By Jonas Mirlach, Sonia Laguna, Julia E. Vogt
arXiv:2606. 25001v1 Announce Type: new Abstract: Machine unlearning (MU) is commonly judged by output forgetting, such as low forget-set accuracy or reduced logit-level membership inference.
By Teresa Pui Yee Yong, Win Kent Ong, Chee Seng Chan
arXiv:2609.40127v1 Announce Type: cross
Abstract: Modern transformers pair impressive capabilities with substantial memory and compute demands. Low-rank weight factorization reduces both while keepin...
By Massimo Bini, Anders Christensen, Stephan Alaniz, Judah Goldfeder, Ole Winther, Yann LeCun, Ravid Shwartz-Ziv, Zeynep Akata