LLM Unlearning Under the Microscope: A Full-Stack View on Methods and Metrics
Chongyu Fan, Changsheng Wang, Yancheng Huang, Soumyadeep Pal, Sijia Liu
TL;DR
This work provides a full-stack examination of LLM unlearning by proposing a principled taxonomy that partitions twelve methods into divergence-driven optimization, representation misalignment, and rejection-based targeted unlearning. It reframes evaluation beyond MCQ by introducing Open-QA-based metrics to better capture generation quality and the UE/UT tradeoffs, while dissecting robustness across in-domain relearning, out-of-domain fine-tuning, quantization, and jailbreaking. The findings reveal fundamental tradeoffs among method families, show that Open-QA metrics can reveal over-forgetting, and demonstrate that robustness designs (e.g., SAM, IRM, TAR) improve resilience across attacks. The insights aim to guide the design and evaluation of future unlearning methods, balancing safety, privacy, and utility in practical LLM deployments.
Abstract
Machine unlearning for large language models (LLMs) aims to remove undesired data, knowledge, and behaviors (e.g., for safety, privacy, or copyright) while preserving useful model capabilities. Despite rapid progress over the past two years, research in LLM unlearning remains fragmented, with limited clarity on what constitutes effective unlearning and how it should be rigorously evaluated. In this work, we present a principled taxonomy of twelve recent stateful unlearning methods, grouped into three methodological families: divergence-driven optimization, representation misalignment, and rejection-based targeted unlearning. Building on this taxonomy, we revisit the evaluation of unlearning effectiveness (UE), utility retention (UT), and robustness (Rob), focusing on the WMDP benchmark. Our analysis shows that current evaluations, dominated by multiple-choice question (MCQ) accuracy, offer only a narrow perspective, often overstating success while overlooking the model's actual generation behavior. To address this gap, we introduce open question-answering (Open-QA) metrics that better capture generative performance and reveal the inherent UE-UT tradeoff across method families. Furthermore, we demonstrate that robustness requires finer-grained analysis: for example, vulnerabilities differ substantially between in-domain relearning and out-of-domain fine-tuning, even though both fall under model-level attacks. Through this study, we hope to deliver a full-stack revisit of LLM unlearning and actionable guidance for designing and evaluating future methods.
