Challenges and Pitfalls of Bayesian Unlearning
원문 초록
Machine unlearning refers to the task of removing a subset of training data, thereby removing its contributions to a trained model. Approximate unlearning are one class of methods for this task which avoid the need to retrain the model from scratch on the retained data. Bayes' rule can be used to cast approximate unlearning as an inference problem where the objective is to obtain the updated posterior by dividing out the likelihood of deleted data. However this has its own set of challenges as one often doesn't have access to the exact posterior of the model parameters. In this work we examine the use of the Laplace approximation and Variational Inference to obtain the updated posterior. With a neural network trained for a regression task as the guiding example, we draw insights on the applicability of Bayesian unlearning in practical scenarios.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Model State Arithmetic for Machine Unlearning
Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inference
Rectifying Privacy and Efficacy Measurements in Machine Unlearning: A New Inference Attack Perspective
Variational Inference with Mixtures of Isotropic Gaussians
Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble
토론
이 논문과 연결된 포럼 글이 아직 없습니다.