Over-the-Air Computation Enabled Semi-Asynchronous Wireless Federated Learning

The emerging field of federated learning (FL) holds significant promise for advancing edge intelligence while preserving data privacy. However, as FL systems scale or become more heterogeneous, challenges such as spectrum scarcity and the straggler problem arise. To address these issues, this paper proposes SA-AirFed, a semi-asynchronous FL architecture compatible with Over-the-Air Computation (AirComp). We develop an efficient scheduling scheme that meets AirComp’s requirements and analyze the factors affecting convergence under the Lipschitz-Smooth condition. Building on insights from the convergence analysis, we design an adaptive algorithm that mitigates staleness from semi-asynchronous aggregation and noise from AirComp by dynamically adjusting aggregation weights, formulated as a convex quadratic programming problem. Experimental results on MNIST and CIFAR-10 demonstrate that SA-AirFed significantly reduces wall-clock training time while achieving greater robustness compared to baseline models.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-06-24
DOI
https://doi.org/10.1109/tcomm.2025.3582727
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Over-the-Air Computation Enabled Semi-Asynchronous Wireless Federated Learning

Arumugam Nallanathan, Hyundong Shin, Yansha Deng, Wenqiang Yi et al.
1 citations
IEEE Transactions on Communications
Privacy-Preserving Technologies in Data
2.48
article

Over-the-Air Computation Enabled Semi-Asynchronous Wireless Federated Learning

Arumugam Nallanathan, Hyundong Shin, Yansha Deng, Wenqiang Yi, Zijian Zheng
article en
1 citations

Abstract

The emerging field of federated learning (FL) holds significant promise for advancing edge intelligence while preserving data privacy. However, as FL systems scale or become more heterogeneous, challenges such as spectrum scarcity and the straggler problem arise. To address these issues, this paper proposes SA-AirFed, a semi-asynchronous FL architecture compatible with Over-the-Air Computation (AirComp). We develop an efficient scheduling scheme that meets AirComp’s requirements and analyze the factors affecting convergence under the Lipschitz-Smooth condition. Building on insights from the convergence analysis, we design an adaptive algorithm that mitigates staleness from semi-asynchronous aggregation and noise from AirComp by dynamically adjusting aggregation weights, formulated as a convex quadratic programming problem. Experimental results on MNIST and CIFAR-10 demonstrate that SA-AirFed significantly reduces wall-clock training time while achieving greater robustness compared to baseline models.

IEEE Transactions on CommunicationsVol. 73(10)
University of Essex (GB), Queen Mary University of London (GB), Kyung Hee University (KR), King's College School (GB)
Engineering and Physical Sciences Research Council
Openalex Percentile: Top 10%
Privacy-Preserving Technologies in Data
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.