Towards Unbounded Machine Unlearning

Meghdad Kurmanji, Peter Triantafillou, Jamie Hayes, Eleni Triantafillou
2/20/2023
cs.LGcs.CR

No official code found. Best implementation: meghdadk/SCRUB (56 stars, last commit 2024-08-17).

Abstract

Deep machine unlearning is the problem of `removing' from a trained neural network a subset of its training set. This problem is very timely and has many applications, including the key tasks of removing biases (RB), resolving confusion (RC) (caused by mislabelled data in trained models), as well as allowing users to exercise their `right to be forgotten' to protect User Privacy (UP). This paper is the first, to our knowledge, to study unlearning for different applications (RB, RC, UP), with the view that each has its own desiderata, definitions for `forgetting' and associated metrics for forget quality. For UP, we propose a novel adaptation of a strong Membership Inference Attack for unlearning. We also propose SCRUB, a novel unlearning algorithm, which is the only method that is consistently a top performer for forget quality across the different application-dependent metrics for RB, RC, and UP. At the same time, SCRUB is also consistently a top performer on metrics that measure model utility (i.e. accuracy on retained data and generalization), and is more efficient than previous work. The above are substantiated through a comprehensive empirical evaluation against previous state-of-the-art.

View on arXivView PDF

Code Implementations(1)

meghdadk/SCRUBCommunity100%
5613Python, Jupyter NotebookJan 26, 20232 years agoNOASSERTION

Similar Papers

Cite this paper

@article{kurmanji2023towards,
  title  = {Towards Unbounded Machine Unlearning},
  author = {Meghdad Kurmanji and Peter Triantafillou and Jamie Hayes and Eleni Triantafillou},
  year   = {2023},
  eprint = {2302.09880},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.09880v3},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.09880.svg)](https://codeofpaper.com/paper/2302.09880)

Discussion