Pith. sign in

REVIEW 3 cited by

An Information Theoretic Approach to Machine Unlearning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.01401 v4 pith:N2MXQSAI submitted 2024-02-02 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords unlearningmodeldatainformationapproachforgetmethodperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

To comply with AI and data regulations, the need to forget private or copyrighted information from trained machine learning models is increasingly important. The key challenge in unlearning is forgetting the necessary data in a timely manner, while preserving model performance. In this work, we address the zero-shot unlearning scenario, whereby an unlearning algorithm must be able to remove data given only a trained model and the data to be forgotten. We explore unlearning from an information theoretic perspective, connecting the influence of a sample to the information gain a model receives by observing it. From this, we derive a simple but principled zero-shot unlearning method based on the geometry of the model. Our approach takes the form of minimising the gradient of a learned function with respect to a small neighbourhood around a target forget point. This induces a smoothing effect, causing forgetting by moving the boundary of the classifier. We explore the intuition behind why this approach can jointly unlearn forget samples while preserving general model performance through a series of low-dimensional experiments. We perform extensive empirical evaluation of our method over a range of contemporary benchmarks, verifying that our method is competitive with state-of-the-art performance under the strict constraints of zero-shot unlearning. Code for the project can be found at https://github.com/jwf40/Information-Theoretic-Unlearning

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Towards Source-Free Machine Unlearning

    cs.LG 2025-08 conditional novelty 6.0 of 10

    A Hessian estimation procedure using only the forget set enables instance-level source-free unlearning with claimed theoretical error bounds.

  2. Targeted Forgetting of Image Subgroups in CLIP Models

    cs.CV 2025-06 conditional novelty 6.0 of 10

    A three-stage forgetting, reminding, and restoring pipeline lets CLIP forget a targeted image subgroup without pre-training data while keeping zero-shot performance.

  3. Forget-MI: Machine Unlearning for Forgetting Multimodal Information in Healthcare Settings

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Forget-MI unlearns unimodal and joint embeddings of patient data in a multimodal chest X-ray model, reducing membership inference attack success by 0.202 while preserving only part of the original test performance.

Pith tools