Papers › Efficient Wireless Federated Learning via Low-Rank Gradient Factorization

Efficient Wireless Federated Learning via Low-Rank Gradient Factorization

15 Jan 2024arXiv:2401.07496archive 2025-07-28

Mingzhao Guo, Dongzhu Liu, Osvaldo Simeone, Dingzhu Wen

This paper presents a novel gradient compression method for federated learning (FL) in wireless systems. The proposed method centers on a low-rank matrix factorization strategy for local gradient compression that is based on one iteration of a distributed Jacobi successive convex approximation (SCA) at each FL round. The low-rank approximation obtained at one round is used as a "warm start" initialization for Jacobi SCA in the next FL round. A new protocol termed over-the-air low-rank compression (Ota-LC) incorporating this gradient compression method with over-the-air computation and error feedback is shown to have lower computation cost and lower communication overhead, while guaranteeing the same inference performance, as compared with existing benchmarks. As an example, when targeting a test accuracy of 70% on the Cifar-10 dataset, Ota-LC reduces total communication costs by at least 33% compared to benchmark schemes.

PaperPDFCode

Code

mingzhaoguo/ota-lc officialmentioned in paperpytorch 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.

Tasks

Federated LearningLow-rank compression

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SCA

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