arXiv:2411.02622cs.LGcs.AI2024-11

提出自适应概率方法,高效且安全地让模型遗忘特定数据。

AdaProb: Efficient Machine Unlearning via Adaptive Probability

  • 用均匀分布的伪概率替换目标数据输出,提升遗忘效果。
  • 遗忘误差降低超20%,计算时间少于50%的现有方法。
  • 增强隐私保护,有效抵御成员推理攻击,适合合规场景。

机器遗忘使训练好的模型能够遗忘特定数据,对处理错误数据和遵守GDPR等隐私法规至关重要。尽管已有进展,现有方法仍面临两个核心挑战:模型中可能残留未删除数据的信息,且有效数据移除带来的计算开销较高。为此,我们提出自适应概率近似遗忘(AdaProb),一种高效且隐私友好的遗忘新方法。该方法首先将神经网络最后一层输出的概率替换为待遗忘数据的伪概率,这些伪概率服从均匀分布以最大化遗忘效果,并通过优化使其与模型整体分布对齐,从而增强隐私性并降低成员推理攻击风险。随后,相应更新模型权重。大量实验表明,该方法在遗忘误差上优于最先进方法超过20%,对成员推理攻击的防护更佳,且计算时间不足现有方法的50%。

原文摘要 · Abstract (English)

Machine unlearning, enabling a trained model to forget specific data, is crucial for addressing erroneous data and adhering to privacy regulations like the General Data Protection Regulation (GDPR)'s "right to be forgotten". Despite recent progress, existing methods face two key challenges: residual information may persist in the model even after unlearning, and the computational overhead required for effective data removal is often high. To address these issues, we propose Adaptive Probability Approximate Unlearning (AdaProb), a novel method that enables models to forget data efficiently and in a privacy-preserving manner. Our method firstly replaces the neural network's final-layer output probabilities with pseudo-probabilities for data to be forgotten. These pseudo-probabilities follow a uniform distribution to maximize unlearning, and they are optimized to align with the model's overall distribution to enhance privacy and reduce the risk of membership inference attacks. Then, the model's weights are updated accordingly. Through comprehensive experiments, our method outperforms state-of-the-art approaches with over 20% improvement in forgetting error, better protection against membership inference attacks, and less than 50% of the computational time.

机器遗忘隐私保护高效算法

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。