提出新方法精准删除需遗忘数据的记忆,保护隐私且不损害其他数据效果。
Rethinking Federated Unlearning via the Lens of Memorization

- 通过区分记忆性知识与共享知识,精准定位需删除的冗余参数。
- 在多个数据集上表现接近重训练,消除记忆效果优于现有方法。
- 适合需要合规删除用户数据的联邦学习场景,如医疗、金融应用。
联邦学习日益需要机器遗忘以符合隐私法规。然而,现有联邦遗忘方法可能忽略需遗忘数据与保留数据间的重叠信息,导致遗忘不彻底且客户端间不公平。本文从记忆化视角重新审视联邦遗忘:遗忘应主要移除归属于被遗忘数据的独特记忆内容,同时保留由保留数据也支持的重叠模式。为此,我们提出分组记忆评估(Grouped Memorization Evaluation),一种例级度量,可分离记忆知识与重叠知识。基于此度量,我们设计联邦记忆剪枝(FedMemPrune),一种基于剪枝的遗忘方法,用于重置负责记忆的冗余参数。大量实验表明,FedMemPrune 在性能上接近基于重训练的基准,同时比现有联邦遗忘算法更有效地消除记忆,实现强遗忘性能而不牺牲保留知识的效用。
原文摘要 · Abstract (English)
Federated learning (FL) increasingly needs machine unlearning to comply with privacy regulations. However, existing federated unlearning approaches may overlook the overlapping information between the unlearning and remaining data, leading to ineffective unlearning and unfairness between clients. In this work, we revisit federated unlearning through the lens of memorization. We argue that unlearning should mainly remove the unique memorized information attributable to the data to be forgotten, while preserving overlapping patterns that are also supported by the remaining data. Specifically, we propose Grouped Memorization Evaluation, an example-level metric that separates memorized knowledge from overlapping knowledge. Building on this metric, we introduce Federated Memorization Pruning (FedMemPrune), a pruning-based unlearning approach that resets redundant parameters responsible for memorization. Extensive experiments show that FedMemPrune closely matches retraining-based unlearning baselines while more effectively eliminating memorization than existing federated unlearning algorithms, yielding strong unlearning performance without sacrificing the utility of retained knowledge.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。