all AI news
Matching Pursuit Based Scheduling for Over-the-Air Federated Learning. (arXiv:2206.06679v2 [cs.IT] UPDATED)
Oct. 13, 2022, 1:13 a.m. | Ali Bereyhi, Adela Vagollari, Saba Asaad, Ralf R. Müller, Wolfgang Gerstacker, H. Vincent Poor
cs.LG updates on arXiv.org arxiv.org
This paper develops a class of low-complexity device scheduling algorithms
for over-the-air federated learning via the method of matching pursuit. The
proposed scheme tracks closely the close-to-optimal performance achieved by
difference-of-convex programming, and outperforms significantly the well-known
benchmark algorithms based on convex relaxation. Compared to the
state-of-the-art, the proposed scheme poses a drastically lower computational
load on the system: For $K$ devices and $N$ antennas at the parameter server,
the benchmark complexity scales with $\left(N^2+K\right)^3 + N^6$ while the
complexity …
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Engineer
@ Bosch Group | San Luis Potosí, Mexico
DATA Engineer (H/F)
@ Renault Group | FR REN RSAS - Le Plessis-Robinson (Siège)
Advisor, Data engineering
@ Desjardins | 1, Complexe Desjardins, Montréal
Data Engineer Intern
@ Getinge | Wayne, NJ, US
Software Engineer III- Java / Python / Pyspark / ETL
@ JPMorgan Chase & Co. | Jersey City, NJ, United States
Lead Data Engineer (Azure/AWS)
@ Telstra | Telstra ICC Bengaluru