解决联邦学习中少数类难标注问题,提升极端非独立同分布场景下的模型性能。
Federated Active Learning Under Extreme Non-IID and Global Class Imbalance
- 根据数据分布动态选择全局或本地查询模型,提升采样公平性。
- 通过原型引导伪标签和双阶段采样策略,显著改善少数类识别效果。
- 适用于医疗、金融等存在严重类别不平衡的隐私敏感场景。
联邦主动学习(FAL)旨在隐私约束下降低标注成本,但在存在严重全局类别不平衡和高度异质客户端的真实场景中,其性能显著下降。本文系统研究了FAL中的查询-模型选择问题,发现:能实现更均衡采样(尤其是对少数类)的模型,最终性能更优。当全局分布极不平衡且客户端数据相对同质时,使用全局模型查询更有效;否则应优先采用本地模型。基于此,提出FairFAL——一种自适应的公平联邦主动学习框架。该方法(1)通过轻量级预测差异推断全局不平衡与本地-全局差异,实现全局/本地查询模型的自适应选择;(2)利用全局特征进行原型引导的伪标签生成,促进类别感知的查询;(3)采用两阶段不确定性-多样性平衡采样策略,并结合k-center优化。在五个基准数据集上的实验表明,FairFAL在长尾和非独立同分布条件下均持续优于现有最先进方法。代码已公开于https://github.com/chenchenzong/FairFAL。
原文摘要 · Abstract (English)
Federated active learning (FAL) seeks to reduce annotation cost under privacy constraints, yet its effectiveness degrades in realistic settings with severe global class imbalance and highly heterogeneous clients. We conduct a systematic study of query-model selection in FAL and uncover a central insight: the model that achieves more class-balanced sampling, especially for minority classes, consistently leads to better final performance. Moreover, global-model querying is beneficial only when the global distribution is highly imbalanced and client data are relatively homogeneous; otherwise, the local model is preferable. Based on these findings, we propose FairFAL, an adaptive class-fair FAL framework. FairFAL (1) infers global imbalance and local-global divergence via lightweight prediction discrepancy, enabling adaptive selection between global and local query models; (2) performs prototype-guided pseudo-labeling using global features to promote class-aware querying; and (3) applies a two-stage uncertainty-diversity balanced sampling strategy with k-center refinement. Experiments on five benchmarks show that FairFAL consistently outperforms state-of-the-art approaches under challenging long-tailed and non-IID settings. The code is available at https://github.com/chenchenzong/FairFAL.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。