LGCVFeb 29, 2024

Loss-Free Machine Unlearning

arXiv:2402.19308v18 citationsh-index: 8Tiny Papers @ ICLR
Originality Incremental advance
AI Analysis

This addresses the need for efficient unlearning in machine learning models, reducing computational costs and data storage requirements, though it is incremental as an extension to an existing algorithm.

The paper tackles the problem of machine unlearning by introducing a retraining- and label-free method that approximates sensitivity using the gradient of the l2 norm of model output, showing competitive performance with state-of-the-art approaches in experiments with ResNet18 and Vision Transformer.

We present a machine unlearning approach that is both retraining- and label-free. Most existing machine unlearning approaches require a model to be fine-tuned to remove information while preserving performance. This is computationally expensive and necessitates the storage of the whole dataset for the lifetime of the model. Retraining-free approaches often utilise Fisher information, which is derived from the loss and requires labelled data which may not be available. Thus, we present an extension to the Selective Synaptic Dampening algorithm, substituting the diagonal of the Fisher information matrix for the gradient of the l2 norm of the model output to approximate sensitivity. We evaluate our method in a range of experiments using ResNet18 and Vision Transformer. Results show our label-free method is competitive with existing state-of-the-art approaches.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes