paper-with-me

홈 › Papers

Faster Machine Unlearning via Natural Gradient Descent

2024-07-11 · Omri Lev, Ashia Wilson

We address the challenge of efficiently and reliably deleting data from machine learning models trained using Empirical Risk Minimization (ERM), a process known as machine unlearning. To avoid retraining models from scratch, we propose a novel algorithm leveraging Natural Gradient Descent (NGD). Our theoretical framework ensures strong privacy guarantees for convex models, while a practical Min/Max optimization algorithm is developed for non-convex models. Comprehensive evaluations show significant improvements in privacy, computational efficiency, and generalization compared to state-of-the-art methods, advancing both the theoretical and practical aspects of machine unlearning.

📄 PDF Abstract BibTeX arXiv:2407.08169

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyMachine Unlearning

Methods 이 논문이 사용한 방법론

Natural Gradient Descent 설명 없음

Similar Papers 제목 키워드 기반

Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning

2024-01-18 · Eli Chien, Haoyu Wang, Ziang Chen, Pan Li

Machine unlearning has raised significant interest with the adoption of laws ensuring the ``right to be forgotten''. Researchers have provided a probabilistic notion of approximate unlearning under a similar definition o…

Machine Unlearning

Certified Machine Unlearning via Noisy Stochastic Gradient Descent

2024-03-25 · Eli Chien, Haoyu Wang, Ziang Chen, Pan Li

``The right to be forgotten'' ensured by laws for user data privacy becomes increasingly important. Machine unlearning aims to efficiently remove the effect of certain data points on the trained model parameters so that …

Machine Unlearning

Descend or Rewind? Stochastic Gradient Descent Unlearning

2025-11-20 · Siqiao Mu, Diego Klabjan arxiv

Machine unlearning algorithms aim to remove the impact of selected training data from a model without the computational expenses of retraining from scratch. Two such algorithms are ``Descent-to-Delete" (D2D) and ``Rewind…

Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions

2024-09-15 · Siqiao Mu, Diego Klabjan

Machine unlearning algorithms aim to efficiently remove data from a model without retraining it from scratch, in order to remove corrupted or outdated data or respect a user's ``right to be forgotten." Certified machine …

Machine Unlearning

Machine Unlearning of Pre-trained Large Language Models

2024-02-23 · Jin Yao, Eli Chien, Minxin Du, Xinyao Niu 외

This study investigates the concept of the `right to be forgotten' within the context of large language models (LLMs). We explore machine unlearning as a pivotal solution, with a focus on pre-trained models--a notably un…

Machine Unlearning