Table of Contents
Fetching ...

Synthetic Forgetting without Access: A Few-shot Zero-glance Framework for Machine Unlearning

Qipeng Song, Nan Yang, Ziqi Xu, Yue Li, Wei Shao, Feng Xia

TL;DR

The paper addresses privacy-compliant unlearning under the Right to be Forgotten by proposing a few-shot zero-glance setting and the GFOES framework. It introduces Optimal Erasure Samples generated by a Generative Feedback Network to induce forgetting for target classes without access to forget data, paired with a two-phase fine-tuning strategy to aggressively forget and then restore utility. Empirical results on Fashion-MNIST, CIFAR-10, and CIFAR-100 show complete forgetting of forgotten classes and high retention of retained performance, outperforming baselines in both logit- and representation-based metrics while maintaining efficiency. This approach offers a practical path to privacy-preserving ML in data-constrained, real-world MLaaS scenarios, with publicly shareable code and clear ablation evidence supporting each design choice.

Abstract

Machine unlearning aims to eliminate the influence of specific data from trained models to ensure privacy compliance. However, most existing methods assume full access to the original training dataset, which is often impractical. We address a more realistic yet challenging setting: few-shot zero-glance, where only a small subset of the retained data is available and the forget set is entirely inaccessible. We introduce GFOES, a novel framework comprising a Generative Feedback Network (GFN) and a two-phase fine-tuning procedure. GFN synthesises Optimal Erasure Samples (OES), which induce high loss on target classes, enabling the model to forget class-specific knowledge without access to the original forget data, while preserving performance on retained classes. The two-phase fine-tuning procedure enables aggressive forgetting in the first phase, followed by utility restoration in the second. Experiments on three image classification datasets demonstrate that GFOES achieves effective forgetting at both logit and representation levels, while maintaining strong performance using only 5% of the original data. Our framework offers a practical and scalable solution for privacy-preserving machine learning under data-constrained conditions.

Synthetic Forgetting without Access: A Few-shot Zero-glance Framework for Machine Unlearning

TL;DR

The paper addresses privacy-compliant unlearning under the Right to be Forgotten by proposing a few-shot zero-glance setting and the GFOES framework. It introduces Optimal Erasure Samples generated by a Generative Feedback Network to induce forgetting for target classes without access to forget data, paired with a two-phase fine-tuning strategy to aggressively forget and then restore utility. Empirical results on Fashion-MNIST, CIFAR-10, and CIFAR-100 show complete forgetting of forgotten classes and high retention of retained performance, outperforming baselines in both logit- and representation-based metrics while maintaining efficiency. This approach offers a practical path to privacy-preserving ML in data-constrained, real-world MLaaS scenarios, with publicly shareable code and clear ablation evidence supporting each design choice.

Abstract

Machine unlearning aims to eliminate the influence of specific data from trained models to ensure privacy compliance. However, most existing methods assume full access to the original training dataset, which is often impractical. We address a more realistic yet challenging setting: few-shot zero-glance, where only a small subset of the retained data is available and the forget set is entirely inaccessible. We introduce GFOES, a novel framework comprising a Generative Feedback Network (GFN) and a two-phase fine-tuning procedure. GFN synthesises Optimal Erasure Samples (OES), which induce high loss on target classes, enabling the model to forget class-specific knowledge without access to the original forget data, while preserving performance on retained classes. The two-phase fine-tuning procedure enables aggressive forgetting in the first phase, followed by utility restoration in the second. Experiments on three image classification datasets demonstrate that GFOES achieves effective forgetting at both logit and representation levels, while maintaining strong performance using only 5% of the original data. Our framework offers a practical and scalable solution for privacy-preserving machine learning under data-constrained conditions.

Paper Structure

This paper contains 39 sections, 3 theorems, 31 equations, 7 figures, 6 tables, 2 algorithms.

Key Result

Lemma B.1

Under Assumptions A2 and A3, the stabilised objective is strictly bounded below:

Figures (7)

  • Figure 1: Overview of how an MLaaS provider processes data deletion requests under the Right to be Forgotten. After data collection (①) and initial model training (②–③), a deletion request (④) triggers removal of the specified data (e.g., the bird image) from storage (⑤). The updated dataset is used for unlearning (⑥–⑦), and the resulting model is then served to users.
  • Figure 2: The training process of GFN consists of three components: the Maximise Branch, the Minimise Branch, and the Stabilised Joint Objective, as illustrated on the left. The right side shows the machine unlearning procedure applied to the generated OES.
  • Figure 3: t-SNE visualisation of feature representations for single-class unlearning on CIFAR-10. Red points indicate samples from the forgotten class, while other colours represent the retained classes.
  • Figure 4: GradCAM visualisation for single-class unlearning on CIFAR-10. Warmer colours highlight regions the model attends to when predicting the forgotten class, while cooler colours indicate lower attention.
  • Figure 5: t-SNE visualisation for single-class unlearning on Fashion-MNIST. GFOES disperses feature clusters associated with forgotten classes while preserving well-separated clusters for retained classes.
  • ...and 2 more figures

Theorems & Definitions (7)

  • Definition 1: Optimal Erasure Samples (OES)
  • Lemma B.1: Lower bound
  • proof : Proof sketch
  • Lemma B.2: Gradient norm bound
  • proof : Proof sketch
  • Theorem B.3: Convergence of GFN Training
  • proof