[32] B. London. A PAC-bayesian analysis of randomized learning with application to stochastic gradient descent. In Advances in Neural Information Processing Systems, pages 2931-2940, 2017.
[33] B. London, B. Huang, and L. Getoor. Stability and generalization in structured prediction. The Journal of Machine Learning Research, 17(1):7808-7859, 2016.
[34] D. A. McAllester. Some pac-bayesian theorems. Machine Learning, 37(3):355-363, 1999.
[35] W. Mou, L. Wang, X. Zhai, and K. Zheng. Generalization bounds of sgld for non-convex learning: Two theoretical viewpoints. In Conference on Learning Theory, pages 605–638, 2018.
[36] J. Negrea, M. Haghifam, G. K. Dziugaite, A. Khisti, and D. M. Roy. Information-theoretic generalization bounds for sgld via data-dependent estimates. Advances in Neural Information Processing Systems, 32, 2019.
[37] Y. Nesterov. Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM Journal on Optimization, 22(2):341-362, 2012.
[38] K. Nikolakakis, F. Haddadpour, D. Kalogerias, and A. Karbasi. Black-box generalization: Stability of zeroth-order learning. Advances in Neural Information Processing Systems, 35:31525-31541, 2022.
[39] K. E. Nikolakakis, F. Haddadpour, A. Karbasi, and D. S. Kalogerias. Beyond lipschitz: sharp generalization and excess risk bounds for full-batch gd. arXiv preprint arXiv:2204.12446, 2022.
[40] L. Oneto, M. Donini, M. Pontil, and J. Shawe-Taylor. Randomized learning and generalization of fair and private classifiers: From pac-bayes to stability and differential privacy. Neurocomputing, 416:231-243, 2020.
[41] F. Orabona. Simultaneous model selection and optimization through parameter-free stochastic learning. In Advances in Neural Information Processing Systems, pages 1116-1124, 2014.
[42] E. Parrado-Hernández, A. Ambroladze, J. Shawe-Taylor, and S. Sun. Pac-bayes bounds with data dependent priors. The Journal of Machine Learning Research, 13(1):3507-3531, 2012.
[43] M. Pérez-Ortiz, O. Rivasplata, B. Guedj, M. Gleeson, J. Zhang, J. Shawe-Taylor, M. Bober, and J. Kittler. Learning pac-bayes priors for probabilistic neural networks. arXiv preprint arXiv:2109.10304, 2021.
[44] M. Pérez-Ortiz, O. Rivasplata, J. Shawe-Taylor, and C. Szepesvári. Tighter risk certificates for neural networks. Journal of Machine Learning Research, 22, 2021.
[45] A. Raj, L. Zhu, M. Gurbuzbalaban, and U. Simsekli. Algorithmic stability of heavy-tailed sgd with general loss functions. In International Conference on Machine Learning, pages 28578-28597, 2023.
[46] A. Rakhlin, O. Shamir, and K. Sridharan. Making gradient descent optimal for strongly convex stochastic optimization. In International Conference on Machine Learning, pages 449-456, 2012.
[47] D. Richards and I. Kuzborskij. Stability & generalisation of gradient descent for shallow neural networks without the neural tangent kernel. Advances in Neural Information Processing Systems, 34, 2021.
[48] O. Rivasplata, E. Parrado-Hernández, J. S. Shawe-Taylor, S. Sun, and C. Szepesvári. Pac-bayes bounds for stable algorithms with instance-dependent priors. In Advances in Neural Information Processing Systems, pages 9214-9224, 2018.
[49] F. Salehi, L. E. Celis, and P. Thiran. Stochastic optimization with bandit sampling. arXiv preprint arXiv:1708.02544, 2017.
[50] M. Schliserman and T. Koren. Stability vs implicit bias of gradient methods on separable data and beyond. In Conference on Learning Theory, pages 3380-3394. PMLR, 2022.
[51] S. Shalev-Shwartz and S. Ben-David. Understanding machine learning: From theory to algorithms. Cambridge university press, 2014.
[52] S. Shalev-Shwartz, O. Shamir, N. Srebro, and K. Sridharan. Learnability, stability and uniform convergence. Journal of Machine Learning Research, 11(Oct):2635-2670, 2010.
[53] J. Shawe-Taylor and R. C. Williamson. A pac analysis of a bayesian estimator. In Proceedings of the Tenth Annual Conference on Computational Learning Theory, pages 2-9, 1997.
[54] S. Smale and D.-X. Zhou. Online learning with markov sampling. Analysis and Applications, 7(01): 87-113, 2009.
[55] K. Sridharan, S. Shalev-Shwartz, and N. Srebro. Fast rates for regularized objectives. In Advances in Neural Information Processing Systems, pages 1545–1552, 2009.
[56] S. U. Stich, A. Raj, and M. Jaggi. Safe adaptive importance sampling. Advances in Neural Information Processing Systems, 30, 2017.
[57] S. Sun, M. Yu, J. Shawe-Taylor, and L. Mao. Stability-based pac-bayes analysis for multi-view learning algorithms. Information Fusion, 86:76-92, 2022.
[58] T. Sun, Y. Sun, and W. Yin. On markov chain gradient descent. Advances in Neural Information Processing Systems, 31, 2018.
[59] H. Taheri and C. Thrampoulidis. Generalization and stability of interpolating neural networks with minimal width. arXiv preprint arXiv:2302.09235, 2023.
[60] R. Van Handel. Probability in high dimension. Lecture Notes (Princeton University), 2014.