AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Distribution Estimation under the Infinity Norm

Aryeh Kontorovich, Amichai Painsky

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

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 the proposed data-dependent bound instead of the benchmark boundMLE infinity-norm confidence bound · 2000 US Census top-1000 surnames (n=10000, delta=0.05)bound on infinity norm error: 0.0345 -> 0.0108Improved
use proposed Theorem bound instead of the other proposed bound at fixed deltaZipf and uniform, A=100 · Zipf s=1.1 (A=100, delta=0.05)bound tightnessImproved
use the decaying-confidence bound with delta=1/n^2 for large nZipf and uniform, A=100 · Zipf s=1.1 (A=100, delta=1/n^2)bound tightnessImproved
use infinity norm as proxy for the k most frequent symbolscensus and Hamilton word data · 2000 US Census top-1000 surnames (n=10000, delta=0.05)CI agreement with oracleImproved

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