Experimental results indicate that the FedIF achieves competitive performance in most evaluated heterogeneous settings and allows FedIF to be combined with other algorithms that improved FedAvg based algorithms.
Abstract
The Internet of Things generates vast amounts of decentralized data, where data heterogeneity presents a significant challenge in federated learning. Many existing personalized federated learning (pFL) approaches prioritize local model accuracy at the expense of global generalization, leading to reduced cost-effectiveness. To address this issue, a federated learning algorithm called Dynamic Information Fusion for Personalized Federated Learning (FedIF) is proposed. Two model heads carrying different information are fused by FedIF to obtain a personalized model fitting local data better. The personalization steps of FedIF are performed after local training in each round of the FedAvg algorithm. This design allows FedIF to be combined with other algorithms that improved FedAvg based algorithms. Comparative and ablation experiments are conducted between FedIF and other state-of-the-art personalized federated learning algorithms. Experimental results indicate that the FedIF achieves competitive performance in most evaluated heterogeneous settings.
The Federated Green Anaconda Optimizer (FedGAO), an innovative FL framework inspired by the behavioral patterns of the Green Anaconda Optimizer (GAO), is proposed, demonstrating superior performance in terms of accuracy, convergence speed, and resource efficiency.
Elahe Eslami, S. A. Shahzadeh Fazeli, J. Abouei et al.· Cluster Computing· 0 citations
Prototype-based knowledge sharing effectively mitigates data and model heterogeneity in federated learning (FL) by exchanging class-level semantic information. However, existing methods typically assume all local prototypes are equally reliable. Consequently, low-quality prototypes from heterogeneous models or dynamic...
Zhi-Yuan Zhu, Si-Yi Deng, Da-Peng Wu et al.· 2026 International Conferenc...· 0 citations
This paper proposes federated clustering with adaptive personalization (FedCAP), a parameter-efficient personalized FL framework that separates cluster-level representation learning from client-level adaptation.
Xing-Yu Tian, Ci-Tong Que, F. Nadeem et al.· 0 citations
An asynchronous framework named FedQS, which employs a multi-dimensional staleness evaluation mechanism that dynamically assesses updates by combining the similarity between local and global models with client latency metrics, and implements a decoupling solution via a queue scheduling algorithm to resolve the coupling...
Jia-Hui Zhou, Fang Li, Tian-Yu Shi et al.· Journal of Cloud Computing· 0 citations
Sensitivity and convergence analyses confirm the robustness of the proposed scheduling mechanism and its stable communication–performance trade-off, indicating that explicit budget-aware participation modeling improves communication efficiency in federated data mining while preserving a simple and compatible training p...
Junhui Song, Afei Li, Ke Li et al.· Applied Sciences· 0 citations
This work proposes SAPE-FL (Similarity-Aware Personalized Federated Learning), a novel personalization framework that anchors each client's model to both the global model and a similarity-weighted peer averaged model that mitigates negative transfer and enhances robustness in heterogeneous settings.
V. ArunKumarA, Sunil Gupta, Ngyuen Dang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.