Mixed-Privacy Forgetting in Deep Networks
Aditya Golatkar, Alessandro Achille, Avinash Ravichandran, Marzia, Polito, Stefano Soatto

TL;DR
This paper introduces a novel mixed-privacy forgetting method for deep networks that efficiently removes specific training data influence while maintaining high accuracy, especially in large-scale vision tasks.
Contribution
It proposes a new mixed-privacy setting for forgetting, using linear approximation of deep networks to improve efficiency and guarantees, enabling effective data removal without accuracy loss.
Findings
Effective removal of training data influence demonstrated.
Linear approximation achieves comparable accuracy to original networks.
Forgetting can be performed efficiently even for large models.
Abstract
We show that the influence of a subset of the training samples can be removed -- or "forgotten" -- from the weights of a network trained on large-scale image classification tasks, and we provide strong computable bounds on the amount of remaining information after forgetting. Inspired by real-world applications of forgetting techniques, we introduce a novel notion of forgetting in mixed-privacy setting, where we know that a "core" subset of the training samples does not need to be forgotten. While this variation of the problem is conceptually simple, we show that working in this setting significantly improves the accuracy and guarantees of forgetting methods applied to vision classification tasks. Moreover, our method allows efficient removal of all information contained in non-core data by simply setting to zero a subset of the weights with minimal loss in performance. We achieve these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
