提出新框架提升大模型删数据时的可用性。
A General Framework to Enhance Fine-tuning-based LLM Unlearning
- 用软门控区分需删除数据,用表示微调抑制生成
- 删数据后模型回答能力下降更少,效果显著提升
- 通用性强,适合连续删数据场景,效率高
去学习旨在从大语言模型中移除版权和隐私敏感数据。现有方法多基于微调,可分为梯度上升法(GA-based)和抑制法。但这些方法常导致模型性能下降。本文发现两类方法本质相同:均通过区分目标数据并抑制相关生成来实现去学习。受此启发,提出门控表示去学习(GRUN),包含软门控机制用于识别目标数据,以及基于表示微调(ReFT)的抑制模块,仅调整表示而非模型参数。实验表明,GRUN显著提升去学习效果与模型实用性,且适用于各类微调类方法,兼具高效性与可扩展性,尤其适合连续去学习场景。
原文摘要 · Abstract (English)
Unlearning has been proposed to remove copyrighted and privacy-sensitive data from Large Language Models (LLMs). Existing approaches primarily rely on fine-tuning-based methods, which can be categorized into gradient ascent-based (GA-based) and suppression-based methods. However, they often degrade model utility (the ability to respond to normal prompts). In this work, we aim to develop a general framework that enhances the utility of fine-tuning-based unlearning methods. To achieve this goal, we first investigate the common property between GA-based and suppression-based methods. We unveil that GA-based methods unlearn by distinguishing the target data (i.e., the data to be removed) and suppressing related generations, which is essentially the same strategy employed by suppression-based methods. Inspired by this finding, we introduce Gated Representation UNlearning (GRUN) which has two components: a soft gate function for distinguishing target data and a suppression module using Representation Fine-tuning (ReFT) to adjust representations rather than model parameters. Experiments show that GRUN significantly improves the unlearning and utility. Meanwhile, it is general for fine-tuning-based methods, efficient and promising for sequential unlearning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。