提出新方法破解多跳知识遗忘难题,提升模型隐私保护能力
Breaking Chains: Unraveling the Links in Multi-Hop Knowledge Unlearning
- 将多跳问题拆解为子问题,利用模型不确定性增强遗忘效果
- 实验证明可有效清除中间跳步被遗忘后的关联知识
- 兼容现有遗忘技术,适合需精准删除数据的场景
大型语言模型常包含个人或受版权保护的数据,重新训练成本过高,因此发展出多种快速近似遗忘技术以选择性移除知识。以往方法主要通过反转语言建模目标来降低特定词元序列的概率,但对间接引用仍存在漏洞。本文研究发现,当多跳查询中某个中间跳步被遗忘时,现有方法无法完全消除其关联知识。为此,我们提出MUNCH——一种基于不确定性的简单方法,将多跳查询分解为子问题,并利用被遗忘模型在最终决策中的不确定性实现更彻底的遗忘。实验表明该框架有效,且可轻松集成至现有遗忘技术中,具备良好的灵活性与实用性。
原文摘要 · Abstract (English)
Large language models (LLMs) serve as giant information stores, often including personal or copyrighted data, and retraining them from scratch is not a viable option. This has led to the development of various fast, approximate unlearning techniques to selectively remove knowledge from LLMs. Prior research has largely focused on minimizing the probabilities of specific token sequences by reversing the language modeling objective. However, these methods still leave LLMs vulnerable to adversarial attacks that exploit indirect references. In this work, we examine the limitations of current unlearning techniques in effectively erasing a particular type of indirect prompt: multi-hop queries. Our findings reveal that existing methods fail to completely remove multi-hop knowledge when one of the intermediate hops is unlearned. To address this issue, we propose MUNCH, a simple uncertainty-based approach that breaks down multi-hop queries into subquestions and leverages the uncertainty of the unlearned model in final decision-making. Empirical results demonstrate the effectiveness of our framework, and MUNCH can be easily integrated with existing unlearning techniques, making it a flexible and useful solution for enhancing unlearning processes.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。