Can LLMs Truly Forget? Revealing Unlearning Gaps Through Adversarial Evaluation
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Machine unlearning aims to remove the influence of targeted training data from a model while preserving its remaining capabilities, but evaluating whether such information has truly become inaccessible remains challenging. Existing benchmarks primarily assess unlearning under clean, non-adversarial queries, leaving open whether information that appears forgotten can still be recovered through strategic prompting. We address this gap through a unified evaluation of prompt-based and fine-tuning-based unlearning methods on TOFU using Llama-3.2-3B-Instruct, followed by an adversarial robustness evaluation of methods that perform strongly under standard metrics. We introduce Attack Success Rate (ASR), an LLM-as-judge metric that measures the fraction of adversarial responses whose leakage score exceeds 0.2, and evaluate recovery across eight attack suites. Our results reveal a substantial gap between clean-query forgetting and adversarial robustness. Although several fine-tuning-based methods achieve Forget Quality above 0.91, targeted information remains recoverable with ASRs between 72.8% and 84.3%, close to the 87.5% ASR of the unprotected base model. In contrast, clean multilingual reformulations yield only 2.95% measured leakage. A manual audit further finds agreement between binary ASR decisions and human factual assessments in seven of ten cases, indicating that ASR provides a useful, though imperfect, signal of behavioral recoverability. These findings show that strong standard-metric performance alone is insufficient to establish robustness after unlearning and motivate adversarial stress-testing as a complementary component of unlearning evaluation.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 6 of its 14 references that are in the map. First posted on arXiv 21 Aug 2026.
Builds on
6 of 14 references.
Closest ancestors · 5
Same direction, newest first
- 2026REBEL: Hidden Knowledge Recovery via Evolutionary-Based Evaluation Loop5 Feb
- 2025OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics14 Jun
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
- 2024TOFU: A Task of Fictitious Unlearning for LLMs11 Jan
- 2023In-Context Unlearning: Language Models as Few Shot Unlearners11 Oct
Other references · 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Improving LLM Unlearning Robustness via Random Perturbations
- 2025Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyond
- 2025Beyond Sharp Minima: Robust LLM Unlearning via Feedback-Guided Multi-Point Optimization
- 2024Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning
- 2025BLUR: A Benchmark for LLM Unlearning Robust to Forget-Retain Overlap
- 2025Keeping an Eye on LLM Unlearning: The Hidden Risk and Remedy
- 2025LLM Unlearning on Noisy Forget Sets: A Study of Incomplete, Rewritten, and Watermarked Data
- 2024LLM Unlearning via Loss Adjustment with Only Forget Data