LGCRSep 27, 2021

Unrolling SGD: Understanding Factors Influencing Machine Unlearning

arXiv:2109.13398v2325 citations
Originality Incremental advance
AI Analysis

This work addresses the computational overhead of retraining models for data removal, which is crucial for privacy and compliance in deployed AI systems, though it is incremental as it builds on existing approximate unlearning methods.

The paper tackles the problem of efficiently making machine learning models forget specific training data points by analyzing stochastic gradient descent (SGD) to identify factors influencing verification error, a key metric for approximate unlearning, and proposes a new training penalty that reduces this error, validated on datasets like CIFAR-10 and IMDB with empirical results showing improved performance.

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 L2 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.

Code Implementations1 repo
Foundations

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

Your Notes