arXiv:2603.13795cs.LGcs.AI2026-03

提出高效联邦遗忘框架,无需客户端数据即可快速移除特定用户影响。

Computation and Communication Efficient Federated Unlearning via On-server Gradient Conflict Mitigation and Expression

  • 服务器端通过梯度冲突缓解实现高效遗忘
  • 时间到遗忘指标显著优于重训练方法
  • 适合注重隐私与计算效率的工业级应用

联邦遗忘(FUL)旨在从已训练的联邦学习模型中移除特定参与者的数据贡献,以保障数据隐私并满足合规要求。然而,由于跨客户端知识不可访问性以及高昂的计算和通信成本,该领域进展受限。为此,我们提出联邦服务器端遗忘(FOUL)框架,包含两个关键阶段:学习-遗忘阶段作为预训练过程,模型识别并编码与被遗忘客户端相关的特征,该阶段通信高效,为后续遗忘奠定基础;随后的服务器端知识聚合阶段在不访问客户端数据的情况下完成遗忘过程,兼顾效率与隐私。我们引入新的数据设置,支持更透明严谨的遗忘评估,并提出新指标‘时间到遗忘’,衡量模型达到最优遗忘性能的速度。在三个数据集上进行的大量实验表明,相较于重训练,FOUL在多种遗忘场景下表现更优,且时间到遗忘显著降低,同时保持低通信与计算开销。

原文摘要 · Abstract (English)

Federated Unlearning (FUL) aims to remove specific participants' data contributions from a trained Federated Learning model, thereby ensuring data privacy and compliance with regulatory requirements. Despite its potential, progress in FUL has been limited due to several challenges, including the cross-client knowledge inaccessibility and high computational and communication costs. To overcome these challenges, we propose Federated On-server Unlearning (FOUL), a novel framework that comprises two key stages. The learning-to-unlearn stage serves as a preparatory learning phase, during which the model identifies and encodes the key features associated with the forget clients. This stage is communication-efficient and establishes the basis for the subsequent unlearning process. Subsequently, on-server knowledge aggregation phase aims to perform the unlearning process at the server without requiring access to client data, thereby preserving both efficiency and privacy. We introduce a new data setting for FUL, which enables a more transparent and rigorous evaluation of unlearning. To highlight the effectiveness of our approach, we propose a novel evaluation metric termed time-to-forget, which measures how quickly the model achieves optimal unlearning performance. Extensive experiments conducted on three datasets under various unlearning scenarios demonstrate that FOUL outperforms the Retraining in FUL. Moreover, FOUL achieves competitive or superior results with significantly reduced time-to-forget, while maintaining low communication and computation costs.

联邦学习数据遗忘隐私保护高效算法

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