Pith. sign in

REVIEW 3 cited by

DeepObliviate: A Powerful Charm for Erasing Data Residual Memory in Deep Neural Networks

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 2105.06209 v1 pith:E7W2E5MJ submitted 2021-05-13 cs.LG cs.AIcs.CR

classification cs.LGcs.AIcs.CR
keywords modelmodelstimesunlearningapproachdatatrainingdatasets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Machine unlearning has great significance in guaranteeing model security and protecting user privacy. Additionally, many legal provisions clearly stipulate that users have the right to demand model providers to delete their own data from training set, that is, the right to be forgotten. The naive way of unlearning data is to retrain the model without it from scratch, which becomes extremely time and resource consuming at the modern scale of deep neural networks. Other unlearning approaches by refactoring model or training data struggle to gain a balance between overhead and model usability. In this paper, we propose an approach, dubbed as DeepObliviate, to implement machine unlearning efficiently, without modifying the normal training mode. Our approach improves the original training process by storing intermediate models on the hard disk. Given a data point to unlearn, we first quantify its temporal residual memory left in stored models. The influenced models will be retrained and we decide when to terminate the retraining based on the trend of residual memory on-the-fly. Last, we stitch an unlearned model by combining the retrained models and uninfluenced models. We extensively evaluate our approach on five datasets and deep learning models. Compared to the method of retraining from scratch, our approach can achieve 99.0%, 95.0%, 91.9%, 96.7%, 74.1% accuracy rates and 66.7$\times$, 75.0$\times$, 33.3$\times$, 29.4$\times$, 13.7$\times$ speedups on the MNIST, SVHN, CIFAR-10, Purchase, and ImageNet datasets, respectively. Compared to the state-of-the-art unlearning approach, we improve 5.8% accuracy, 32.5$\times$ prediction speedup, and reach a comparable retrain speedup under identical settings on average on these datasets. Additionally, DeepObliviate can also pass the backdoor-based unlearning verification.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. FUNU: Boosting Machine Unlearning Efficiency by Filtering Unnecessary Unlearning

    cs.LG 2025-01 reject novelty 6.0 of 10

    FUNU filters out unnecessary deletion requests whose samples have similar neighbors in the remaining data, reducing unlearning cost while retaining approximate model similarity.

  2. Learning to Forget using Hypernetworks

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A diffusion-based hypernetwork can generate classifier weights with near-zero accuracy on a requested forget class and near-retrained accuracy on retained classes.

  3. A Review on Machine Unlearning

    cs.LG 2024-11 conditional novelty 1.0 of 10

    The paper provides a structured review and classification of machine unlearning methods, linking them to data lineage management.

Pith tools