atlas

Research map / Learning theory and algorithms / Sample complexity

Subset-Based Instance Optimality in Private Estimation

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 1 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
Subset-based benchmark (removal-only, large subsets) instead of add/remove local minimax risk for mean estimationprivate mean estimation · theoretical comparisoninstance-dependent riskHelped
Tighter clipping threshold choice (rank targets t_l, t_u balancing bias and variance) in the DP mean algorithmprivate mean estimation · theoretical analysisexpected error vs. lower boundHelped
Subset-optimal mean algorithm matches or exceeds prior algorithms' asymptotic rates under sub-Gaussian and bounded-moment assumptionsstatistical mean estimation · sub-Gaussian, bounded k-th moment familiesworst-case expected error rateNo clear effect
Pruning outliers vs clipping in monotone-property algorithm, with added discretizationgeneral monotone properties · theoryexpected lossNo clear effect

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