Making progress based on false discoveries

DOI10.4230/LIPICS.ITCS.2024.76MaRDI QIDQ6906351zbMATH OpenFDO

Authors Roi Livni

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.76

zbMATH Keywords

adaptive data analysislearning theorystochastic convex optimization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorithmic stability for adaptive data analysis
• Concentration inequalities. A nonasymptotic theory of independence
• Convex optimization: algorithms and complexity
• Fingerprinting codes and the price of approximate differential privacy
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• Lower bounds in differential privacy
• Preserving statistical validity in adaptive data analysis (extended abstract)
• Preventing false discovery in interactive data analysis is hard
• Statistical query algorithms for mean vector estimation and stochastic convex optimization
• The reusable holdout: preserving validity in adaptive data analysis

This page was built for publication: Making progress based on false discoveries

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