[CT06] Thomas M. Cover and Joy A. Thomas. Elements of information theory (2. ed.). Wiley, 2006.
[Dev83] Luc Devroye. The equivalence of weak, strong and complete convergence in 11 for kernel density estimates. The Annals of Statistics, pages 896-904, 1983.
[DKSV20] Yann Dubois, Douwe Kiela, David J Schwab, and Ramakrishna Vedantam. Learning optimal representations with the decodable information bottleneck. Advances in Neural Information Processing Systems, 33:18674-18690, 2020.
[Fis20] Ian Fischer. The conditional entropy bottleneck. Entropy, 22(9):999, 2020.
[Gal68] Robert G Gallager. Information theory and reliable communication, volume 588. Springer, 1968.
[GB10] Xavier Glorot and Yoshua Bengio. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, pages 249-256. JMLR Workshop and Conference Proceedings, 2010.
[Gei21] Bernhard C Geiger. On information plane analyses of neural network classifiers-a review. IEEE Transactions on Neural Networks and Learning Systems, 2021.
[GK19] Bernhard C Geiger and Tobias Koch. On the information dimension of stochastic processes. IEEE transactions on information theory, 65(10):6496-6518, 2019.
[GMP05] Peter D Grünwald, In Jae Myung, and Mark A Pitt. Advances in minimum description length: Theory and applications. MIT press, 2005.
[GP20] Ziv Goldfeld and Yury Polyanskiy. The information bottleneck problem and its applications in machine learning. IEEE Journal on Selected Areas in Information Theory, 1(1):19-38, 2020.
[GR19] Peter Grünwald and Teemu Roos. Minimum description length revisited. International journal of mathematics for industry, 11(01):1930001, 2019.
[GSZ21] Peter Grunwald, Thomas Steinke, and Lydia Zakynthinou. Pac-bayes, mac-bayes and conditional mutual information: Fast rate bounds that handle general vc classes. In Conference on Learning Theory, pages 2217-2247. PMLR, 2021.
$\left[\mathrm{GVDBG}^{+}19\right]$  Ziv Goldfeld, Ewout Van Den Berg, Kristjan Greenewald, Igor Melnyk, Nam Nguyen, Brian Kingsbury, and Yury Polyanskiy. Estimating information flow in deep neural networks. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2299-2308. PMLR, 09-15 Jun 2019.
[HD22] Fredrik Hellström and Giuseppe Durisi. A new family of generalization bounds using samplewise evaluated cmi. Advances in Neural Information Processing Systems, 35:10108-10121, 2022.
[HJTW21] Daniel Hsu, Ziwei Ji, Matus Telgarsky, and Lan Wang. Generalization bounds via distillation. In International Conference on Learning Representations, 2021.
[HK19] Steve Hanneke and Aryeh Kontorovich. A sharp lower bound for agnostic learning with sample compression schemes. In Algorithmic Learning Theory, pages 489-505. PMLR, 2019.
[HK21] Steve Hanneke and Aryeh Kontorovich. Stable sample compression schemes: New applications and an optimal svm margin bound. In Algorithmic Learning Theory, pages 697-721. PMLR, 2021.
[HKS19] Steve Hanneke, Aryeh Kontorovich, and Menachem Sadigurschi. Sample compression for real-valued learners. In Algorithmic Learning Theory, pages 466-488. PMLR, 2019.