UCD: Unlearning in LLMs via Contrastive Decoding
원문 초록
Machine unlearning aims to remove specific information, e.g. sensitive or undesirable content, from large language models (LLMs) while preserving overall performance. We propose an inference-time unlearning algorithm that uses contrastive decoding, leveraging two auxiliary smaller models, one trained without the forget set and one trained with it, to guide the outputs of the original model using their difference during inference. Our strategy substantially improves the tradeoff between unlearning effectiveness and model utility. We evaluate our approach on two unlearning benchmarks, TOFU and MUSE. Results show notable gains in both forget quality and retained performance in comparison to prior approaches, suggesting that incorporating contrastive decoding can offer an efficient, practical avenue for unlearning concepts in large-scale models.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.