Cited by 136Privacy-Preserving Technologies in DataStochastic Gradient Optimization TechniquesDomain Adaptation and Few-Shot Learning

Unrolling SGD: Understanding Factors Influencing Machine Unlearning

Open access
Thudi, Anvith, Deza, Gabriel, Chandrasekaran, Varun, Papernot, Nicolas·2022·2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P)

Abstract

Machine unlearning is the process through which a deployed machine learning model is made to forget about some of its training data points. While naively retraining the model from scratch is an option, it is almost always associated with large computational overheads for deep learning models. Thus, several approaches to approximately unlearn have been proposed along with corresponding metrics that formalize what it means for a model to forget about a data point. In this work, we first taxonomize approaches and metrics of approximate unlearning. As a result, we identify verification error, i.e., the$\ell_{2}$difference between the weights of an approximately unlearned and a naively retrained model, as an approximate unlearning metric that should be optimized for as it subsumes a large class of other metrics. We theoretically analyze the canonical training algorithm, stochastic gradient descent (SGD), to surface the variables which are relevant to reducing the verification error of approximate unlearning for SGD. From this analysis, we first derive an easy-to-compute proxy for verification error (termed unlearning error). The analysis also informs the design of a new training objective penalty that limits the overall change in weights during SGD and as a result facilitates approximate unlearning with lower verification error. We validate our theoretical work through an empirical evaluation on learning with CIFAR-10, CIFAR-100, and IMDB sentiment analysis.

Integrity signals

Registry

Crossref · 10.1109/eurosp53844.2022.00027

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Thudi, A., Deza, G., Chandrasekaran, V., & Papernot, N.
Affiliations
  • University of Toronto (CA)
  • University of Wisconsin–Madison (US)
Venue
2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P)
Publisher
IEEE
Published
2022-06
Pages
303-319
OpenAlex
W3202838631
Cited by
135
References
38
Citations by year
2026: 45 · 2025: 54 · 2024: 22 · 2023: 12 · 2022: 1 · 2021: 1
FWCI
12.30
Type
conference paper
Language
en
Open access
Locations
  • IEEE European Symposium on Security and Privacy (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • DARPA
  • NSERC
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
Keywords
machine unlearning, approximate unlearning, stochastic gradient descent, weight change, deep learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review