Optimal Distributed Learning with Multi-pass Stochastic Gradient Methods

We study generalization properties of distributed algorithms in the setting of nonparametric regression over a reproducing kernel Hilbert space (RKHS). We investigate distributed stochastic gradient methods (SGM), with mini-batches and multi-passes over the data. We show that optimal generalization error bounds can be retained for distributed SGM provided that the partition level is not too large. Our results are superior to the state-of-the-art theory, covering the cases that the regression function may not be in the hypothesis spaces. Particularly, our results show that distributed SGM has a smaller theoretical computational complexity, compared with distributed kernel ridge regression (KRR) and classic SGM.

Published in:
Proceedings of the 35th International Conference on Machine Learning
Presented at:
35th International Conference on Machine Learning, Stockholm, Sweden, July 10 -15, 2018
Jun 08 2018

Note: The status of this file is: Anyone

 Record created 2018-06-08, last modified 2020-10-24

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)