Noise Resilient Over-The-Air Federated Learning In Heterogeneous Wireless Networks
Not on the map. Why?
Abstract (arXiv)
In 6G wireless networks, Artificial Intelligence (AI)-driven applications demand the adoption of Federated Learning (FL) to enable efficient and privacy-preserving model training across distributed devices. Over-The-Air Federated Learning (OTA-FL) exploits the superposition property of multiple access channels, allowing edge users in 6G networks to efficiently share spectral resources and perform low-latency global model aggregation. However, these advantages come with challenges, as traditional OTA-FL techniques suffer due to the joint effects of Additive White Gaussian Noise (AWGN) at the server, fading, and both data and system heterogeneity at the participating edge devices. In this work, we propose the novel Noise Resilient Over-the-Air Federated Learning (NoROTA-FL) framework to jointly tackle these challenges in federated wireless networks. In NoROTA-FL, the local optimization problems find controlled inexact solutions, which manifests as an additional proximal constraint at the clients. This approach provides robustness against straggler-induced partial work, heterogeneity, noise, and fading. From a theoretical perspective, we leverage the zeroth- and first-order inexactness and establish convergence guarantees for non-convex optimization problems in the presence of heterogeneous data and varying system capabilities. Experimentally, we validate NoROTA-FL on real-world datasets, including FEMNIST, CIFAR10, and CIFAR100, demonstrating its robustness in noisy and heterogeneous environments. Compared to state-of-the-art baselines such as COTAF and FedProx, NoROTA-FL achieves significantly more stable convergence and higher accuracy, particularly in the presence of stragglers.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 25 Mar 2025.
Builds on
24 of 33 references.
References · 24
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
- 2018LEAF: A Benchmark for Federated Settingscited by 780
- 2018Federated Learning via Over-the-Air Computationcited by 215
- 2018Broadband Analog Aggregation for Low-Latency Federated Edge Learning (Extended Version)cited by 186
- 2020FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity to Non-IID Datacited by 143
- 2020Federated Learning for Internet of Things: Recent Advances, Taxonomy, and Open Challengescited by 138
- 2021Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradientscited by 122
12 more
- 2020Over-the-Air Federated Learning from Heterogeneous Datacited by 72
- 2021Federated Learning: A Signal Processing Perspectivecited by 49
- 20216G Internet of Things: A Comprehensive Surveycited by 39
- 2022On Convergence of FedProx: Local Dissimilarity Invariant Bounds, Non-smoothness and Beyondcited by 37
- 2019Robust Federated Learning with Noisy Communicationcited by 33
- 2020Federated Learning for Channel Estimation in Conventional and RIS-Assisted Massive MIMOcited by 23
- 2023Over-The-Air Federated Learning: Status Quo, Open Challenges, and Future Directionscited by 21
- 2020Straggler-aware Distributed Learning: Communication Computation Latency Trade-offcited by 15
- 2023LASER: Linear Compression in Wireless Distributed Optimizationcited by 6
- 2022A Demonstration of Over-the-Air Computation for Federated Edge Learningcited by 4
- 2022A Convergence Theory for Federated Average: Beyond Smoothnesscited by 4
- 2023Distributed Convex Optimization "Over-the-Air" in Dynamic Environmentscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.