Variance-Reduced $(\varepsilon,\delta)-$Unlearning using Forget Set Gradients
Martin Van Waerebeke, Marco Lorenzi, Kevin Scaman, El Mahdi El Mhamdi, Giovanni Neglia

TL;DR
This paper introduces VRU, a novel first-order algorithm for machine unlearning that directly uses forget set gradients, providing formal guarantees and improved convergence rates over existing methods.
Contribution
VRU is the first first-order unlearning algorithm to incorporate forget set gradients directly, achieving formal guarantees and better convergence rates.
Findings
VRU provably satisfies $(\
VRU outperforms existing unlearning methods in convergence and effectiveness.
Experiments show VRU's superior performance over certified and empirical baselines.
Abstract
In machine unlearning, unlearning is a popular framework that provides formal guarantees on the effectiveness of the removal of a subset of training data, the forget set, from a trained model. For strongly convex objectives, existing first-order methods achieve unlearning, but they only use the forget set to calibrate injected noise, never as a direct optimization signal. In contrast, efficient empirical heuristics often exploit the forget samples (e.g., via gradient ascent) but come with no formal unlearning guarantees. We bridge this gap by presenting the Variance-Reduced Unlearning (VRU) algorithm. To the best of our knowledge, VRU is the first first-order algorithm that directly includes forget set gradients in its update rule, while provably satisfying (unlearning. We establish the convergence of VRU and show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Domain Adaptation and Few-Shot Learning · Stochastic Gradient Optimization Techniques
