atlas

Research map / Learning theory and algorithms / Sample complexity

Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 11 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
use sparsity-sensitive quantization and constant-weight coding instead of prior DME protocolsdistributed K-means · MNIST uniform, 10 clientstotal bits per dimension at same objective: 52.8 -> 46.8Helped
same, on non-uniformly distributed datadistributed K-means · MNIST non-uniform, 10 clientstotal bits per dimension at same objective: 49.9 -> 36.4Helped
same, in distributed power iterationdistributed power iteration · MNIST uniform, 100 clientstotal bits per dimension at same error: 24.2 -> 23.4Helped
same, power iteration on non-uniform datadistributed power iteration · MNIST non-uniform, 100 clientstotal bits per dimension at same error: 26.6 -> 20.6Helped
use global quantization step size across clients on data unbalanced across clientssparsity-sensitive DME · synthetic t-distribution, sparseness 0.36log(MSE) vs bits per dimensionHelped
increase input sparsity (zero out dimensions)sparsity-sensitive DME vs baselines · synthetic, sparseness 0.60 to 0.06MSE at equal communicationHelped

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