arXiv Computer Vision

Forget the Data, Keep the Capability: Switchable Unlearning for Retrieval

The paper introduces MoME, a switchable unlearning framework for re-identification models that allows a single backbone to operate in either Full mode (standard inference) or Core mode (unlearned inference). MoME partitions the backbone into core parameters that retain retrieval capability and zero‑initialized parasitic parameters that store full‑data knowledge, training them with gradient isolation so the core never receives forget‑set gradients. The authors demonstrate that Core mode satisfies deletion requests with a simple flag flip, prove its independence from the forget set, and validate its effectiveness on Market‑1501, VeRi‑776, and RegDB using ResNet and CLIP backbones.

arXiv AI
1d ago

IDSISA: Influence-Distilled Sharded Training for Efficient Machine Unlearning

IDSISA is a new approach to machine unlearning that builds on SISA by using influence functions to group forget‑prone samples into a few shards and then distilling knowledge from unaffected shards to recover lost utility. The method retains SISA’s exact deletion guarantee while providing an empirically bounded approximation for utility recovery (ε_cert ≤ 0.015). Experiments on several image and text models show significant improvements in selective forgetting and utility retention compared to SISA, with modest changes in unlearning time.

By Deeraj SK, Sadhana Devarajan, Tanmoy Hazra, Anupam Shukla
arXiv Machine Learning
Jun 30

Efficient Unlearning with Privacy Guarantees

arXiv:2507. 04771v2 Announce Type: replace-cross Abstract: Privacy protection laws, such as the GDPR, grant individuals the right to request the forgetting of their personal data not only from databases but also from machine learning (ML) models trained on them.

By Josep Domingo-Ferrer, Najeeb Jebreel, David S\'anchez
arXiv AI
Jun 3

PURGE: Projected Unlearning via Retain-Guided Erasure

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
arXiv AI
1d ago

Auditable Unlearning for LLMs

The paper introduces auditability as a fourth evaluation axis for machine unlearning, measuring the separation between forgotten and retained data via a statistic computed by the provider. Experiments on eleven unlearning methods across TOFU, MUSE, and RWKU datasets show none satisfy all four axes, prompting the authors to propose a two‑stage approach: GapWiden, which widens the audit statistic gap using a hinge loss, and GapVeil, an inference‑time rejection sampler that refines responses based on audit statistics. The combined method achieves oracle‑level auditability and leakage control for all tested unlearning techniques, while improving retain performance for most methods.

By Piyush Tiwary, Anushka Srivastava, Prathosh A. P
arXiv AI
Sep 11

Forgetting Only What Matters: Layer-Selective Unlearning toward Robust LLMs

The paper introduces Forgetting Only What Matters via Unlearning Layers (FOM-UL), a layer‑selective unlearning framework for large language models. FOM-UL uses a forget‑to‑retain significance score to identify transformer layers that strongly influence the forget set while being insensitive to the retain set, allowing targeted updates that preserve most of the model. Experiments on TOFU, KnowUnDo, and MUSE-style benchmarks show that FOM-UL reduces residual memorization and maintains utility better than several baselines, even after 8‑bit and 4‑bit post‑training quantization, and it also limits recovery of forgotten content in adversarial prompt tests.

By Ravi Ranjan, Olivera Kotevska, Agoritsa Polyzou