Matching Pursuit Based Scheduling for Over-the-Air Federated Learning

by   Ali Bereyhi, et al.

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 (N^2+K)^3 + N^6 while the complexity of the proposed scheme scales with K^p N^q for some 0 < p,q ≤ 2. The efficiency of the proposed scheme is confirmed via numerical experiments on the CIFAR-10 dataset.


page 1

page 2

page 3

page 4


Computational Code-Based Privacy in Coded Federated Learning

We propose a privacy-preserving federated learning (FL) scheme that is r...

Dynamic Clustering and Power Control for Two-Tier Wireless Federated Learning

Federated learning (FL) has been recognized as a promising distributed l...

Bottleneck Time Minimization for Distributed Iterative Processes: Speeding Up Gossip-Based Federated Learning on Networked Computers

We present a novel task scheduling scheme for accelerating computational...

Over-the-Air Federated Learning with Energy Harvesting Devices

We consider federated edge learning (FEEL) among mobile devices that har...

1-Bit Compressive Sensing for Efficient Federated Learning Over the Air

For distributed learning among collaborative users, this paper develops ...

Distributed Learning over a Wireless Network with FSK-Based Majority Vote

In this study, we propose an over-the-air computation (AirComp) scheme f...

Algorithms for Optimizing Fleet Scheduling of Air Ambulances

Proper scheduling of air assets can be the difference between life and d...