AI Paper Atlas

Research map / Federated learning and privacy / Differential privacy

Local-DP and private estimation

Estimate means and statistics under local or central privacy with minimax rates.

113 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2016–2026) · an approach in Differential privacy, keyword cluster “estimation · error · algorithms”

State History Tried Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

28 papers in 2023–24 and 32 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic held steady, from 13.0% to 12.0%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 3162017: 1172018: 7182019: 9192020: 5202021: 11212022: 17222023: 18232024: 10242025: 13252026: 1926

Most cited paper of each year

Earliest papers here

What has been tried

79 papers here report 496 measured changes (a component added, removed or swapped, compared with a baseline): helped 66%, no clear effect 9%, hurt 18%, mixed 7%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Add the soft-thresholding operatorNLDP, k-sparse sub-Gaussian · ℓ2 estimation error upper bound\tilde{O}(\frac{d^{\frac{3}{2}}}{\sqrt{n}\epsilon}) versus \tilde{O}(\frac{d\sqrt{k}}{\sqrt{n}\epsilon})HelpedImproved Analysis of Sparse Linear Regression in Local Differential Privacy Model (ICLR 2024 · 0 citations)
replace hourglass noise with independent Laplace noiseAdd-remove mean estimation, high privacy · MSE\frac{2(u-l)^2}{|D|^2\varepsilon^2} \left( 1 + o(1)\right)HurtMean Estimation in the Add-Remove Model of Differential Privacy (ICML 2024 · 0 citations)
Increase εSimulation experiments · utilityHelpedOn the Computational Complexity of Private High-dimensional Model Selection (NeurIPS 2024 · 0 citations)
Use G=F instead of uniform samplingU(0, 1), n=103, r=0.5 · maximum absolute error0.183 -> 0.183No clear effectTuning-free Estimation and Inference of Cumulative Distribution Function under Local Differential Privacy (ICML 2024)

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 60 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 40 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    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