Papers › Byzantine-Resilient Federated Machine Learning via Over-the-Air Computation

Byzantine-Resilient Federated Machine Learning via Over-the-Air Computation

23 May 2021arXiv:2105.10883links table onlyarchive 2025-07-28

Shaoming Huang, Yong Zhou, Ting Wang, Yuanming Shi

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Federated learning (FL) is recognized as a key enabling technology to provide intelligent services for future wireless networks and industrial systems with delay and privacy guarantees. However, the performance of wireless FL can be significantly degraded by Byzantine attack, such as data poisoning attack, model poisoning attack and free-riding attack. To design the Byzantine-resilient FL paradigm in wireless networks with limited radio resources, we propose a novel communication-efficient robust model aggregation scheme via over-the-air computation (AirComp). This is achieved by applying the Weiszfeld algorithm to obtain the smoothed geometric median aggregation against Byzantine attack. The additive structure of the Weiszfeld algorithm is further leveraged to match the signal superposition property of multiple-access channels via AirComp, thereby expediting the communication-efficient secure aggregation process of FL. Numerical results demonstrate the robustness against Byzantine devices and good learning performance of the proposed approach.

PaperPDFCode

Code

goldenBill/Byzantine_AirComp officialmentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections