pFedCal: Lightweight Personalized Federated Learning With Adaptive Calibration Strategy
Federated learning (FL) is a promising artificial intelligence framework that enables clients to collectively train models with data privacy. However, in real-world scenarios, to construct practical FL frameworks, several challenges have to be addressed, including statistical heterogeneity, constrained resources, and fairness. Therefore, we first investigate an <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">aggregation gap</i> caused by statistical heterogeneity during local model initialization, which not only causes additional computational overhead for clients but also leads to the degradation of fairness. To bridge this gap, we propose <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">pFedCal</i>, a novel <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</u>ersonalized <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">fed</u>erated learning with lightweight adaptive <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">cal</u>ibration strategy that performs calibration compensation through the prior knowledge of clients. Specifically, we introduce compensation for each client at the model initialization, with the compensation derived from the global gradient and the latest gradient bias. To enhance the calibration effect, we introduce a smoothing-based calibration strategy, and we design an adaptive calibration strategy. A representative example demonstrates that the proposed calibration and smoothing strategies improve fairness for clients. The theoretical analysis indicates that with an appropriate learning rate, pFedCal converges to a first-order stationary point for non-convex loss functions. Comprehensive experimental results show that pFedCal achieves faster convergence, higher accuracy, and improved fairness than the state-of-the-art methods.
Authors
- Dongshang Deng (ORCID: https://orcid.org/0009-0000-2954-1650)
- Xuangou Wu (ORCID: https://orcid.org/0000-0002-7912-8757)
- Minrui Xu (ORCID: https://orcid.org/0000-0002-8203-8146)
- Chaocan Xiang (ORCID: https://orcid.org/0000-0002-1473-6006)
- Jiawen Kang (ORCID: https://orcid.org/0000-0002-8218-3490)
- Zhu Han
- Wei Zhao (ORCID: https://orcid.org/0000-0002-8520-2087)
- Dusit Niyato (ORCID: https://orcid.org/0000-0002-7442-7416)
- Tao Zhang (ORCID: https://orcid.org/0000-0002-3366-7640)
Institutions
- Guangdong University of Technology (CN)
- Chongqing University (CN)
- Nanyang Technological University (SG)
- Beijing Jiaotong University (CN)
- University of Houston (US)
- Anhui University of Technology (CN)
Publication Details
- Journal
- IEEE Transactions on Services Computing
- Published
- 2025-03-24
- DOI
- https://doi.org/10.1109/tsc.2025.3553707
- Citations
- 2
- Primary Topic
- Privacy-Preserving Technologies in Data
- Type
- article
- Field-Weighted Citation Impact
- 4.96