Dynamic Information Fusion for Personalized Federated Learning

The GAO-based federated learning framework with adaptive client selection for resource-efficient edge-IoT systems

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.

FedLEAF: Bi-directional Prototype Adaptation for Heterogeneous Federated Learning

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 clients can contaminate the global aggregation, leading to a vicious cycle of noise accumulation and performance degradation. To address this, we propose FedLEAF, a Federated Learning framework with server-side proactive Evaluation and clientside Adaptive Fusion. Specifically, the server employs an Adaptive Learning Prototypes (ALP) network to dynamically evaluate prototype reliability and generate learnable aggregation weights, ensuring that highquality prototypes exert a primary influence on the global model. Meanwhile, the client utilizes a Historical Consistency Fusion (HCF) strategy to selectively absorb global knowledge by assessing its consistency with locally maintained historical prototypes. Extensive experiments on standard datasets demonstrate that FedLEAF achieves effective improvements in model accuracy and robustness compared to existing methods.

Parameter-Efficient Personalized Federated Learning for Accurate Cellular Traffic Prediction

FedQS: asynchronous federated learning based on queue scheduling

With the rapid development of the Internet of Things (IoT) and edge computing, Federated Learning (FL) has emerged as a promising distributed framework capable of effectively leveraging distributed devices for machine learning tasks while preserving data privacy. However, in practical scenarios characterized by significant device heterogeneity and communication delays, traditional synchronous FL often suffers from inefficiency due to the straggler effect. Although Asynchronous Federated Learning (AFL) has been proposed to mitigate this, it still faces challenges regarding model staleness and training bias, which hinder convergence performance. To address these issues, this paper presents an asynchronous framework named FedQS. First, FedQS employs a multi-dimensional staleness evaluation mechanism that dynamically assesses updates by combining the similarity between local and global models with client latency metrics. Second, to resolve the coupling between training bias and model staleness, we implement a decoupling solution via a queue scheduling algorithm. This algorithm reprocesses high-staleness model parameters on selected faster helper clients using only the helpers’ local private data while preserving the provenance of the original uploading clients, thereby aiming to reduce stale-update effects in aggregation. Finally, during the aggregation phase, the framework recalibrates aggregation weights based on client contributions to reduce training bias and improve global model accuracy. Comparative experiments on Fashion-MNIST and CIFAR-10 datasets demonstrate that FedQS outperforms four evaluated representative baselines—FedAsync, FedBuff, KAFL, and CAFL—achieving an average accuracy improvement of 8.62%.

FedBudget: A Budget-Aware Federated Learning Method for Communication-Constrained Distributed Data Mining

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 pipeline.

Similarity-Aware Personalized Federated Learning in Heterogeneous Environments

Federated Learning (FL) allows decentralized clients to train models collaboratively while preserving data privacy. However, distribution mismatch across clients often leads to poor global generalization and degraded local client-level performance. In such scenarios, some of the clients with their local models trained solely on local data may perform better than the globally learnt model, thus nullifying the benefits of collaborative federated learning. To address this, we propose 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. By incorporating dynamic, client-specific regularization based on both model similarity and output similarity, SAPE-FL adaptively balances global knowledge transfer and peer collaboration while filtering out dissimilar clients. This dual anchoring mitigates negative transfer and enhances robustness in heterogeneous settings. We theoretically analyze our algorithm establishing its convergence guarantees and empirically show that SAPE-FL outperforms state-of-the-art methods under high statistical heterogeneity and low client data regimes.