TL;DR
This paper introduces a data deletion scheme for deep learning models that predicts the impact of removing training data with high accuracy and efficiency, based on a new stability assumption.
Contribution
It presents a novel, efficient data deletion method for deep learning that relies on a stability assumption, supported by experiments with microgpt.
Findings
The scheme predicts model behavior after data removal with vanishing error and low failure probability.
Precomputation and prediction are only logarithmically slower than standard training and inference.
Stability assumption is compatible with powerful AI models, demonstrated on microgpt.
Abstract
How does the choice of training data influence an AI model? This broad question is of central importance to interpretability, privacy, and basic science. At its technical core is the data deletion problem: after a reasonable amount of precomputation, quickly predict how the model would behave in a given situation if a given subset of training data had been excluded from the learning algorithm. We present a data deletion scheme capable of predicting model outputs with vanishing error and failure probability in the deep learning setting. Our precomputation and prediction algorithms are only factors slower than regular training and inference, respectively. The storage requirements are those of models. Our proof is based on an assumption that we call stability. In contrast to the…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
