Tight lower bounds for differentially private selection

DOI10.1109/FOCS.2017.57MaRDI QIDQ6946329zbMATH OpenFDO

Authors Thomas Steinke, Jonathan Ullman

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.57

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(6)

• A Bias-Accuracy-Privacy Trilemma for Statistical Estimation
• Simple dynamic spanners with near-optimal recourse against an adaptive adversary
• A polynomial time, pure differentially private estimator for binary product distributions
• On the sample complexity of privately learning unbounded high-dimensional Gaussians
• Differentially private Assouad, Fano, and Le Cam
• On distributed differential privacy and counting distinct elements

This page was built for publication: Tight lower bounds for differentially private selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946329)