[18] Peter L. Bartlett and Shahar Mendelson. Rademacher and gaussian complexities: Risk bounds and structural results. In Conference on Computational Learning Theory (COLT), pages 224-240, 2001.
[19] Felipe Cucker and Ding Xuan Zhou. Learning theory: An approximation theory viewpoint. Cambridge University Press, 2007.
[20] Hong Chen, Xiaogian Wang, Cheng Deng, and Heng Huang. Group sparse additive machine. In Advances in Neural Information Processing Systems (NeurIPS), pages 198-208, 2017.
[21] Stephen Smale and Ding-Xuan Zhou. Learning theory estimates via integral operators and their approximations. Constructive Approximation, 26:153-172, 2007.
[22] Lorenzo Rosasco, Mikhail Belkin, and Ernesto De Vito. On learning with integral operators. Journal of Machine Learning Research, 11:905-934, 2010.
[23] Daniel Russo and James Zou. How much does your data exploration overfit? controlling bias via information usage, 2015.
[24] Jiantao Jiao, Yanjun Han, and Tsachy Weissman. Dependence measures bounding the exploration bias for general measurements. In 2017 IEEE International Symposium on Information Theory (ISIT), pages 1475-1479, 2017.
[25] Aolin Xu and Maxim Raginsky. Information-theoretic analysis of generalization capability of learning algorithms. In Advances in Neural Information Processing Systems (NIPS), pages 2524-2533, 2017.
[26] Amir R. Asadi, Emmanuel Abbe, and Sergio Verdú. Chaining mutual information and tightening generalization bounds. In Advances in Neural Information Processing Systems (NeurIPS), pages 7245-7254, 2018.
[27] Yuheng Bu, Shaofeng Zou, and Venugopal V. Veeravalli. Tightening mutual information based bounds on generalization error. In IEEE International Symposium on Information Theory (ISIT), pages 587-591, 2019.
[28] William Rogers and T. Wagner. A finite sample distribution-free performance bound for local discrimination rules. The Annals of Statistics, 6:506-514, 1978.
[29] Olivier Bousquet and André Elisseeff. Stability and generalization. Journal of Machine Learning Research, 2:499-526, 2002.
[30] André Elisseeff, Theodoros Evgeniou, and Massimiliano Pontil. Stability of randomized learning algorithms. Journal of Machine Learning Research, 6:55-79, 2005.
[31] Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, and Karthik Sridharan. Learnability, stability and uniform convergence. Journal of Machine Learning Research, 11:2635-2670, 2010.
[32] Yunwen Lei and Yiming Ying. Fine-grained analysis of stability and generalization for stochastic gradient descent. In International Conference on Machine Learning (ICML), volume 119, pages 5809-5819, 2020.
[33] Aymeric Dieuleveut and Francis Bach. Nonparametric stochastic approximation with large step-sizes. The Annals of Statistics, 44(4):1363 - 1399, 2016.
[34] Aymeric Dieuleveut, Nicolas Flammarion, and Francis R. Bach. Harder, better, faster, stronger convergence rates for least-squares regression. Journal of Machine Learning Research, 18:101:1-101:51, 2017.
[35] Jeffrey Negrea, Mahdi Haghifam, Gintare Karolina Dziugaite, Ashish Khisti, and Daniel M. Roy. Information-theoretic generalization bounds for SGLD via data-dependent estimates. In Advances in Neural Information Processing Systems (NeurIPS), pages 11013-11023, 2019.