Optimizing Federated Learning on Non-IID Data with Reinforcement Learning

Hao Wang, Zakhary Kaplan, Di Niu, Baochun Li

2020 · 958 citations · 20 references

Concepts

TL;DR

Federated learning enables privacy‑preserving training on mobile devices, but limited connectivity and non‑IID data across devices hinder convergence and speed. This work introduces Favor, an experience‑driven framework that selects client devices each round to mitigate non‑IID bias and accelerate convergence. Favor profiles device data distributions from uploaded model weights and employs deep Q‑learning to choose a subset of devices each round, rewarding validation accuracy gains while penalizing extra communication rounds. Experiments in PyTorch show that Favor reduces communication rounds by up to 49 % on MNIST, 23 % on FashionMNIST, and 42 % on CIFAR‑10 compared to Federated Averaging.

Abstract

The widespread deployment of machine learning applications in ubiquitous environments has sparked interests in exploiting the vast amount of data stored on mobile devices. To preserve data privacy, Federated Learning has been proposed to learn a shared model by performing distributed training locally on participating devices and aggregating the local models into a global one. However, due to the limited network connectivity of mobile devices, it is not practical for federated learning to perform model updates and aggregation on all participating devices in parallel. Besides, data samples across all devices are usually not independent and identically distributed (IID), posing additional challenges to the convergence and speed of federated learning. In this paper, we propose Favor, an experience-driven control framework that intelligently chooses the client devices to participate in each round of federated learning to counterbalance the bias introduced by non-IID data and to speed up convergence. Through both empirical and mathematical analysis, we observe an implicit connection between the distribution of training data on a device and the model weights trained based on those data, which enables us to profile the data distribution on that device based on its uploaded model weights. We then propose a mechanism based on deep Q-learning that learns to select a subset of devices in each communication round to maximize a reward that encourages the increase of validation accuracy and penalizes the use of more communication rounds. With extensive experiments performed in PyTorch, we show that the number of communication rounds required in federated learning can be reduced by up to 49% on the MNIST dataset, 23% on FashionMNIST, and 42% on CIFAR-10, as compared to the Federated Averaging algorithm.

References

20