paper-with-me

홈 › Papers

LLM Unlearning Reveals a Stronger-Than-Expected Coreset Effect in Current Benchmarks

2025-04-14 · Soumyadeep Pal, Changsheng Wang, James Diffenderfer, Bhavya Kailkhura, Sijia Liu

Large language model unlearning has become a critical challenge in ensuring safety and controlled model behavior by removing undesired data-model influences from the pretrained model while preserving general utility. Significant recent efforts have been dedicated to developing LLM unlearning benchmarks such as WMDP (Weapons of Mass Destruction Proxy) and MUSE (Machine Unlearning Six-way Evaluation), facilitating standardized unlearning performance assessment and method comparison. Despite their usefulness, we uncover for the first time a novel coreset effect within these benchmarks. Specifically, we find that LLM unlearning achieved with the original (full) forget set can be effectively maintained using a significantly smaller subset (functioning as a "coreset"), e.g., as little as 5% of the forget set, even when selected at random. This suggests that LLM unlearning in these benchmarks can be performed surprisingly easily, even in an extremely low-data regime. We demonstrate that this coreset effect remains strong, regardless of the LLM unlearning method used, such as NPO (Negative Preference Optimization) and RMU (Representation Misdirection Unlearning), the popular ones in these benchmarks. The surprisingly strong coreset effect is also robust across various data selection methods, ranging from random selection to more sophisticated heuristic approaches. We explain the coreset effect in LLM unlearning through a keyword-based perspective, showing that keywords extracted from the forget set alone contribute significantly to unlearning effectiveness and indicating that current unlearning is driven by a compact set of high-impact tokens rather than the entire dataset. We further justify the faithfulness of coreset-unlearned models along additional dimensions, such as mode connectivity and robustness to jailbreaking attacks. Codes are available at https://github.com/OPTML-Group/MU-Coreset.

📄 PDF Abstract BibTeX arXiv:2504.10185

Code (1)

optml-group/mu-coreset 공식 구현 jax

Tasks

Large Language ModelMachine Unlearning

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

GRACE:Gradient-guided Coreset Selection for LLM Unlearning

2026-08-28 · Praveen Bushipaka, Andrea D'Angelo, Lucia Passaro, Tommaso Cucinotta arxiv

Machine Unlearning methods for Large Language Models typically assume pre-specified forget and retain sets. In realistic settings, however, requests may provide only a few examples of undesired behavior, requiring forget…

UPCORE: Utility-Preserving Coreset Selection for Balanced Unlearning

2025-02-20 · Vaidehi Patil, Elias Stengel-Eskin, Mohit Bansal

User specifications or legal frameworks often require information to be removed from pretrained models, including large language models (LLMs). This requires deleting or "forgetting" a set of data points from an already-…

Group-invariant Coresets for Data-efficient Active Learning

2026-07-01 · L. C. Ayres, J. C. M. Bermudez, S. J. M. de Almeida, R. A. Borsoi arxiv

Active learning reduces labeling cost by querying the most informative unlabeled samples, but standard coreset methods ignore known data symmetries and can waste budget on transformed versions of the same instance. We pr…

Active Learning

Erased, but Not Gone: Output Forgetting Is Not True Forgetting

2026-06-23 · Teresa Pui Yee Yong, Win Kent Ong, Chee Seng Chan arxiv

Machine unlearning (MU) is commonly judged by output forgetting, such as low forget-set accuracy or reduced logit-level membership inference. But if output-level success can coexist with retraining-inconsistent residuals…

Stronger Coreset Bounds for Kernel Density Estimators via Chaining

2023-10-12 · Rainie Bozzai, Thomas Rothvoss

We apply the discrepancy method and a chaining approach to give improved bounds on the coreset complexity of a wide class of kernel functions. Our results give randomized polynomial time algorithms to produce coresets of…