Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate
원문 초록
Machine unlearning has been used to remove unwanted knowledge acquired by large language models (LLMs). In this paper, we examine machine unlearning from an optimization perspective, framing it as a regularized multi-task optimization problem, where one task optimizes a forgetting objective and another optimizes the model performance. In particular, we introduce a normalized gradient difference (NGDiff) algorithm, enabling us to have better control over the trade-off between the objectives, while integrating a new, automatic learning rate scheduler. We provide a theoretical analysis and empirically demonstrate the superior performance of NGDiff among state-of-the-art unlearning methods on the TOFU and MUSE datasets while exhibiting stable training.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Model State Arithmetic for Machine Unlearning
Rectifying Privacy and Efficacy Measurements in Machine Unlearning: A New Inference Attack Perspective
Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble
Unlearning Isn't Invisible: Detecting Unlearning Traces in LLMs from Model Outputs
Apollo: A Posteriori Label-Only Membership Inference Attack Towards Machine Unlearning
Certified Unlearning for Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.