arXiv Machine Learning
On-the-go Forgetting without Explicit Unlearning via ERASE
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 15
Inference-Time Machine Unlearning via Gated Activation Redirection
arXiv:2605. 12765v3 Announce Type: replace Abstract: Large Language Models memorize vast amounts of training data, raising concerns regarding privacy, copyright infringement, and safety.
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.
arXiv Machine Learning
Sep 30
Reference-Guided Machine Unlearning
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.
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.
Hugging Face Trending Papers
Sep 9
Forgetting Only What Matters: Layer-Selective Unlearning toward Robust LLMs
Large Language Models (LLMs) can memorize and reproduce sensitive, copyrighted, or otherwise undesirable training content, creating privacy, safety, and regulatory concerns. Machine unlearning offers...
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.