提出细粒度联邦领域自适应方法,解决新客户端持续加入时的知识发现与融合难题。
Gains: Fine-grained Federated Domain Adaptation in Open Set
- 分离编码器与分类器,分别捕捉域变化与类别增量特征
- 在三种数据偏移场景下,源域与目标域性能均显著优于基线
- 适合需要持续学习新知识的开放环境联邦学习应用
传统联邦学习假设客户端数量固定,但在真实场景中,新客户端会持续加入,带来新知识。这引发两大需求:检测新知识(知识发现)和将其融入全局模型(知识适配)。现有研究多聚焦粗粒度知识发现,常牺牲源域性能与适配效率。为此,我们提出开放集下的细粒度联邦领域适配方法 Gains。Gains 将模型分为编码器与分类器,实证发现编码器特征对域偏移敏感,分类器参数对类别增量敏感。基于此,设计细粒度知识发现与贡献驱动聚合技术,识别并融合新知识;同时引入抗遗忘机制,保护源域性能,实现平衡适配。在跨三个典型数据偏移场景的多域数据集上实验表明,Gains 在源域与目标域客户端上的性能均显著优于其他基线。代码已开源:https://github.com/Zhong-Zhengyi/Gains。
原文摘要 · Abstract (English)
Conventional federated learning (FL) assumes a closed world with a fixed total number of clients. In contrast, new clients continuously join the FL process in real-world scenarios, introducing new knowledge. This raises two critical demands: detecting new knowledge, i.e., knowledge discovery, and integrating it into the global model, i.e., knowledge adaptation. Existing research focuses on coarse-grained knowledge discovery, and often sacrifices source domain performance and adaptation efficiency. To this end, we propose a fine-grained federated domain adaptation approach in open set (Gains). Gains splits the model into an encoder and a classifier, empirically revealing features extracted by the encoder are sensitive to domain shifts while classifier parameters are sensitive to class increments. Based on this, we develop fine-grained knowledge discovery and contribution-driven aggregation techniques to identify and incorporate new knowledge. Additionally, an anti-forgetting mechanism is designed to preserve source domain performance, ensuring balanced adaptation. Experimental results on multi-domain datasets across three typical data-shift scenarios demonstrate that Gains significantly outperforms other baselines in performance for both source-domain and target-domain clients. Code is available at: https://github.com/Zhong-Zhengyi/Gains.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。