Abstract

Distributed Stein Variational Gradient Descent (DSVGD) is a non-parametric distributed learning framework for federated Bayesian learning, where multiple clients jointly train a machine learning model by communicating a number of non-random and interacting particles with the server. Since communication resources are limited, selecting the clients with most informative local learning updates can improve the model convergence and communication efficiency. In this paper, we propose a client selection scheme for DSVGD based on Hilbert Inner Product (HIP). We derive the upper bound on the decrease of the global free energy per iteration, which is then minimized to speed up the model convergence. We evaluate and compare our scheme with conventional schemes in terms of model accuracy, convergence speed, and stability using various learning tasks and datasets.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call