The reviewed record of science sign in
Pith

arxiv: 2402.01401 · v4 · pith:N2MXQSAI · submitted 2024-02-02 · cs.LG · cs.AI· stat.ML

An Information Theoretic Approach to Machine Unlearning

Reviewed by Pithpith:N2MXQSAIopen to challenge →

classification cs.LG cs.AIstat.ML
keywords unlearningmodeldatainformationapproachforgetmethodperformance
0
0 comments X
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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

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

  1. CATA: Continual Machine Unlearning via Conflict-Averse Task Arithmetic

    cs.CV 2026-05 unverdicted novelty 7.0

    CATA enables persistent continual unlearning in VLMs by sign-aware aggregation of unlearning task vectors to suppress conflicts that could revive forgotten knowledge.

  2. $\oslash$ Source Models Leak What They Shouldn't $\nrightarrow$: Unlearning Zero-Shot Transfer in Domain Adaptation Through Adversarial Optimization

    cs.CV 2026-04 unverdicted novelty 7.0

    A new adversarial optimization method for unlearning source-exclusive classes during source-free domain adaptation prevents privacy leakage while preserving target performance.

  3. ICED: Concept-level Machine Unlearning via Interpretable Concept Decomposition

    cs.CV 2026-05 unverdicted novelty 6.0

    ICED decomposes visual features into interpretable concepts to enable selective unlearning of target knowledge in VLMs while preserving non-target semantics and model utility.

  4. ICED: Concept-level Machine Unlearning via Interpretable Concept Decomposition

    cs.CV 2026-05 unverdicted novelty 6.0

    ICED performs interpretable concept-level unlearning in VLMs by constructing a concept vocabulary via MLLM and decomposing visual representations for targeted optimization.

  5. Jellyfish: Zero-Shot Federated Unlearning Scheme with Knowledge Disentanglement

    cs.CR 2026-04 unverdicted novelty 6.0

    Jellyfish enables zero-shot federated unlearning through synthetic proxy data generation, channel-restricted knowledge disentanglement, and a composite loss with repair to forget target data while retaining model utility.