Jul 2026· Annual International Computer Software and Applications Conference· pp. 2599-2604· 0 citations· 14 references
Abstract
Federated Learning (FL) has emerged as a promising paradigm for privacy-preserving distributed machine learning across mobile and edge devices. Nevertheless, the presence of non-independent and identically distributed (non-IID) data in wireless networks often leads to severe gradient divergence, slow convergence, and degraded model performance. To mitigate these challenges, this paper proposes FedCoalition, a coalition game-based clustered federated learning framework that organizes clients into collaborative coalitions according to the similarity of their model updates. The proposed method integrates a coalition formation mechanism with similarity-aware clustering to reduce gradient divergence among participating clients. In addition, each coalition designates a Coalition Head (CH) responsible for intra-cluster aggregation and model validation using auxiliary data, thereby improving model reliability and communication efficiency. The experimental results on MNIST and CIFAR-10 under non-IID data distributions demonstrate that FedCoalition significantly improves learning performance, achieving higher accuracy and faster convergence compared with existing clustered federated learning approaches.
A novel algorithm named Group Relative Policy Optimization Based on Hierarchical Mean-Field Theory (OGRPO-HMF) is proposed, which can jointly optimize the local training of nodes and the global model aggregation of servers to comprehensively enhance the efficiency and performance of FEL.
Bing Ai, Yu Sun, Jun Wang et al.· Cognitive Computation· 0 citations
The Internet of Vehicles (IoV) supports essential intelligent transportation applications but encounters challenges in federated learning (FL) due to non-independent and identically distributed (non-IID) data, vehicle mobility, resource heterogeneity, and strict privacy requirements in latency-sensitive scenarios such as misbehavior detection and accident response. Traditional FL methods, such as random client selection and standard FedAvg, often experience slow convergence and reduced performance under non-IID conditions. We introduce a hierarchical federated learning framework for software-defined vehicular fog computing. The framework incorporates FedNova (a normalized-averaging aggregation method for heterogeneous federated optimization) to produce normalized model updates under data heterogeneity, a Reward-Based Payoff Strategy (RBPS) for incentive-aware client selection, and game-theoretic vehicle-aggregator matching based on the college admissions problem. Privacy is strengthened through quantum key distribution (QKD)-assisted secure key establishment and classical gradient masking, with quantum circuit simulation used to assess future enhancements. The three-layer architecture includes vehicles, Roadside Unit (RSU)/ Base Station (BS)-level aggregators, and a Software-Defined Network Controller (SDNC) global aggregator. The framework uses both monetary and service-based incentives, such as toll exemptions, to encourage vehicle participation. Hybrid simulations using OMNeT++, Veins, SUMO, and the VeReMi misbehavior detection dataset show that the proposed approach achieves 94.8% classification accuracy [95% Confidence Interval (CI): 92.7–97.0 over 10 runs], converges in 120 rounds (33% faster than FedAvg), and reduces average latency by 29% (320 ms compared to 450 ms for FedAvg), with statistically significant improvements (p < 0.05). These gains enable faster model adaptation to evolving attacks (5–10 min shorter training cycles) and support real-time safety applications where delays above 400 ms can compromise road safety. Ablation studies confirm the complementary roles of FedNova, RBPS, and matching. Although quantum operations are currently simulated classically, the design remains compatible with future quantum hardware.
Devendra Singh, Dhami, Ngnassi Djami et al.· Frontiers in Artificial Inte...· 0 citations
Nowadays, split federated learning (SFL) has emerged as an effective paradigm for enabling privacy-preserving collaborative intelligence across heterogeneous devices with limited computation. However, SFL incurs significant communication overhead in wireless networks due to the uplink transmission of high-dimensional smashed data, which degrades network efficiency. To mitigate the communication bottleneck, we propose a prototype-based SFL framework ProtoSFL. Specifically, each selected client computes local prototypes for observed classes and uploads them to the server. Based on the received prototypes, the server derives global prototypes and optimizes a weighted objective that combines classification loss with prototype alignment loss. The server then updates the model accordingly and returns personalized prototype gradients to the clients. Simulation results verify the effectiveness of ProtoSFL in reducing communication overhead, achieving a substantial reduction in uplink communication, while maintaining competitive testing accuracy under various heterogeneous data settings compared with SFL baselines.
Over-the-air FL with EH MDs under heterogeneous data distributions under heterogeneous data distributions is studied, and the proposed unified framework improves fairness or personalization, depending on the operating mode, while reducing communication overhead.
F. Bagci, Busra Tegin, Mohammad Kazemi et al.· 0 citations
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
Federated Learning (FL) enables collaborative model training without sharing raw data, but its effectiveness degrades under Non-IID client data and inefficient participation. In such settings, FedAvg may exhibit slow convergence, high variance across rounds, and elevated communication overhead. We propose a clustered ensemble framework to improve training stability and communication efficiency under label-skewed Non-IID distributions. Clients are clustered by data similarity, and one model is trained per cluster. At inference time, we employ a confidence-based ensemble that selects (or combines) cluster models, while adaptive client selection regulates participation within clusters to reduce redundant communication. Experiments on MNIST, Fashion-MNIST, CIFAR-10, and SVHN show more stable learning dynamics and lower communication cost while maintaining competitive accuracy compared to FedAvg. We also analyze how participation policies affect convergence behavior and client fairness.
Artur Sousa Freitas, A. T. Akabane, J. Estrella· International Conference on...· 0 citations