Machine unlearning is the task of updating machine learning (ML) models after a subset of the training data they were trained on is deleted. Methods for the task are desired to combine effectiveness and efficiency, i.e., they should effectively "unlearn" deleted data, but in a way that does not require excessive computation effort (e.g., a full retraining) for a small amount of deletions. Such a combination is typically achieved by tolerating some amount of approximation in the unlearning. In addition, laws and regulations in the spirit of "the right to be forgotten" have given rise to requirements for certifiability, i.e., the ability to demonstrate that the deleted data has indeed been unlearned by the ML model.
In this paper, we present an experimental study of the three state-of-the-art approximate unlearning methods for linear models and demonstrate the trade-offs between efficiency, effectiveness and certifiability offered by each method. In implementing the study, we extend some of the existing works and describe a common ML pipeline to compare and evaluate the unlearning methods on six real-world datasets and a variety of settings. We provide insights into the effect of the quantity and distribution of the deleted data on ML models and the performance of each unlearning method in different settings. We also propose a practical online strategy to determine when the accumulated error from approximate unlearning is large enough to warrant a full retrain of the ML model.
Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning
Department of Electrical and Computer Engineering(电气与计算机工程系);Georgia Institute of Technology(佐治亚理工学院);Department of Mathematics(数学系);Massachusetts Institute of Technology(麻省理工学院)
Michigan State University(密歇根州立大学);IBM Research(IBM研究院);Cisco Research(思科研发);University of California, Santa Cruz(加州大学圣克鲁兹分校);ByteDance Research(字节跳动研究);Carnegie Mellon University(卡内基梅隆大学)
Machine unlearning through fine-grained model parameters perturbation
College of Computer Science and Electronic Engineering, Hunan University(湖南大学计算机与电子工程学院);College of Computing and Data Science, Nanyang Technological University(南洋理工大学计算与数据科学学院);Shenzhen Research Institute, Hunan University(湖南大学深圳研究院);Faculty of Computing, Engineering & Media, De Montfort University(德蒙福特大学计算、工程与媒体学院)
Protecting the Neural Networks against FGSM Attack Using Machine Unlearning
Department of Computer Engineering, Faculty of Engineering, Saveh Branch, Islamic Azad University(伊斯兰阿扎德大学萨韦分校工程学院计算机工程系);Faculty of Computer Science and Engineering, Shahid Beheshti University(沙希德·贝赫什提大学计算机科学与工程学院)
Zero-shot Class Unlearning via Layer-wise Relevance Analysis and Neuronal Path Perturbation
School of Information Engineering, Zhongnan University of Economics and Law(信息工程学院,中南财经政法大学);China University of Geosciences, Wuhan(中国地质大学(武汉));City University of Macau(澳门城市大学)
BIFOLD & TU Berlin(BIFOLD与柏林工业大学);CISPA Helmholtz Center for Information Security(CISPA亥姆霍兹信息安全中心);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Microsoft Research(微软研究院);The University of Melbourne(墨尔本大学);University of Toronto & Vector Institute(多伦多大学与向量研究所)
MeGU: Machine-Guided Unlearning with Target Feature Disentanglement
School of Automation, Beijing Institute of Technology(自动化学院,北京理工大学);Sydney AI Centre, The University of Sydney(悉尼人工智能中心,悉尼大学);Department of Computer Science, Hong Kong Baptist University(计算机科学系,香港 Baptist 大学)
Machine Unlearning with Minimal Gradient Dependence for High Unlearning Ratios
School of Information, Renmin University of China(中国人民大学信息学院);School of Computer Science and Big Data, Minjiang University(闽江学院计算机与大数据学院);RMIT University(皇家墨尔本理工大学)