Large Language Model Unlearning via Embedding-Corrupted Prompts
Chris Yuhao Liu, Yaxuan Wang, Jeffrey Flanigan, Yang Liu
TL;DR
This paper introduces Embedding-COrrupted (ECO) Prompts, a lightweight unlearning framework for large language models that imposes an unlearned state during inference without retraining the model. ECO combines a prompt classifier to detect forget-target prompts with embedding-space corruptions learned via zeroth-order optimization to steer outputs toward a retained-like behavior, while preserving performance on benign data. The authors demonstrate near-perfect forgetting with minimal side effects across three knowledge domains (entity leakage, hazardous knowledge, copyrighted content) and show scalability to 100 models from 0.5B to 236B parameters, all without modifying model weights. They also explore thresholding with simple calibration and conformal prediction to robustly decide when to apply corruption, and provide extensive experiments across TOFU, WMDP, MMLU, HP Book, and BBC News benchmarks. The work highlights practical, scalable unlearning for real-world deployments, along with limitations such as API-access dependency and potential risks if the prompt classifier is compromised.
Abstract
Large language models (LLMs) have advanced to encompass extensive knowledge across diverse domains. Yet controlling what a large language model should not know is important for ensuring alignment and thus safe use. However, accurately and efficiently unlearning knowledge from an LLM remains challenging due to the potential collateral damage caused by the fuzzy boundary between retention and forgetting, and the large computational requirements for optimization across state-of-the-art models with hundreds of billions of parameters. In this work, we present \textbf{Embedding-COrrupted (ECO) Prompts}, a lightweight unlearning framework for large language models to address both the challenges of knowledge entanglement and unlearning efficiency. Instead of relying on the LLM itself to unlearn, we enforce an unlearned state during inference by employing a prompt classifier to identify and safeguard prompts to forget. We learn corruptions added to prompt embeddings via zeroth order optimization toward the unlearning objective offline and corrupt prompts flagged by the classifier during inference. We find that these embedding-corrupted prompts not only lead to desirable outputs that satisfy the unlearning objective but also closely approximate the output from a model that has never been trained on the data intended for forgetting. Through extensive experiments on unlearning, we demonstrate the superiority of our method in achieving promising unlearning at \textit{nearly zero side effects} in general domains and domains closely related to the unlearned ones. Additionally, we highlight the scalability of our method to 100 LLMs, ranging from 0.5B to 236B parameters, incurring no additional cost as the number of parameters increases. We have made our code publicly available at \url{https://github.com/chrisliu298/llm-unlearn-eco}.
