arXiv Machine Learning By Sajith U, Prateek Keserwani

DFMU: Data-Frugal Machine Unlearning

Read the original on arXiv Machine Learning →

arXiv:2606. 25410v1 Announce Type: new Abstract: Machine unlearning is an emerging domain that ensures the safe removal of elements (includes concepts, attributes, entity and class) from the trained model along with least drop in model performance.

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 Machine Learning.

Hugging Face Trending Papers
Jun 24

DFMU: Data-Frugal Machine Unlearning

Machine unlearning is an emerging domain that ensures the safe removal of elements (includes concepts, attributes, entity and class) from the trained model along with least drop in model performance. The domain of machine unlearning brings its own indigenous challenges since the removal of pre-trained elements from model will always degrade the model performance on remaining elements.

arXiv Computation and Language
Aug 25

CALIBURN: Self-Calibrated LLM Unlearning Alignment

CALIBURN is a new approach to large language model (LLM) unlearning that measures a model’s confidence in undesirable knowledge and uses this measure to fine‑tune unlearning gradient updates. By doing so, it offers more precise control over what is forgotten while better preserving the model’s overall utility. Experiments on benchmarks such as MUSE and WMDP show that CALIBURN outperforms existing methods in balancing knowledge removal with utility retention.

By Zhengbang Yang, Yisheng Zhong, Junyuan Hong, Zhuangdi Zhu
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.

By Luka Radi\'c, Vikrant Singhal, Amartya Sanyal
arXiv AI
Sep 10

CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletion

CUNO is a curriculum‑based graph unlearning framework that progressively removes a designated set of training samples, ordering them by estimated unlearning difficulty across multiple stages. It also introduces a distribution‑level negative preference optimization objective at each stage to steer the model away from its original behavior on the current forget subset while preserving performance on retained data. Experiments show that CUNO mitigates catastrophic unlearning, retaining 74% of original utility at 20% deletion and more than half at 50% deletion, outperforming existing methods.

By Chenhan Zhang, Ali Braytee, Madhushi Bandara, Xin Hao, Paul J. Kennedy, Massimo Piccardi, Raymond Owen