TOFU: A Task of Fictitious Unlearning for LLMs
By Pratyush Maini, Zhili Feng, Avi Schwarzschild, Zachary Chase Lipton, J. Kolter. arXiv.org, 2024
510 citations recorded by the source corpus.
Large language models trained on massive corpora of data from the web can memorize and reproduce sensitive or private data raising both legal and ethical concerns. Unlearning, or tuning models to forget information present in their training data, provides us with a way to protect private data after training. Although several methods exist for such unlearning, it is unclear to what extent they result in models equivalent to those where the data to be forgotten was never learned in the first place. To address this challenge, we present TOFU, a Task of Fictitious Unlearning, as a benchmark aimed at helping deepen our understanding of unlearning. We offer a dataset of 200 diverse synthetic author profiles, each consisting of 20 question-answer pairs, and a subset of these profiles called the forget set that serves as the target for unlearning. We compile a suite of metrics that work together to provide a holistic picture of unlearning efficacy. Finally, we provide a set of baseline results from existing unlearning algorithms. Importantly, none of the baselines we consider show effective unlearning motivating continued efforts to develop approaches for unlearning that effectively tune models so that they truly behave as if they were never trained on the forget data at all.
Subfields: Artificial Intelligence, General Health Professions
View Paper: https://www.semanticscholar.org/paper/6ef1ab6b6775861b7f6a78343d5b90a15226c654
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
Citations in the corpus
- Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning (2024, methodology): “Notably, the methods proposed in Jang et al. (2022); Yao et al. (2023); Chen & Yang (2023); Maini et al. (2024) are based on gradient ascent (GA) on the loss of the forget set.”