Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912209515315200 |
|---|---|
| author | Zhao, Boxin Wang, Lingxiao Liu, Ziqi Zhang, Zhiqiang Zhou, Jun Chen, Chaochao Kolar, Mladen |
| author_facet | Zhao, Boxin Wang, Lingxiao Liu, Ziqi Zhang, Zhiqiang Zhou, Jun Chen, Chaochao Kolar, Mladen |
| contents | Due to the high cost of communication, federated learning (FL) systems need to sample a subset of clients that are involved in each round of training. As a result, client sampling plays an important role in FL systems as it affects the convergence rate of optimization algorithms used to train machine learning models. Despite its importance, there is limited work on how to sample clients effectively. In this paper, we cast client sampling as an online learning task with bandit feedback, which we solve with an online stochastic mirror descent (OSMD) algorithm designed to minimize the sampling variance. We then theoretically show how our sampling method can improve the convergence speed of federated optimization algorithms over the widely used uniform sampling. Through both simulated and real data experiments, we empirically illustrate the advantages of the proposed client sampling algorithm over uniform sampling and existing online learning-based sampling strategies. The proposed adaptive sampling procedure is applicable beyond the FL problem studied here and can be used to improve the performance of stochastic optimization procedures such as stochastic gradient descent and stochastic coordinate descent. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_14332 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback Zhao, Boxin Wang, Lingxiao Liu, Ziqi Zhang, Zhiqiang Zhou, Jun Chen, Chaochao Kolar, Mladen Machine Learning Due to the high cost of communication, federated learning (FL) systems need to sample a subset of clients that are involved in each round of training. As a result, client sampling plays an important role in FL systems as it affects the convergence rate of optimization algorithms used to train machine learning models. Despite its importance, there is limited work on how to sample clients effectively. In this paper, we cast client sampling as an online learning task with bandit feedback, which we solve with an online stochastic mirror descent (OSMD) algorithm designed to minimize the sampling variance. We then theoretically show how our sampling method can improve the convergence speed of federated optimization algorithms over the widely used uniform sampling. Through both simulated and real data experiments, we empirically illustrate the advantages of the proposed client sampling algorithm over uniform sampling and existing online learning-based sampling strategies. The proposed adaptive sampling procedure is applicable beyond the FL problem studied here and can be used to improve the performance of stochastic optimization procedures such as stochastic gradient descent and stochastic coordinate descent. |
| title | Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2112.14332 |