提出一种高效保持性能的机器遗忘方法,实现精准删记忆不丢能力。
Efficient Utility-Preserving Machine Unlearning with Implicit Gradient Surgery
- 将遗忘建模为带约束的优化问题,用单边梯度手术实现
- 仅一次反向传播就完成计算,比现有方法快10倍以上
- 适合需要合规删数据又怕模型变差的场景
机器遗忘旨在高效移除预训练模型中的敏感或有害记忆。核心挑战在于平衡遗忘效果与性能保持之间的权衡:既要删除指定信息,又要维持模型原有性能。现有基于多目标优化的方法虽能求得帕累托最优解,但缺乏精细控制,导致遗忘目标优化不足。本文首次将机器遗忘建模为约束优化问题——在实用性能损失增长受限条件下优化遗忘目标。理论证明该问题等价于对遗忘目标进行单边梯度手术。为解决梯度手术带来的额外计算开销,提出隐式梯度手术方法,仅通过一次反向传播即逼近最优解,实现高效且保性能的机器遗忘。理论分析给出了紧致收敛性证明。大量实验表明,所提方法在遗忘-性能权衡上优于现有基线。代码已开源。
原文摘要 · Abstract (English)
Machine unlearning (MU) aims to efficiently remove sensitive or harmful memory from a pre-trained model. The key challenge is to balance the potential tradeoff between unlearning efficacy and utility preservation, which involves forgetting undesirable information as defined while maintaining the model's original performance. One potential way to tackle this problem is to use multi-objective optimization to jointly optimize both the unlearning and utility preservation objectives. However, existing multi-objective methods only guarantee finding a Pareto-optimal solution without fine-grained control, which causes under-optimization of the unlearning objective. To this end, we first model MU as a constrained optimization problem, that is, optimizing the unlearning objective under the constraint of a bounded increase for utility loss. We then show that solving this optimization problem is equivalent to unilateral gradient surgery on the unlearning objective. To resolve the additional computational cost brought by gradient surgery, we propose an implicit gradient surgery method, which approximates the solution to the aforementioned constrained optimization problem via only one backpropagation, thereby achieving efficient utility-preserving MU. Theoretically, we provide a tight convergence analysis of the algorithm. Empirically, our extensive experiments show that the proposed algorithm achieves better tradeoff results than existing baselines. Codes are available at https://github.com/anseryuer/EUPMU-Efficient-Utility-Preserving-Machine-Unlearning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。