{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:41:57Z","timestamp":1763811717113,"version":"3.41.2"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[[2025,8]]},"DOI":"10.1109\/tit.2025.3565706","type":"journal-article","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T13:52:52Z","timestamp":1746625972000},"page":"6198-6226","source":"Crossref","is-referenced-by-count":1,"title":["Asymmetry of the Relative Entropy in the Regularization of Empirical Risk Minimization"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2038-9985","authenticated-orcid":false,"given":"Francisco","family":"Daunas","sequence":"first","affiliation":[{"name":"School of Electrical and Electronic Engineering, University of Sheffield, Sheffield, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5597-1718","authenticated-orcid":false,"given":"I\u00f1aki","family":"Esnaola","sequence":"additional","affiliation":[{"name":"School of Electrical and Electronic Engineering, University of Sheffield, Sheffield, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1887-9215","authenticated-orcid":false,"given":"Samir M.","family":"Perlaza","sequence":"additional","affiliation":[{"name":"INRIA, Centre Inria d’Université Côte d’Azur, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2062-131X","authenticated-orcid":false,"given":"H.","family":"Vincent Poor","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206876"},{"key":"ref2","first-page":"831","article-title":"Principles of risk minimization for learning theory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"4","author":"Vapnik"},{"issue":"1","key":"ref3","first-page":"112","article-title":"On a perceptron class","volume":"25","author":"Vapnik","year":"1964","journal-title":"Avtomatika i Telemkhanika"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/9781108616799"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"ref9","first-page":"471","article-title":"Structural risk minimization for character recognition","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"4","author":"Guyon"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.382014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.661502"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1993.5.6.893"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/72.788648"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/72.788640"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/72.485681"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2009.4938676"},{"key":"ref18","first-page":"233","article-title":"A closer look at memorization in deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arpit"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2200000112"},{"key":"ref20","first-page":"499","article-title":"Stability and generalization","volume":"2","author":"Bousquet","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21852-6_3"},{"key":"ref22","first-page":"8106","article-title":"An exact characterization of the generalization error for the Gibbs algorithm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Aminian"},{"volume-title":"The Bayesian Choice: From Decision-Theoretic Foundations to Computational Implementation","year":"2007","author":"Robert","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279989"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/267460.267466"},{"key":"ref27","first-page":"228","article-title":"PAC-learning in the presence of adversaries","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Cullina"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834273"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3365728"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3383281"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606789"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2945779"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5104-z"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3329617"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206506"},{"key":"ref36","article-title":"The generalization error of machine learning algorithms","author":"Perlaza","year":"2024","journal-title":"arXiv:2411.12030"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30132-5_140"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/141000270"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1111\/jtsa.12645"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3441574"},{"article-title":"An information-theoretic approach to generalization theory","year":"2024","author":"Rodr\u00edguez G\u00e1lvez","key":"ref41"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.3.670"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref44","first-page":"207","article-title":"Non-exponentially weighted aggregation: Regret bounds for unbounded loss functions","volume-title":"Proc. 38th Int. Conf. Mach. Learn. (ICML)","author":"Alquier"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834354"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437307"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849796"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611499"},{"key":"ref49","first-page":"28988","article-title":"Rashomon capacity: A metric for predictive multiplicity in classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hsu"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1946.0056"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i15.29674"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"volume-title":"Probability and Measure Theory","year":"2000","author":"Ash","key":"ref53"},{"volume-title":"Optimization by Vector Space Methods","year":"1997","author":"Luenberger","key":"ref54"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/9781118164419"},{"volume-title":"Principles of Mathematical Analysis","year":"1976","author":"Rudin","key":"ref56"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-048-3"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.177"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11095909\/10989769-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11095909\/10989769.pdf?arnumber=10989769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T06:41:02Z","timestamp":1753512062000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10989769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":59,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3565706","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}