atlas

Research map / Learning theory and algorithms / Sample complexity

Distributed Nonparametric Regression under Communication Constraints

ICML 2018 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Increase total communication so that it remains below the effective dimension for local sample sizeDistributed nonparametric estimation · Sobolev function class, insufficient communication regimeminimax squared ℓ2 risk: (mb)^{-2\alpha}Helped
Allocate communication to estimate each coefficient from multiple machinesDistributed nonparametric estimation · Sobolev function class, intermediate communication regimeminimax squared ℓ2 risk: (mnb)^{-\frac{\alpha}{\alpha+1}}Helped
Increase each machine's communication budget beyond the effective dimension at global noise levelDistributed nonparametric estimation · Sobolev function class, sufficient communication regimeminimax squared ℓ2 risk: (mn)^{-\frac{2\alpha}{2\alpha+1}}Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy