dorsal/arxiv
View SchemaBalDRO: A Distributionally Robust Optimization based Framework for Large Language Model Unlearning
| Authors | Pengyang Shao, Naixin Zhai, Lei Chen, Yonghui Yang, Fengbin Zhu, Xun Yang, Meng Wang |
|---|---|
| Categories | |
| ArXiv ID | 2601.09172vv1 |
| URL | https://arxiv.org/abs/2601.09172 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
As Large Language Models (LLMs) increasingly shape online content, removing targeted information from well-trained LLMs (also known as LLM unlearning) has become critical for web governance. A key challenge lies in sample-wise imbalance within the forget set: different samples exhibit widely varying unlearning difficulty, leading to asynchronous forgetting where some knowledge remains insufficiently erased while others become over-forgotten. To address this, we propose BalDRO, a novel and efficient framework for balanced LLM unlearning. BalDRO formulates unlearning as a min-sup process: an inner step identifies a worst-case data distribution that emphasizes hard-to-unlearn samples, while an outer step updates model parameters under this distribution. We instantiate BalDRO via two efficient variants: BalDRO-G, a discrete GroupDRO-based approximation focusing on high-loss subsets, and BalDRO-DV, a continuous Donsker-Varadhan dual method enabling smooth adaptive weighting within standard training pipelines. Experiments on TOFU and MUSE show that BalDRO significantly improves both forgetting quality and model utility over existing methods, and we release code for reproducibility.
{
"annotation_id": "0fc8d7cc-9f9e-4bd0-836d-f7307fd2bfc9",
"date_created": "2026-02-17T05:53:20.069000Z",
"date_modified": "2026-02-17T05:53:20.069000Z",
"file_hash": "9985810ca79f2a5f98711cdde54245db46de869fb85ed609935ad504ed53bd84",
"private": false,
"record": {
"abstract": "As Large Language Models (LLMs) increasingly shape online content, removing targeted information from well-trained LLMs (also known as LLM unlearning) has become critical for web governance. A key challenge lies in sample-wise imbalance within the forget set: different samples exhibit widely varying unlearning difficulty, leading to asynchronous forgetting where some knowledge remains insufficiently erased while others become over-forgotten. To address this, we propose BalDRO, a novel and efficient framework for balanced LLM unlearning. BalDRO formulates unlearning as a min-sup process: an inner step identifies a worst-case data distribution that emphasizes hard-to-unlearn samples, while an outer step updates model parameters under this distribution. We instantiate BalDRO via two efficient variants: BalDRO-G, a discrete GroupDRO-based approximation focusing on high-loss subsets, and BalDRO-DV, a continuous Donsker-Varadhan dual method enabling smooth adaptive weighting within standard training pipelines. Experiments on TOFU and MUSE show that BalDRO significantly improves both forgetting quality and model utility over existing methods, and we release code for reproducibility.",
"arxiv_id": "2601.09172",
"authors": [
"Pengyang Shao",
"Naixin Zhai",
"Lei Chen",
"Yonghui Yang",
"Fengbin Zhu",
"Xun Yang",
"Meng Wang"
],
"categories": [
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "BalDRO: A Distributionally Robust Optimization based Framework for Large Language Model Unlearning",
"url": "https://arxiv.org/abs/2601.09172",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "4ff13676-7161-4306-8546-6b991a2ab75f",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}