{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:22:42Z","timestamp":1774941762707,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1109\/tit.2023.3249636","type":"journal-article","created":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T18:46:56Z","timestamp":1677523616000},"page":"4659-4674","source":"Crossref","is-referenced-by-count":5,"title":["Information-Theoretic Analysis of Minimax Excess Risk"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8951-7481","authenticated-orcid":false,"given":"Hassan","family":"Hafez-Kolahi","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Image Processing Laboratory (IPL), Sharif University of Technology, Tehran, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6304-2326","authenticated-orcid":false,"given":"Behrad","family":"Moniri","sequence":"additional","affiliation":[{"name":"Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3831-0878","authenticated-orcid":false,"given":"Shohreh","family":"Kasaei","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Image Processing Laboratory (IPL), Sharif University of Technology, Tehran, Iran"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Foundations of Machine Learning","author":"Mohri","year":"2012"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1145\/3446776","article-title":"Understanding deep learning requires rethinking generalization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2945779"},{"key":"ref4","first-page":"1","article-title":"Information-theoretic analysis of generalization capability of learning algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref5","first-page":"1","article-title":"Chaining mutual information and tightening generalization bounds","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Asadi"},{"issue":"139","key":"ref6","first-page":"1","article-title":"Chaining meets chain rule: Multilevel entropic regularization and training of neural networks","volume":"21","author":"Asadi","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref7","first-page":"1","article-title":"Information-theoretic generalization bounds for SGLD via data-dependent estimates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Negrea"},{"key":"ref8","first-page":"3437","article-title":"Reasoning about generalization via conditional mutual information","volume-title":"Proc. 33rd Conf. Learn. Theory","author":"Steinke"},{"key":"ref9","first-page":"1","article-title":"Conditioning and processing: Techniques to improve information-theoretic generalization bounds","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hafez-Kolahi"},{"key":"ref10","first-page":"1","article-title":"Sharpened generalization bounds based on conditional mutual information and an application to noisy, iterative algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Haghifam"},{"key":"ref11","article-title":"Fast-rate loss bounds via conditional information measures with applications to neural networks","author":"Hellstr\u00f6m","year":"2020","journal-title":"arXiv:2010.11552"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3040992"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849590"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176056"},{"key":"ref15","article-title":"Continuity of generalized entropy and statistical learning","author":"Xu","year":"2021","journal-title":"arXiv:2012.15829"},{"key":"ref16","first-page":"3998","article-title":"Rate-distortion analysis of minimum excess risk in Bayesian learning","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Hafez-Kolahi"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1030741081"},{"issue":"2","key":"ref20","first-page":"95","article-title":"R.A. Fisher in the 21st century","volume":"13","author":"Efron","year":"1998","journal-title":"Stat. Sci."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448847"},{"key":"ref22","volume-title":"Theory of Games and Economic Behavior","author":"Morgenstern","year":"1953"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0119047"},{"key":"ref24","volume-title":"Statistical Learning Theory and Sequential Prediction","author":"Rakhlin","year":"2014"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3557-3_1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.013"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02925292"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-8071-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1996.8.7.1341"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.54897"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(94)90153-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s102080010029"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-006-0196-8"},{"key":"ref36","first-page":"25","article-title":"Learners that use little information","volume-title":"Proc. Algorithmic Learn. Theory","author":"Bassily"},{"key":"ref37","first-page":"3857","article-title":"Open problem: Information complexity of VC learning","volume-title":"Proc. 33rd Conf. Learn. Theory","author":"Steinke"},{"key":"ref38","article-title":"On the information complexity of proper learners for VC classes in the realizable case","author":"Haghifam","year":"2020","journal-title":"arXiv:2011.02970"},{"key":"ref39","first-page":"633","article-title":"Average-case information complexity of learning","volume-title":"Proc. 30th Int. Conf. Algorithmic Learn. Theory","author":"Nachum"},{"key":"ref41","article-title":"Stochastic evolution equations","volume-title":"Probability Measures on Metric Spaces","author":"van Gaans","year":"2003"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/225298.225347"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10155402\/10054060.pdf?arnumber=10054060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T22:20:50Z","timestamp":1709418050000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10054060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":41,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3249636","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7]]}}}