Affiliation:
1. School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China
2. Intelligent System Science and Technology Innovation Center, Longmen Laboratory, Luoyang 471023, China
3. Sports Big Data Center, Department of Physical Education, Zhengzhou University, Zhengzhou 450001, China
Abstract
Federated learning, as a distributed machine learning framework, aims to protect data privacy while addressing the issue of data silos by collaboratively training models across multiple clients. However, a significant challenge to federated learning arises from the non-independent and identically distributed (non-iid) nature of data across different clients. non-iid data can lead to inconsistencies between the minimal loss experienced by individual clients and the global loss observed after the central server aggregates the local models, affecting the model’s convergence speed and generalization capability. To address this challenge, we propose a novel federated learning algorithm based on update bias (FedUB). Unlike traditional federated learning approaches such as FedAvg and FedProx, which independently update model parameters on each client before direct aggregation to form a global model, the FedUB algorithm incorporates an update bias in the loss function of local models—specifically, the difference between each round’s local model updates and the global model updates. This design aims to reduce discrepancies between local and global updates, thus aligning the parameters of locally updated models more closely with those of the globally aggregated model, thereby mitigating the fundamental conflict between local and global optima. Additionally, during the aggregation phase at the server side, we introduce a metric called the bias metric, which assesses the similarity between each client’s local model and the global model. This metric adaptively sets the weight of each client during aggregation after each training round to achieve a better global model. Extensive experiments conducted on multiple datasets have confirmed the effectiveness of the FedUB algorithm. The results indicate that FedUB generally outperforms methods such as FedDC, FedDyn, and Scaffold, especially in scenarios involving partial client participation and non-iid data distributions. It demonstrates superior performance and faster convergence in tasks such as image classification.
Funder
National Natural Science Foundation of China
Major Science and Technology Projects of Longmen Laboratory
Key Scientific Research Project in Colleges and Universities of Henan Province of China
Key Science and Technology Project of Henan Province of China
Henan University of Science and Technology Student Innovation Key Project
Reference42 articles.
1. Big data for development: A review of promises and challenges;Hilbert;Dev. Policy Rev.,2016
2. Artificial intelligence: A survey on evolution, models, applications and future trends;Lu;J. Manag. Anal.,2019
3. Stergiou, C.L., Plageras, A.P., Psannis, K.E., and Gupta, B.B. (2020). Handbook of Computer Networks and Cyber Security: Principles and Paradigms, Springer.
4. Cybersecurity Architecture for the Cloud: Protecting Network in a Virtual Environment;Mughal;Int. J. Intell. Autom. Comput.,2021
5. Design and validation of a non-parasitic 2R1T parallel hand-held prostate biopsy robot with remote center of motion;Jiang;J. Mech. Robot.,2024