{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:35Z","timestamp":1773378035505,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834702","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"690-695","source":"Crossref","is-referenced-by-count":3,"title":["Stochastic Chaining and Strengthened Information-Theoretic Generalization Bounds"],"prefix":"10.1109","author":[{"given":"Ruida","family":"Zhou","sequence":"first","affiliation":[{"name":"Texas A&M University,Department of Electrical & Computer Engineering"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical & Computer Engineering"}]},{"given":"Tie","family":"Liu","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Electrical & Computer Engineering"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Conditioning and processing: Techniques to improve information-theoretic generalization bounds","volume":"33","author":"hafez-kolahi","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457578"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174475"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3040992"},{"key":"ref15","article-title":"Tighter expected generalization error bounds via Wasserstein distance","author":"rodr\u00edguez-g\u00e1lvez","year":"2021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437571"},{"key":"ref17","article-title":"On generalization error bounds of noisy gradient methods for non-convex learning","author":"li","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref18","first-page":"11 015","article-title":"Information-theoretic generalization bounds for SGLD via data-dependent estimates","author":"negrea","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref19","author":"talagrand","year":"2006","journal-title":"The Generic Chaining Upper and Lower Bounds of Stochastic Processes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.75242"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.272493"},{"key":"ref6","first-page":"1232","article-title":"Controlling bias in adaptive data analysis using information theory","author":"russo","year":"2016","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref5","first-page":"2524","article-title":"Information-theoretic analysis of generalization capability of learning algorithms","author":"xu","year":"2017","journal-title":"Advances in neural information processing systems"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991139"},{"key":"ref2","first-page":"7234","article-title":"Chaining mutual information and tightening generalization bounds","author":"asadi","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref1","article-title":"Understanding deep learning requires rethinking generalization","author":"zhang","year":"2017","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"ref9","first-page":"9925","article-title":"Sharpened generalization bounds based on conditional mutual information and an application to noisy, iterative algorithms","volume":"33","author":"haghifam","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.814934"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834702"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.915645"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref23","article-title":"Lecture notes on information-theoretic methods for high-dimensional statistics","volume":"16","author":"wu","year":"2017","journal-title":"Lecture Notes for ECE598MR (UIUC)"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834702.pdf?arnumber=9834702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:59Z","timestamp":1773347759000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834702\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834702","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}