paper-with-me

Papers

SAFE: Machine Unlearning With Shard Graphs

2023-04-25 · ICCV 2023 1 · Yonatan Dukler, Benjamin Bowman, Alessandro Achille, Aditya Golatkar, Ashwin Swaminathan, Stefano Soatto

We present Synergy Aware Forgetting Ensemble (SAFE), a method to adapt large models on a diverse collection of data while minimizing the expected cost to remove the influence of training samples from the trained model. This process, also known as selective forgetting or unlearning, is often conducted by partitioning a dataset into shards, training fully independent models on each, then ensembling the resulting models. Increasing the number of shards reduces the expected cost to forget but at the same time it increases inference cost and reduces the final accuracy of the model since synergistic information between samples is lost during the independent model training. Rather than treating each shard as independent, SAFE introduces the notion of a shard graph, which allows incorporating limited information from other shards during training, trading off a modest increase in expected forgetting cost with a significant increase in accuracy, all while still attaining complete removal of residual influence after forgetting. SAFE uses a lightweight system of adapters which can be trained while reusing most of the computations. This allows SAFE to be trained on shards an order-of-magnitude smaller than current state-of-the-art methods (thus reducing the forgetting costs) while also maintaining high accuracy, as we demonstrate empirically on fine-grained computer vision datasets.

📄 PDF Abstract BibTeX arXiv:2304.13169

Code (0)

등록된 구현이 없습니다.

Tasks

Machine Unlearning

Methods 이 논문이 사용한 방법론

AWARE We propose to theoretically and empirically examine the effect of incorporating weighting schemes into walk-aggregating GNNs. To this end, we propose a simple, interpretable, and…

Similar Papers 제목 키워드 기반

Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing

2025-05-14 · Yezi Liu, Prathyush Poduval, Wenjun Huang, Yang Ni 외

Graph unlearning is a crucial approach for protecting user privacy by erasing the influence of user data on trained graph models. Recent developments in graph unlearning methods have primarily focused on maintaining mode…

Fairness

Coded Machine Unlearning

2020-12-31 · Nasser Aldaghri, Hessam Mahdavifar, Ahmad Beirami

There are applications that may require removing the trace of a sample from the system, e.g., a user requests their data to be deleted, or corrupted data is discovered. Simply removing a sample from storage units does no…

Ensemble LearningMachine Unlearning

FedShard: Federated Unlearning with Efficiency Fairness and Performance Fairness

2025-08-13 · Siyuan Wen, Meng Zhang, Yang Yang, Ningning Ding arxiv

To protect clients' right to be forgotten in federated learning, federated unlearning aims to remove the data contribution of leaving clients from the global learned model. While current studies mainly focused on enhanci…

Federated Learning

MobText-SISA: Efficient Machine Unlearning for Mobility Logs with Spatio-Temporal and Natural-Language Data

2025-08-27 · Haruki Yonekura, Ren Ozeki, Tatsuya Amano, Hamada Rizk 외 arxiv

Modern mobility platforms have stored vast streams of GPS trajectories, temporal metadata, free-form textual notes, and other unstructured data. Privacy statutes such as the GDPR require that any individual's contributio…

Graph Unlearning

2021-03-27 · Min Chen, Zhikun Zhang, Tianhao Wang, Michael Backes 외

Machine unlearning is a process of removing the impact of some training data from the machine learning (ML) models upon receiving removal requests. While straightforward and legitimate, retraining the ML model from scrat…

Machine Unlearning