Approximate Data Deletion in Generative Models
Not on the map. Why?
Abstract (arXiv)
Users have the right to have their data deleted by third-party learned systems, as codified by recent legislation such as the General Data Protection Regulation (GDPR) and the California Consumer Privacy Act (CCPA). Such data deletion can be accomplished by full re-training, but this incurs a high computational cost for modern machine learning models. To avoid this cost, many approximate data deletion methods have been developed for supervised learning. Unsupervised learning, in contrast, remains largely an open problem when it comes to (approximate or exact) efficient data deletion. In this paper, we propose a density-ratio-based framework for generative models. Using this framework, we introduce a fast method for approximate data deletion and a statistical test for estimating whether or not training points have been deleted. We provide theoretical guarantees under various learner assumptions and empirically demonstrate our methods across a variety of generative methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 29 Jun 2022.
Builds on
28 of 49 references.
References · 28
- 2022Generative Adversarial Networkscited by 5,603
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,580
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearningcited by 360
- 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
- 2020Approximate Data Deletion from Machine Learning Modelscited by 250
16 more
- 2019On the Accuracy of Influence Functions for Measuring Group Effectscited by 146
- 2022Reconstructing Training Data with Informed Adversariescited by 143
- 2021Machine Unlearning via Algorithmic Stabilitycited by 128
- 2020Telescoping Density-Ratio Estimationcited by 108
- 2019On Second-Order Group Influence Functions for Black-Box Predictionscited by 78
- 2021Density Ratio Estimation via Infinitesimal Classificationcited by 59
- 2018A Swiss Army Infinitesimal Jackknifecited by 51
- 2020Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimationcited by 43
- 2021Featurized Density Ratio Estimationcited by 33
- 2021Understanding Instance-based Interpretability of Variational Auto-Encoderscited by 21
- 2019Training Neural Networks for Likelihood/Density Ratio Estimationcited by 16
- 2019A Higher-Order Swiss Army Infinitesimal Jackknifecited by 13
- 2020Sliding Window Algorithms for k-Clustering Problemscited by 7
- 2018The Inductive Bias of Restricted f-GANscited by 5
- 2019Deep density ratio estimation for change point detectioncited by 3
- 2020Towards GANs' Approximation Abilitycited by 1
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1.
3 papers.
- 2025Data Unlearning in Diffusion Modelscited by 18
- 2023Data Redaction from Conditional Generative Modelscited by 8
- 2023Can Membership Inferencing be Refuted?cited by 4
- 2025Data Unlearning in Diffusion Models2 Mar 2025
- 2023Data Redaction from Conditional Generative Models18 May 2023
- 2023Can Membership Inferencing be Refuted?7 Mar 2023