兼顾数据量与质量的聚合算法,提升联邦学习模型性能。
Dual-Criterion Model Aggregation in Federated Learning: Balancing Data Quantity and Quality
- 根据数据量和质量双重指标动态加权聚合模型
- 在CIFAR-10和障碍物避让数据集上超越多个主流方法
- 适合数据异构性强的隐私保护协作场景
联邦学习(FL)是保护隐私的协同学习关键方法,通过模型传递实现无需交换本地数据的学习。现有平均聚合算法通常假设所有客户端数据价值相等,或仅依据数据数量分配权重。部分方法虽在聚合后进行本地微调以增强适应性,但忽略了客户端间数据固有的异质性及聚合阶段的数据复杂性,可能导致全局模型次优。为此,本文提出一种基于数据量与质量双重标准的加权聚合算法。具体而言,量化各客户端训练数据量,并在专用数据集上多次进行本地模型推理精度评估,以衡量数据质量。将这两个因素作为权重,通过动态加权求和的方式参与聚合过程。该机制可自适应调整权重,确保无论数据规模或初始质量如何,每个客户端均能有效贡献于全局模型。实验表明,该算法在通用开源数据集CIFAR-10和视觉障碍物避让专用数据集上均优于多个现有先进聚合方法。
原文摘要 · Abstract (English)
Federated learning (FL) has become one of the key methods for privacy-preserving collaborative learning, as it enables the transfer of models without requiring local data exchange. Within the FL framework, an aggregation algorithm is recognized as one of the most crucial components for ensuring the efficacy and security of the system. Existing average aggregation algorithms typically assume that all client-trained data holds equal value or that weights are based solely on the quantity of data contributed by each client. In contrast, alternative approaches involve training the model locally after aggregation to enhance adaptability. However, these approaches fundamentally ignore the inherent heterogeneity between different clients' data and the complexity of variations in data at the aggregation stage, which may lead to a suboptimal global model. To address these issues, this study proposes a novel dual-criterion weighted aggregation algorithm involving the quantity and quality of data from the client node. Specifically, we quantify the data used for training and perform multiple rounds of local model inference accuracy evaluation on a specialized dataset to assess the data quality of each client. These two factors are utilized as weights within the aggregation process, applied through a dynamically weighted summation of these two factors. This approach allows the algorithm to adaptively adjust the weights, ensuring that every client can contribute to the global model, regardless of their data's size or initial quality. Our experiments show that the proposed algorithm outperforms several existing state-of-the-art aggregation approaches on both a general-purpose open-source dataset, CIFAR-10, and a dataset specific to visual obstacle avoidance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。