arXiv AI By Deeraj SK, Sadhana Devarajan, Tanmoy Hazra, Anupam Shukla

IDSISA: Influence-Distilled Sharded Training for Efficient Machine Unlearning

Read the original on arXiv AI →

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.

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 AI.

arXiv Machine Learning
Oct 7

Exact Unlearning via Quantized Sufficient Statistics

The paper introduces Quantized Sufficient Statistics (QSS), a method that separates a frozen global schema from mutable, sum‑decomposable content to enable exact unlearning. QSS offers two variants: QSS‑L, which removes a label while keeping the input, and QSS‑E, which removes both input and label by learning a schema without deletable examples. Experiments on 15 vision, text, and tabular datasets show that QSS‑L achieves deletion latencies up to 483× faster than SISA while maintaining comparable accuracy, and QSS‑E quantifies the accuracy trade‑off when all traces of an input are removed.

By Ami Tavory, Shripad Gade, Tal Sarig, Noam Touitou, Ido Guy
arXiv Computer Vision
Oct 28

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.

By Jingong Chen, Kyle Gao, Guangyuan Li, Chulwoo Pack, Sijia Liu, Kwanghee Won
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