English

How Many Machines Can We Use in Parallel Computing for Kernel Ridge Regression?

Statistics Theory 2019-02-26 v3 Machine Learning Statistics Theory

Abstract

This paper aims to solve a basic problem in distributed statistical inference: how many machines can we use in parallel computing? In kernel ridge regression, we address this question in two important settings: nonparametric estimation and hypothesis testing. Specifically, we find a range for the number of machines under which optimal estimation/testing is achievable. The employed empirical processes method provides a unified framework, that allows us to handle various regression problems (such as thin-plate splines and nonparametric additive regression) under different settings (such as univariate, multivariate and diverging-dimensional designs). It is worth noting that the upper bounds of the number of machines are proven to be un-improvable (upto a logarithmic factor) in two important cases: smoothing spline regression and Gaussian RKHS regression. Our theoretical findings are backed by thorough numerical studies.

Cite

@article{arxiv.1805.09948,
  title  = {How Many Machines Can We Use in Parallel Computing for Kernel Ridge Regression?},
  author = {Meimei Liu and Zuofeng Shang and Guang Cheng},
  journal= {arXiv preprint arXiv:1805.09948},
  year   = {2019}
}

Comments

This work extends the work in arXiv:1512.09226 to random and multivariate design

R2 v1 2026-06-23T02:07:53.582Z