FedLBW: A Loss-Based Weighting Strategy for Federated Learning on Non-IID Data in Wireless Networks
Summary
This paper proposes FedLBW, a federated learning aggregation strategy that weights client updates by inverse validation loss instead of dataset size, improving accuracy and robustness to non-IID data and client dropouts in wireless networks.
View Cached Full Text
Cached at: 08/10/26, 08:00 AM
# FedLBW: A Loss-Based Weighting Strategy for Federated Learning on Non-IID Data in Wireless Networks Source: [https://arxiv.org/abs/2608.07007](https://arxiv.org/abs/2608.07007) [View PDF](https://arxiv.org/pdf/2608.07007) > Abstract:Federated Learning \(FL\) enables collaborative machine learning \(ML\) across distributed clients while preserving privacy\. However, efficient model convergence in FL remains challenging, especially in wireless networks where non\-independent and identically distributed \(non\-IID\) data and frequent client dropouts are common\. Traditional FL algorithms, such as FedAvg, rely solely on dataset size to weight client updates\. This introduces biases towards clients with larger datasets and makes the process sensitive to non\-IID data, outliers, and client dropouts\. To address these challenges, we propose Federated Learning with Loss\-Based Weighting \(FedLBW\), a novel aggregation method that assigns each client's update a weight proportional to the inverse of its validation loss, computed using a small proxy dataset on the server, rather than its dataset size\. This ensures that lower\-loss models exert greater influence during aggregation, prioritizing the most reliable updates and boosting overall performance\. Through extensive experiments across multiple datasets, including FashionMNIST \(CNN\), CIFAR\-10 \(ResNet\-18\), and CIFAR\-100 \(ResNet\-34\), we demonstrate that FedLBW achieves higher accuracy and faster convergence compared to baseline algorithms such as FedAvg, FedAvgM, FedProx, FedNova, FedLAW and FedDkw, with notable improvements of up to 7\.6 % higher accuracy on CIFAR\-10 in extreme non\-IID cases\. Moreover, FedLBW showcases exceptional resilience to increasing dropout probabilities, consistently maintaining significantly higher accuracy even in challenging conditions\. These results establish FedLBW as an effective and resilient solution for FL in wireless network environments, offering marked improvements in model accuracy, convergence speed, and robustness to non\-IID data and client dropouts\. ## Submission history From: Taehong Kim \[[view email](https://arxiv.org/show-email/bfe83162/2608.07007)\] **\[v1\]**Fri, 7 Aug 2026 09:21:37 UTC \(730 KB\)
Similar Articles
FedImp: Enhancing Federated Learning Convergence with Impurity-Based Weighting
FedImp is a novel federated learning algorithm that uses impurity-based weighting to enhance convergence speed in non-IID data settings, showing significant reductions in communication rounds compared to baselines.
FLoKD: Adaptive Knowledge Distillation for Federated Low-Rank LLM over Wireless Networks
The paper proposes FLoKD, an adaptive knowledge-distillation framework for federated LoRA fine-tuning of LLMs over wireless networks, reducing communication overhead by 50-65% while maintaining competitive performance.
FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift
The paper introduces FedeRage, a risk-averse federated learning method that uses conditional value-at-risk to address unknown client participation and heterogeneity, demonstrating enhanced accuracy, fairness, and convergence in experiments.
FedFIbOS: Fisher Importance based Optimal Submodelling for Heterogeneous Federated Learning
FedFIbOS proposes a Fisher importance-based method for optimal submodel selection in heterogeneous federated learning, theoretically grounded and achieving about 10% higher accuracy than state-of-the-art methods under non-IID settings.
SWB-DM: A Calibrated Sliced-Wasserstein-Barycenter Aggregator with Delayed-Momentum Caching for Byzantine-Robust Federated Learning under Partial Participation
The paper introduces SWB-DM, a robust aggregation method for federated learning that combines sliced Wasserstein barycenters with delayed momentum caching to handle Byzantine attacks and partial participation effectively.