mlsanityData to 14 Oct 2026

How much does your data exploration overfit? Controlling bias via information usage

arXiv 1511.05219 ↗First posted 16 Nov 2015stat.ML cs.LGcited by 95

Not on the map. Why?

Abstract (arXiv)

Modern data is messy and high-dimensional, and it is often not clear a priori what are the right questions to ask. Instead, the analyst typically needs to use the data to search for interesting analyses to perform and hypotheses to test. This is an adaptive process, where the choice of analysis to be performed next depends on the results of the previous analyses on the same data. Ultimately, which results are reported can be heavily influenced by the data. It is widely recognized that this process, even if well-intentioned, can lead to biases and false discoveries, contributing to the crisis of reproducibility in science. But while %the adaptive nature of exploration any data-exploration renders standard statistical theory invalid, experience suggests that different types of exploratory analysis can lead to disparate levels of bias, and the degree of bias also depends on the particulars of the data set. In this paper, we propose a general information usage framework to quantify and provably bound the bias and other error metrics of an arbitrary exploratory analysis. We prove that our mutual information based bound is tight in natural settings, and then use it to give rigorous insights into when commonly used procedures do or do not lead to substantially biased estimation. Through the lens of information usage, we analyze the bias of specific exploration procedures such as filtering, rank selection and clustering. Our general framework also naturally motivates randomization techniques that provably reduces exploration bias while preserving the utility of the data analysis. We discuss the connections between our approach and related ideas from differential privacy and blinded data analysis, and supplement our results with illustrative simulations.

Key facts. Cited by 95 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Nov 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 13; 2022: 25; 2023: 21; 2024: 16; 2025: 13; 2026: 7.

95 papers.

Sort:

By area:

  1. 2021User-friendly introduction to PAC-Bayes boundscited by 239
  2. 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
  3. 2023To Compress or Not to Compress- Self-Supervised Learning and Information Theory: A Reviewcited by 72
  4. 2021Information-theoretic generalization bounds for black-box learning algorithmscited by 49
  5. 2021Generalization Bounds For Meta-Learning: An Information-Theoretic Analysiscited by 45
  6. 2021Tighter expected generalization error bounds via Wasserstein distancecited by 43
  7. 2021On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implicationscited by 31
  8. 2021Towards a Unified Information-Theoretic Framework for Generalizationcited by 30
  9. 2021Generalization Bounds using Lower Tail Exponents in Stochastic Optimizerscited by 27
  10. 2022Generalization Bounds via Convex Analysiscited by 27
  11. 2022Single Trajectory Nonparametric Learning of Nonlinear Dynamicscited by 26
  12. 2024Knowledge Overshadowing Causes Amalgamated Hallucination in Large Language Modelscited by 25
38 more
  1. 2025FedSWA: Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averagingcited by 25
  2. 2022Fine-Tuning Language Models via Epistemic Neural Networkscited by 22
  3. 2023Tighter Information-Theoretic Generalization Bounds from Supersamplescited by 22
  4. 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimizationcited by 19
  5. 2022An Information-theoretical Approach to Semi-supervised Learning under Covariate-shiftcited by 18
  6. 2023Information Theoretic Lower Bounds for Information Theoretic Upper Boundscited by 17
  7. 2025Does Generation Require Memorization? Creative Diffusion Models using Ambient Diffusioncited by 17
  8. 2022Information-Theoretic Analysis of Unsupervised Domain Adaptationcited by 15
  9. 2023Generalization Bounds with Data-dependent Fractal Dimensionscited by 15
  10. 2024Towards a Theoretical Understanding of Synthetic Data in LLM Post-Training: A Reverse-Bottleneck Perspectivecited by 15
  11. 2021Characterizing and Understanding the Generalization Error of Transfer Learning with Gibbs Algorithmcited by 14
  12. 2023Online-to-PAC Conversions: Generalization Bounds via Regret Analysiscited by 14
  13. 2024Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorizationcited by 14
  14. 2022Empirical Risk Minimization with Relative Entropy Regularizationcited by 13
  15. 2021Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithmscited by 12
  16. 2023Learning via Wasserstein-Based High Probability Generalisation Boundscited by 12
  17. 2022Tighter Expected Generalization Error Bounds via Convexity of Information Measurescited by 11
  18. 2022What You See is What You Get: Principled Deep Learning via Distributional Generalizationcited by 11
  19. 2022Two Facets of SDE Under an Information-Theoretic Lens: Generalization of SGD via Training Trajectories and via Terminal Statescited by 11
  20. 2021Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learningcited by 10
  21. 2022Chained Generalisation Boundscited by 10
  22. 2023On the Validation of Gibbs Algorithms: Training Datasets, Test Datasets and their Aggregationcited by 10
  23. 2024Information-Theoretic Generalization Bounds for Deep Neural Networkscited by 10
  24. 2025Compositional Generalization from Learned Skills via CoT Training: A Theoretical and Structural Analysis for Reasoningcited by 10
  25. 2022Adaptive Data Analysis with Correlated Observationscited by 9
  26. 2022Generalisation under gradient descent via deterministic PAC-Bayescited by 9
  27. 2024Generalization bounds for mixing processes via delayed online-to-PAC conversionscited by 9
  28. 2024Theoretical Insights into Fine-Tuning Attention Mechanism: Generalization and Optimizationcited by 9
  29. 2022Improved Information Theoretic Generalization Bounds for Distributed and Federated Learningcited by 8
  30. 2022Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysiscited by 8
  31. 2022Adaptive Experimentation in the Presence of Exogenous Nonstationary Variationcited by 8
  32. 2023Bayes meets Bernstein at the Meta Level: an Analysis of Fast Rates in Meta-Learning with PAC-Bayescited by 8
  33. 2024No Free Prune: Information-Theoretic Barriers to Pruning at Initializationcited by 8
  34. 2022f-divergences and their applications in lossy compression and bounding generalization errorcited by 7
  35. 2022Finite Littlestone Dimension Implies Finite Information Complexitycited by 7
  36. 2023Algorithm-Dependent Bounds for Representation Learning of Multi-Source Domain Adaptationcited by 7
  37. 2023Generalization Analysis of Machine Learning Algorithms via the Worst-Case Data-Generating Probability Measurecited by 7
  38. 2024Misclassification bounds for PAC-Bayesian sparse deep learningcited by 7

50 most cited of 95 All 95 (JSON)