arXiv Machine Learning

Lethe: Adapter-Augmented Dual-Stream Update for Persistent Knowledge Erasure in Federated Unlearning

arXiv:2601. 22601v2 Announce Type: replace Abstract: Federated unlearning (FU) aims to erase designated client-level, class-level, or sample-level knowledge from a global model.

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 Machine Learning
Sep 15

Realistic Continual Learning Approach using Pre-trained Models

arXiv:2404.07729v2 Announce Type: replace Abstract: Continual learning (CL) evaluates adaptability in learning solutions to retain knowledge. Our research addresses the challenge of catastrophic forg...

By Nadia Nasri, Carlos Guti\'errez-\'Alvarez, Sergio Lafuente-Arroyo, Saturnino Maldonado-Basc\'on, Roberto J. L\'opez-Sastre
arXiv AI
Jun 3

FlashbackCL: Mitigating Temporal Forgetting in Federated Learning

arXiv:2606. 03939v1 Announce Type: cross Abstract: Federated Learning (FL) of foundation and edge models increasingly targets deployments where client data distributions drift over time, yet existing forgetting-mitigation methods assume each client's distribution is stationary.

By Mubarak A. Ojewale, Adriana E. Chis, Jorge M. Cortes-Mendoza, Bernardo Pulido-Gaytan, Horacio Gonzalez-Velez
Hugging Face Trending Papers
Jun 2

FlashbackCL: Mitigating Temporal Forgetting in Federated Learning

Federated Learning (FL) of foundation and edge models increasingly targets deployments where client data distributions drift over time, yet existing forgetting-mitigation methods assume each client's distribution is stationary. Flashback, the strongest recent FL method against cross-client (spatial) forgetting, uses monotonically accumulating per-class label counts as a knowledge proxy; this proxy becomes miscalibrated under temporal distribution shift and anchors the global model to an outdated class balance.

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