提出融合饱和度与重要性重加权的策略,提升大模型数据遗忘效果。
Exploring Criteria of Loss Reweighting to Enhance LLM Unlearning
- 区分数据饱和度与重要性,设计针对性重加权方法。
- 饱和度重加权显著优于重要性重加权,组合效果更佳。
- 适合关注模型数据遗忘、训练优化的研究者。
损失重加权在大语言模型(LLMs)机器遗忘中展现出显著优势,但其具体作用机制尚不明确,最优策略仍待探索。本文识别出损失重加权的两个目标:饱和度(Saturation)——强调优化不足的数据;重要性(Importance)——聚焦对损失最小化影响最大的关键数据。针对两者设计特定重加权策略,并在主流基准上进行广泛实证分析,发现:(i) 饱和度重加权比重要性重加权更具有效性,二者结合可进一步提升性能;(ii) 饱和度倾向于为低似然数据分配更低权重,而重要性则相反;(iii) 权重分布的平滑度与粒度对遗忘效果影响显著。基于此,提出 SatImp,一种融合饱和度与重要性的简单重加权方法。在多个数据集上的实验验证了其有效性,有望弥合现有研究空白并指引未来方向。代码已开源。
原文摘要 · Abstract (English)
Loss reweighting has shown significant benefits for machine unlearning with large language models (LLMs). However, their exact functionalities are left unclear and the optimal strategy remains an open question, thus impeding the understanding and improvement of existing methodologies. In this paper, we identify two distinct goals of loss reweighting, namely, Saturation and Importance -- the former indicates that those insufficiently optimized data should be emphasized, while the latter stresses some critical data that are most influential for loss minimization. To study their usefulness, we design specific reweighting strategies for each goal and evaluate their respective effects on unlearning. We conduct extensive empirical analyses on well-established benchmarks, and summarize some important observations as follows: (i) Saturation enhances efficacy more than importance-based reweighting, and their combination can yield additional improvements. (ii) Saturation typically allocates lower weights to data with lower likelihoods, whereas importance-based reweighting does the opposite. (iii) The efficacy of unlearning is also largely influenced by the smoothness and granularity of the weight distributions. Based on these findings, we propose SatImp, a simple reweighting method that combines the advantages of both saturation and importance. Empirical results on extensive datasets validate the efficacy of our method, potentially bridging existing research gaps and indicating directions for future research. Our code is available at https://github.com/tmlr-group/SatImp.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。