pith. sign in

arxiv: 1711.03149 · v1 · pith:CADJDF3Enew · submitted 2017-11-08 · 🧮 math.ST · stat.ML· stat.TH

An asymptotic analysis of distributed nonparametric methods

classification 🧮 math.ST stat.MLstat.TH
keywords distributedmethodsmodelnonparametricperformanceadaptanalysisasymptotic
0
0 comments X
read the original abstract

We investigate and compare the fundamental performance of several distributed learning methods that have been proposed recently. We do this in the context of a distributed version of the classical signal-in-Gaussian-white-noise model, which serves as a benchmark model for studying performance in this setting. The results show how the design and tuning of a distributed method can have great impact on convergence rates and validity of uncertainty quantification. Moreover, we highlight the difficulty of designing nonparametric distributed procedures that automatically adapt to smoothness.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.