WIN-U: Woodbury-Informed Newton-Unlearning as a retain-free Machine Unlearning Framework
Xingjian Zhao, Mohammad Mohammadi Amiri, Malik Magdon-Ismail

TL;DR
WIN-U introduces a second-order, retain-data free unlearning method for large models, efficiently removing specific data influence without retraining on retained data, ensuring privacy and utility.
Contribution
It proposes WIN-U, a novel unlearning framework using only model curvature information, achieving state-of-the-art results without access to retained data.
Findings
WIN-U achieves SOTA unlearning efficacy on vision and language benchmarks.
It is more robust against relearning attacks than existing methods.
WIN-U does not require access to retained data, enhancing privacy.
Abstract
Privacy concerns in LLMs have led to the rapidly growing need to enforce a data's "right to be forgotten". Machine unlearning addresses precisely this task, namely the removal of the influence of some specific data, i.e., the forget set, from a trained model. The gold standard for unlearning is to produce the model that would have been learned on only the rest of the training data, i.e., the retain set. Most existing unlearning methods rely on direct access to the retained data, which may not be practical due to privacy or cost constraints. We propose WIN-U, a retained-data free unlearning framework that requires only second order information for the originally trained model on the full data. The unlearning is performed using a single Newton-style step. Using the Woodbury matrix identity and a generalized Gauss-Newton approximation for the forget set curvature, the WIN-U update recovers…
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.
