提出分层遗忘算法,让模型更难被恶意重学恢复敏感信息。
Layered Unlearning for Adversarial Relearning
- 分阶段逐步遗忘数据,每阶段只保留部分训练数据
- 在多种方法下提升对抗性重学攻击的鲁棒性
- 揭示后训练修改易被绕过的深层机制
本文旨在理解微调、对齐和遗忘等后训练方法如何改变语言模型的行为与表征。特别关注这些修改的脆弱性——容易通过提示工程或重学被绕过。近期研究指出,后训练会引入浅层、依赖上下文的“电路”来抑制特定响应模式,这可能是脆弱性的原因。为此,我们设计了分层遗忘(Layered Unlearning, LU)算法:在第 i 个阶段(共 k 阶段),仅遗忘前 i 折数据,保留剩余 k−i 折数据,从而限制重学从子集恢复完整数据的能力。通过合成实验和大模型实验验证,LU 在多种遗忘方法中均提升了对抗重学的鲁棒性。结果推进了机器遗忘的前沿,并为后训练更新的影响提供了新见解。
原文摘要 · Abstract (English)
Our goal is to understand how post-training methods, such as fine-tuning, alignment, and unlearning, modify language model behavior and representations. We are particularly interested in the brittle nature of these modifications that makes them easy to bypass through prompt engineering or relearning. Recent results suggest that post-training induces shallow context-dependent ``circuits'' that suppress specific response patterns. This could be one explanation for the brittleness of post-training. To test this hypothesis, we design an unlearning algorithm, Layered Unlearning (LU), that creates distinct inhibitory mechanisms for a growing subset of the data. By unlearning the first $i$ folds while retaining the remaining $k - i$ at the $i$th of $k$ stages, LU limits the ability of relearning on a subset of data to recover the full dataset. We evaluate LU through a combination of synthetic and large language model (LLM) experiments. We find that LU improves robustness to adversarial relearning for several different unlearning methods. Our results contribute to the state-of-the-art of machine unlearning and provide insight into the effect of post-training updates.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。