paper-with-me

홈 › Papers

Towards Probabilistic Verification of Machine Unlearning

2020-03-09 · David Marco Sommer, Liwei Song, Sameer Wagh, Prateek Mittal

The right to be forgotten, also known as the right to erasure, is the right of individuals to have their data erased from an entity storing it. The status of this long held notion was legally solidified recently by the General Data Protection Regulation (GDPR) in the European Union. Consequently, there is a need for mechanisms whereby users can verify if service providers comply with their deletion requests. In this work, we take the first step in proposing a formal framework to study the design of such verification mechanisms for data deletion requests -- also known as machine unlearning -- in the context of systems that provide machine learning as a service (MLaaS). Our framework allows the rigorous quantification of any verification mechanism based on standard hypothesis testing. Furthermore, we propose a novel backdoor-based verification mechanism and demonstrate its effectiveness in certifying data deletion with high confidence, thus providing a basis for quantitatively inferring machine unlearning. We evaluate our approach over a range of network architectures such as multi-layer perceptrons (MLP), convolutional neural networks (CNN), residual networks (ResNet), and long short-term memory (LSTM), as well as over 5 different datasets. We demonstrate that our approach has minimal effect on the ML service's accuracy but provides high confidence verification of unlearning. Our proposed mechanism works even if only a handful of users employ our system to ascertain compliance with data deletion requests. In particular, with just 5% of users participating, modifying half their data with a backdoor, and with merely 30 test queries, our verification mechanism has both false positive and false negative ratios below $10^{-3}$. We also show the effectiveness of our approach by testing it against an adaptive adversary that uses a state-of-the-art backdoor defense method.

📄 PDF Abstract BibTeX arXiv:2003.04247

Code (1)

inspire-group/unlearning-verification 공식 구현 tf

Tasks

backdoor defenseMachine UnlearningTwo-sample testing

Similar Papers 제목 키워드 기반

Verification of Machine Unlearning is Fragile

2024-08-01 · Binchi Zhang, Zihan Chen, Cong Shen, Jundong Li

As privacy concerns escalate in the realm of machine learning, data owners now have the option to utilize machine unlearning to remove their data from machine learning models, following recent legislation. To enhance tra…

Machine Unlearning

EVE: Efficient Verification of Data Erasure through Customized Perturbation in Approximate Unlearning

2026-02-03 · Weiqi Wang, Zhiyi Tian, Chenhan Zhang, Luoyu Chen 외 arxiv

Verifying whether the machine unlearning process has been properly executed is critical but remains underexplored. Some existing approaches propose unlearning verification methods based on backdooring techniques. However…

Verifying Robust Unlearning: Probing Residual Knowledge in Unlearned Models

2025-04-21 · Hao Xuan, Xingyu Li

Machine Unlearning (MUL) is crucial for privacy protection and content regulation, yet recent studies reveal that traces of forgotten information persist in unlearned models, enabling adversaries to resurface removed kno…

Machine Unlearning

Efficient Machine Unlearning by Model Splitting and Core Sample Selection

2025-05-11 · Maximilian Egger, Rawad Bitar, Rüdiger Urbanke

Machine unlearning is essential for meeting legal obligations such as the right to be forgotten, which requires the removal of specific data from machine learning models upon request. While several approaches to unlearni…

Machine Unlearning

Machine Unlearning: A Comprehensive Survey

2024-05-13 · Weiqi Wang, Zhiyi Tian, Chenhan Zhang, Shui Yu

As the right to be forgotten has been legislated worldwide, many studies attempt to design unlearning mechanisms to protect users' privacy when they want to leave machine learning service platforms. Specifically, machine…

Machine UnlearningSurvey