mlsanityData to 7 Oct 2026

Individually Conditional Individual Mutual Information Bound on Generalization Error

arXiv 2012.09922 ↗First posted 17 Dec 2020cs.IT math.IT stat.MLcited by 30

Not on the map. Why?

Abstract (arXiv)

We propose a new information-theoretic bound on generalization error based on a combination of the error decomposition technique of Bu et al. and the conditional mutual information (CMI) construction of Steinke and Zakynthinou. In a previous work, Haghifam et al. proposed a different bound combining the two aforementioned techniques, which we refer to as the conditional individual mutual information (CIMI) bound. However, in a simple Gaussian setting, both the CMI and the CIMI bounds are order-wise worse than that by Bu et al.. This observation motivated us to propose the new bound, which overcomes this issue by reducing the conditioning terms in the conditional mutual information. In the process of establishing this bound, a conditional decoupling lemma is established, which also leads to a meaningful dichotomy and comparison among these information-theoretic bounds.

Key facts. Cited by 30 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 8; 2023: 8; 2024: 6; 2025: 4.

30 papers.

Sort:

  1. 2021Tighter expected generalization error bounds via Wasserstein distancecited by 43
  2. 2021On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implicationscited by 31
  3. 2021Towards a Unified Information-Theoretic Framework for Generalizationcited by 29
  4. 2022A New Family of Generalization Bounds Using Samplewise Evaluated CMIcited by 28
  5. 2023Tighter Information-Theoretic Generalization Bounds from Supersamplescited by 21
  6. 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimizationcited by 18
  7. 2022Understanding Generalization via Leave-One-Out Conditional Mutual Informationcited by 16
  8. 2023Information Theoretic Lower Bounds for Information Theoretic Upper Boundscited by 16
  9. 2021Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channelscited by 15
  10. 2024Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorizationcited by 12
  11. 2022Tighter Expected Generalization Error Bounds via Convexity of Information Measurescited by 11
  12. 2023Data-dependent Generalization Bounds via Variable-Size Compressibilitycited by 9
18 more
  1. 2022Stability Based Generalization Bounds for Exponential Family Langevin Dynamicscited by 8
  2. 2022Fast Rate Generalization Error Bounds: Variations on a Themecited by 6
  3. 2022Learning Algorithm Generalization Error Bounds via Auxiliary Distributionscited by 6
  4. 2023A unified framework for information-theoretic generalization boundscited by 6
  5. 2023Fast Rate Information-theoretic Bounds on Generalization Errorscited by 5
  6. 2023Recognizable Information Bottleneckcited by 5
  7. 2023Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Boundscited by 5
  8. 2023Exactly Tight Information-Theoretic Generalization Error Bound for the Quadratic Gaussian Problemcited by 4
  9. 2022Formal limitations of sample-wise information-theoretic generalization boundscited by 3
  10. 2024An Information-Theoretic Framework for Out-of-Distribution Generalization with Applications to Stochastic Gradient Langevin Dynamicscited by 3
  11. 2024Generalization Bounds via Conditional f-Informationcited by 3
  12. 2025Fairness Overfitting in Machine Learning: An Information-Theoretic Perspectivecited by 3
  13. 2024Class-wise Generalization Error: an Information-Theoretic Analysiscited by 2
  14. 2025Generalization Guarantees for Representation Learning via Data-Dependent Gaussian Mixture Priorscited by 2
  15. 2025Multiview Representation Learning via Distributed Joint Latent Space Structuringcited by 1
  16. 2024Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spacescited by 0
  17. 2024Error Bounds of Supervised Classification from Information-Theoretic Perspectivecited by 0
  18. 2025An Information-Theoretic Analysis of OOD Generalization in Meta-Reinforcement Learningcited by 0