Soft Token Attacks Cannot Reliably Audit Unlearning in Large Language Models
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Large language models (LLMs) are trained using massive datasets, which often contain undesirable content such as harmful texts, personal information, and copyrighted material. To address this, machine unlearning aims to remove information from trained models. Recent work has shown that soft token attacks (STA) can successfully extract unlearned information from LLMs, but in this work we show that STAs can be an inadequate tool for auditing unlearning. Using common benchmarks such as Who Is Harry Potter? and TOFU, we demonstrate that in a strong auditor setting such attacks can elicit any information from the LLM, regardless of the deployed unlearning algorithm or whether the queried content was originally present in the training corpus. We further show that STA with just a few soft tokens (1-10) can elicit random strings over 400 characters long, indicating that STAs must be used carefully to effectively audit unlearning. Example code can be found at: https://github.com/IntelLabs/LLMart/tree/main/examples/unlearning
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 30 of its 51 references that are in the map. First posted on arXiv 20 Feb 2025.
Builds on
30 of 51 references.
Closest ancestors · 13
Same direction, newest first
- 2024Does Unlearning Truly Unlearn? A Black Box Evaluation of LLM Unlearning Methods18 Nov
- 2024MUSO: Achieving Exact Machine Unlearning in Over-Parameterized Regimes11 Oct
- 2024An Adversarial Perspective on Machine Unlearning for AI Safety26 Sep
- 2024On Effects of Steering Latent Representation for Large Language Model Unlearning12 Aug
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Models8 Jul
- 2024REVS: Unlearning Sensitive Information in Language Models via Rank Editing in the Vocabulary Space13 Jun
- 2024Large Language Model Unlearning via Embedding-Corrupted Prompts12 Jun
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
- 2024Eight Methods to Evaluate Robust Unlearning in LLMs26 Feb
- 2024TOFU: A Task of Fictitious Unlearning for LLMs11 Jan
- 2023Who's Harry Potter? Approximate Unlearning in LLMs3 Oct
- 2022Verifiable and Provably Secure Machine Unlearning17 Oct
Other references · 17
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 2,914
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2023The Rise and Potential of Large Language Model Based Agents: A Surveycited by 1,422
- 2022Mass-Editing Memory in a Transformercited by 976
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 488
5 more
- 2024Improving Alignment and Robustness with Circuit Breakerscited by 302
- 2020Approximate Data Deletion from Machine Learning Modelscited by 250
- 2021Dataset Inference: Ownership Resolution in Machine Learningcited by 115
- 2024Soft Prompt Threats: Attacking Safety Alignment and Unlearning in Open-Source LLMs through the Embedding Spacecited by 88
- 2024On Evaluating the Durability of Safeguards for Open-Weight LLMscited by 51
Built on by
Citing papers per year: 2025: 2.
2 papers.