atlas

Research map / Learning theory and algorithms / Sample complexity

Refinement Methods for Distributed Distribution Estimation under $\ell^p$-Losses

NeurIPS 2025 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

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

Derives minimax optimal rates for communication-constrained distributed estimation of discrete distributions under ℓ^p losses, identifying an elbow effect at p=2.

Problem

Communication-constrained estimation of discrete distributions under ℓ^p losses when each distributed terminal holds multiple i.i.d. samples and can send only a limited number of bits.

Approach

Obtains minimax optimal rates for most parameter regimes under ℓ^p losses, revealing an elbow effect of the optimal rates at p=2; the abstract is truncated before describing the achieving scheme.

Key results

Limitations

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