arXiv:2410.04144cs.LGcs.CR2024-10被引 9

ConDa让联邦学习模型快速删除用户数据,无需重训且不增加计算负担。

ConDa: Fast Federated Unlearning with Contribution Dampening

  • 通过追踪客户端对全局模型的影响参数,针对性减弱其贡献。
  • 在MNIST、CIFAR10、CIFAR100上比现有方法快100倍以上。
  • 适合需要快速合规删除用户数据的隐私敏感场景。

联邦学习(FL)使分散的数据源可协作训练模型。尽管新增参与者无技术难题,但移除某参与方及其数据仍具挑战。为此,联邦遗忘(federated unlearning)应运而生,旨在不损害剩余数据性能的前提下,从全局模型中清除特定用户信息。现有方法多依赖重训或高成本计算,效率低下。本文提出贡献衰减(ConDa)框架,通过识别每个客户端对全局模型的影响参数,并对受遗忘客户端影响的参数进行突触衰减,实现高效遗忘。该方法无需客户端数据,也不需重训,且不增加客户端或服务器端的计算开销。在多个数据集上的实验表明,ConDa能有效遗忘客户端数据,在MNIST、CIFAR10和CIFAR100上速度优于最先进方法至少100倍。研究聚焦非独立同分布(non-IID)设置,这是遗忘任务的最大挑战。此外,通过后门攻击与成员推断攻击验证了其鲁棒性。本工作有望成为满足法律与伦理要求的关键组件。

原文摘要 · Abstract (English)

Federated learning (FL) has enabled collaborative model training across decentralized data sources or clients. While adding new participants to a shared model does not pose great technical hurdles, the removal of a participant and their related information contained in the shared model remains a challenge. To address this problem, federated unlearning has emerged as a critical research direction, seeking to remove information from globally trained models without harming the model performance on the remaining data. Most modern federated unlearning methods use costly approaches such as the use of remaining clients data to retrain the global model or methods that would require heavy computation on client or server side. We introduce Contribution Dampening (ConDa), a framework that performs efficient unlearning by tracking down the parameters which affect the global model for each client and performs synaptic dampening on the parameters of the global model that have privacy infringing contributions from the forgetting client. Our technique does not require clients data or any kind of retraining and it does not put any computational overhead on either the client or server side. We perform experiments on multiple datasets and demonstrate that ConDa is effective to forget a client's data. In experiments conducted on the MNIST, CIFAR10, and CIFAR100 datasets, ConDa proves to be the fastest federated unlearning method, outperforming the nearest state of the art approach by at least 100x. Our emphasis is on the non-IID Federated Learning setting, which presents the greatest challenge for unlearning. Additionally, we validate ConDa's robustness through backdoor and membership inference attacks. We envision this work as a crucial component for FL in adhering to legal and ethical requirements.

联邦学习模型遗忘隐私保护

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