Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions
<|reference_start|>Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions: Machine unlearning algorithms aim to efficiently remove data from a model without retraining it from scratch, in order to enforce data privacy, remove corrupted or outdated data, or respect a user's ``right to be forgotten." Certified machine unlearning is a strong theoretical guarantee that quantifies the extent to which data is erased from the model weights. Most prior works in certified unlearning focus on models trained on convex or strongly convex loss functions, which benefit from convenient convergence guarantees and the existence of global minima. For nonconvex objectives, existing algorithms rely on limiting assumptions and expensive computations that hinder practical implementations. In this work, we propose a simple first-order algorithm for unlearning on general nonconvex loss functions which unlearns by ``rewinding" to an earlier step during the learning process and then performs gradient descent on the loss function of the retained data points. Our algorithm is black-box, in that it can be directly applied to models pretrained with vanilla gradient descent with no prior consideration of unlearning. We prove $(\epsilon, \delta)$ certified unlearning and performance guarantees that establish the privacy-utility-complexity tradeoff of our algorithm, with special consideration for nonconvex functions that satisfy the Polyak-Lojasiewicz inequality.<|reference_end|>
@article{mu2024rewind-to-delete:,
    title={Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions},
    author={Siqiao Mu, Diego Klabjan},
    journal={arXiv preprint arXiv:2409.09778},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.09778},
    primaryClass={cs.LG}
}