A synthetic dataset containing fake private information is constructed and a white-box auditing framework is proposed to systematically assess whether claimed-forgotten information is genuinely removed and finds that a simpleverse greedy decoding -- selecting the least likely token at each step -- can recover supposedly forgotten private information.
Abstract
Large language models (LLMs) can memorize sensitive information, raising serious privacy concerns. Machine unlearning offers a potential solution to remove such information, but it remains unclear whether existing methods truly erase it or merely hide it within the model. A key challenge is quantifying the persistence of sensitive data under a unified evaluation framework. To address this, we construct a synthetic dataset containing fake private information and propose a white-box auditing framework to systematically assess whether claimed-forgotten information is genuinely removed. Using this framework, we evaluate five existing unlearning methods and find that a simple"inverse greedy"decoding -- selecting the least likely token at each step -- can recover supposedly forgotten private information. Our results reveal that current unlearning approaches often fail to fully eliminate sensitive information, highlighting the need for more reliable methods to ensure privacy in deployed LLMs.
This work proposes ReGap, a data-free attack that recovers private associations using task structure, filters them by answer-token likelihood, and updates the target model via low-rank adaptation, which requires neither target answers nor auxiliary genuine private supervision.
Jian-Hong Li, Jia-Hao Chen, Yuwen Pu et al.· 0 citations
Modern large language models (LLMs) are trained on massive, largely unfiltered datasets, including content scraped from nearly every accessible website and user inputs. As a result, LLMs often memorize and reproduce personally sensitive information (PSI) such as birth dates, phone numbers, and home addresses. This lead...
Anna Yoo Jeong Ha, Ronik Bhaskar, Hai-Tao Zheng et al.· 0 citations
The Dynamic Relational Unlearning Framework (DRUF) is proposed which comprises a Relational Decoupling Unlearning (RDU) module and a dynamic set update mechanism that suppresses the leakage of high-risk field pairs while preserving KIE performance.
Bei-Ning Xu, Hairui Wang, Jiaxin Wang et al.· 0 citations
TRAP, a one-sided penalty on tokenwise TRA that acts only where the target model pulls ahead of its reference, brings memorization near the level of an untrained model at little utility cost, where generic regularizers barely move and differential privacy gives up most of what fine-tuning bought.
Muhammed Ustaomeroglu, Zi-Yue Xu, Han-Shen Xiao et al.· 0 citations
Leakage enables two practical attacks: a trained classifier that infers semantic predicates about user memories from routine natural-language outputs, and an RL-trained adversary that extracts full Social Security Numbers from a production-style agent.
Jaiden Fairoze, Neal Mangaokar, Kamalika Chaudhuri et al.· 0 citations
Strong standard-metric performance alone is insufficient to establish robustness after unlearning and motivate adversarial stress-testing as a complementary component of unlearning evaluation, showing a substantial gap between clean-query forgetting and adversarial robustness.
A. Gupta, Hima Varshini Surisetty, Sreevidya Bollineni et al.· 1 citation
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.