Pith. sign in

REVIEW 2 cited by

Learn to Forget: Machine Unlearning via Neuron Masking

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.10933 v3 pith:QAOOJPLB submitted 2020-03-24 cs.LG cs.CRstat.ML

classification cs.LGcs.CRstat.ML
keywords datamachineunlearningrateforgettinglearningmethodmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Nowadays, machine learning models, especially neural networks, become prevalent in many real-world applications.These models are trained based on a one-way trip from user data: as long as users contribute their data, there is no way to withdraw; and it is well-known that a neural network memorizes its training data. This contradicts the "right to be forgotten" clause of GDPR, potentially leading to law violations. To this end, machine unlearning becomes a popular research topic, which allows users to eliminate memorization of their private data from a trained machine learning model.In this paper, we propose the first uniform metric called for-getting rate to measure the effectiveness of a machine unlearning method. It is based on the concept of membership inference and describes the transformation rate of the eliminated data from "memorized" to "unknown" after conducting unlearning. We also propose a novel unlearning method calledForsaken. It is superior to previous work in either utility or efficiency (when achieving the same forgetting rate). We benchmark Forsaken with eight standard datasets to evaluate its performance. The experimental results show that it can achieve more than 90\% forgetting rate on average and only causeless than 5\% accuracy loss.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Federated Unlearning Model Recovery in Data with Skewed Label Distributions

    cs.LG 2024-12 conditional novelty 5.0 of 10

    Oversampling the skewed class before recovery training restores federated unlearning model accuracy better than four baselines.

  2. Effective and secure federated online learning to rank

    cs.LG 2024-12 conditional novelty 4.0 of 10

    A thesis shows that a pairwise gradient-based online ranker can be federated as FPDGD, and analyzes non-IID data, poisoning attacks, and unlearning in federated online learning to rank.

Pith tools