Preventing false discovery in interactive data analysis is hard

DOI10.1109/FOCS.2014.55MaRDI QIDQ6947216zbMATH OpenFDO

Authors Jonathan Ullman, Moritz Hardt

Publication date 5 August 2025

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

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(8)

• Subsampling suffices for adaptive data analysis
• A Bias-Accuracy-Privacy Trilemma for Statistical Estimation
• Making progress based on false discoveries
• Simple dynamic spanners with near-optimal recourse against an adaptive adversary
• A polynomial time, pure differentially private estimator for binary product distributions
• Private PAC learning may be harder than online learning
• PAC verification of statistical algorithms
• Minimizing recourse in an adaptive balls and bins game

This page was built for publication: Preventing false discovery in interactive data analysis is hard

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