{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:22:40Z","timestamp":1774941760438,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society Newton International Fellowship","doi-asserted-by":"publisher","award":["NIF\\R1 \\192656"],"award-info":[{"award-number":["NIF\\R1 \\192656"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518043","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"682-687","source":"Crossref","is-referenced-by-count":10,"title":["Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithms"],"prefix":"10.1109","author":[{"given":"Gholamali","family":"Aminian","sequence":"first","affiliation":[{"name":"University College London,Department of Electronic and Electrical Engineering"}]},{"given":"Laura","family":"Toni","sequence":"additional","affiliation":[{"name":"University College London,Department of Electronic and Electrical Engineering"}]},{"given":"Miguel R. D.","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"University College London,Department of Electronic and Electrical Engineering"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Generalization error bounds via r\\'enyi-, $f$-divergences and maximal leakage","author":"esposito","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref11","article-title":"Jensen-shannon information based characterization of the generalization error of learning algorithms","author":"aminian","year":"0","journal-title":"2020 IEEE Information Theory Workshop (ITW)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613445"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849359"},{"key":"ref14","article-title":"Tighter expected generalization error bounds via wasserstein distance","author":"rodr\u00edguez-g\u00e1lvez","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006774"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021840411064"},{"key":"ref17","first-page":"466","article-title":"A strongly quasi-convex pac-bayesian bound","author":"thiemann","year":"2017","journal-title":"International Conference on Algorithmic Learning Theory"},{"key":"ref18","article-title":"A pac-bayesian approach to adaptive classification","volume":"840","author":"catoni","year":"2003","journal-title":"Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5690-0"},{"key":"ref28","author":"aminian","year":"2020","journal-title":"Information-theoretic bounds on the moments of the generalization error of learning algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606789"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288674"},{"key":"ref3","first-page":"2524","article-title":"Information-theoretic analysis of generalization capability of learning algorithms","author":"xu","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991139"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2945779"},{"key":"ref8","first-page":"3437","article-title":"Reasoning about generalization via conditional mutual information","author":"steinke","year":"2020","journal-title":"Conference on Learning Theory"},{"key":"ref7","first-page":"7234","article-title":"Chaining mutual information and tightening generalization bounds","author":"asadi","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref2","volume":"1","author":"bengio","year":"2017","journal-title":"Deep Learning"},{"key":"ref9","article-title":"Information-theoretic generalization bounds for sgld via data-dependent estimates","author":"negrea","year":"0","journal-title":"NeurIPS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref20","first-page":"1711","article-title":"Novel change of measure inequalities with applications to pac-bayesian bounds and monte carlo estimation","author":"ohnishi","year":"2021","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref22","first-page":"787","article-title":"Risk bounds for the majority vote: From a pac-bayesian analysis to a learning algorithm","volume":"16","author":"germain","year":"2015","journal-title":"Journal of Machine Learning Research"},{"key":"ref21","article-title":"Generalization bounds via information density and conditional information density","author":"hellstr\u00f6m","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497579"},{"key":"ref23","article-title":"Pac-bayes analysis beyond the usual bounds","author":"rivasplata","year":"0","journal-title":"Advances in Neural Information Processing System"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref25","first-page":"610","article-title":"Sharper bounds for uniformly stable algorithms","author":"bousquet","year":"2020","journal-title":"Conference on Learning Theory"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518043.pdf?arnumber=9518043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:18Z","timestamp":1773347718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518043\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518043","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}