arXiv Machine Learning
Do unlearning algorithms learn the right features?
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
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.
arXiv AI
Aug 5
One-Point Contraction: Erasing Representational Separability toward Irreversible Deep Forgetting
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.
arXiv Machine Learning
Sep 30
UnlearningSoup: Is Repeated Tuning Necessary for Large Language Model Unlearning?
arXiv:2609.37076v1 Announce Type: new Abstract: Large language models trained on vast corpora inherently risk memorizing harmful content that may later re-emerge in their outputs. To mitigate this is...
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 Machine Learning
Oct 23
When Forgotten Facts Return: Relearning-Aware Unlearning of Knowledge Graph Embeddings via Tangent Kernels
The paper introduces Kernel-Anticipated Unlearning (KAU), a method for approximate unlearning of knowledge-graph embeddings that accounts for relearning during continued training. KAU uses the tangent kernel to model how forgotten facts’ scores change, expressing this response in closed form and guiding edits to minimize future leakage. Experiments show KAU reduces leakage by 46‑63% on FB15k-237 and 50‑82% on CoDEx-L compared to the strongest existing unlearner, while preserving higher utility.
arXiv Machine Learning
Oct 9
Class Machine Unlearning for Complex Data via Concepts Inference and Data Poisoning
The paper introduces a concept-guided poisoning unlearning framework that explicitly identifies semantic concepts most strongly linked to a target class or knowledge. For image classification, it uses a Post-hoc Concept Bottleneck Model to locate relevant image regions and creates poisoned samples; for large language models, it aggregates Integrated Gradients over multiple question responses to mask important content and generate poisoned training targets. Experiments across several datasets demonstrate effective unlearning while largely preserving model utility.