arXiv:2503.05657cs.LGcs.CV2025-03CVPR被引 29

通过权重取反实现高效联邦遗忘,无需存储或访问原始数据。

NoT: Federated Unlearning via Weight Negation

  • 用权重乘以-1的方式扰动模型参数,实现无依赖的遗忘。
  • 在三个数据集上验证,遗忘效果优于现有方法,且通信开销更低。
  • 适合需快速合规删除用户数据的联邦学习场景使用。

联邦遗忘(FU)旨在从训练好的联邦学习(FL)模型中移除特定参与方的数据贡献,保障隐私与合规性。传统方法常依赖客户端或服务器端的额外存储,或需直接访问目标数据——当数据不可用时则难以实施。为此,我们提出NoT,一种基于权重取反(乘以-1)的新颖高效联邦遗忘算法,避免了额外存储和对目标数据的访问需求。我们认为,通过将模型参数扰动至最优解集合之外,同时保持快速再优化的能力,可实现有效且高效的遗忘。该方法虽看似矛盾,但有理论支撑:权重取反能有效破坏层间协同适应,引发遗忘,同时保留近似最优性,支持快速恢复。在三个数据集和三种模型架构上的实验表明,NoT在遗忘效果及通信与计算效率方面显著优于现有基线。

原文摘要 · Abstract (English)

Federated unlearning (FU) aims to remove a participant's data contributions from a trained federated learning (FL) model, ensuring privacy and regulatory compliance. Traditional FU methods often depend on auxiliary storage on either the client or server side or require direct access to the data targeted for removal-a dependency that may not be feasible if the data is no longer available. To overcome these limitations, we propose NoT, a novel and efficient FU algorithm based on weight negation (multiplying by -1), which circumvents the need for additional storage and access to the target data. We argue that effective and efficient unlearning can be achieved by perturbing model parameters away from the set of optimal parameters, yet being well-positioned for quick re-optimization. This technique, though seemingly contradictory, is theoretically grounded: we prove that the weight negation perturbation effectively disrupts inter-layer co-adaptation, inducing unlearning while preserving an approximate optimality property, thereby enabling rapid recovery. Experimental results across three datasets and three model architectures demonstrate that NoT significantly outperforms existing baselines in unlearning efficacy as well as in communication and computational efficiency.

联邦学习隐私保护遗忘机制

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