Subsampling suffices for adaptive data analysis
From MaRDI portal
Cites work
- A Class of Statistics with Asymptotically Normal Distribution
- A note on optimal probability lower bounds for centered random variables
- Algorithmic stability for adaptive data analysis
- Boosting and differential privacy
- Efficient noise-tolerant learning from statistical queries
- Functional Bregman Divergence and Bayesian Estimation of Distributions
- Hoeffding and Bernstein inequalities for U-statistics without replacement
- scientific article; zbMATH DE number 3452883 (Why is no real title available?)
- Max-information, differential privacy, and post-selection hypothesis testing
- Mean, Median and Mode in Binomial Distributions
- Median bounds and their application
- Negative Moments of Positive Random Variables
- Noisy binary search and its applications
- Preserving statistical validity in adaptive data analysis (extended abstract)
- Preventing false discovery in interactive data analysis is hard
- Probability Inequalities for Sums of Bounded Random Variables
- Sampling without compromising accuracy in adaptive data analysis
- Statistical algorithms and a lower bound for detecting planted cliques
- Subsampling Suffices for Adaptive Data Analysis
- The reusable holdout: preserving validity in adaptive data analysis
- Towards proving strong direct product theorems
This page was built for publication: Subsampling suffices for adaptive data analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854563)
