{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:04:51Z","timestamp":1784268291194,"version":"3.55.0"},"reference-count":80,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery","award":["RGPIN-2023-04482"],"award-info":[{"award-number":["RGPIN-2023-04482"]}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 37010"],"award-info":[{"award-number":["P 37010"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012652","name":"ETH Z\u00fcrich Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tit.2026.3693950","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T19:53:06Z","timestamp":1778874786000},"page":"5954-5969","source":"Crossref","is-referenced-by-count":0,"title":["Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6791-3371","authenticated-orcid":false,"given":"Anastasis","family":"Kratsios","sequence":"first","affiliation":[{"name":"Department of Mathematics, McMaster University, Hamilton, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. Martina","family":"Neuman","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, University of Vienna., Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gudmund","family":"Pammer","sequence":"additional","affiliation":[{"name":"Department of Mathematics, ETH, Zürich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219530516400042"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.07.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.08.019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpur.2021.07.009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1111\/mafi.12389"},{"key":"ref6","article-title":"A PAC-Bayesian approach to spectrally-normalized margin bounds for neural networks","author":"Neyshabur","year":"2017","journal-title":"arXiv:1707.09564"},{"key":"ref7","article-title":"A PAC-Bayesian approach to spectrally-normalized margin bounds for neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Neyshabur"},{"issue":"63","key":"ref8","first-page":"1","article-title":"Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks","volume":"20","author":"Bartlett","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","article-title":"Spectrally-normalized margin bounds for neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Bartlett"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3085190"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.22008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3144615"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206951"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/22-AAP1806"},{"key":"ref16","first-page":"4767","article-title":"A theoretical analysis of the test error of finite-rank kernel ridge regression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Belius"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1142\/s0219530523500021"},{"key":"ref18","article-title":"Instance-dependent generalization bounds via optimal transport","volume":"24","author":"Hou","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","article-title":"Benign overfitting in ridge regression","volume":"24","author":"Tsigler","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3215088"},{"key":"ref21","article-title":"Generalization in kernel regression under realistic assumptions","author":"Barzilai","year":"2023","journal-title":"arXiv:2312.15995"},{"key":"ref22","article-title":"Characterizing overfitting in kernel ridgeless regression through the eigenspectrum","author":"Cheng","year":"2024","journal-title":"arXiv:2402.01297"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/103162.103163"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76526-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2545-2"},{"key":"ref27","article-title":"On a space of totally additive functions, vestn","volume":"13","author":"Kantorovich","year":"1958","journal-title":"Vestnik Leningrad. Univ."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1051\/ps\/2019025"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0583-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/bf02579135"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103945"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1051\/cocv\/2010100"},{"key":"ref33","article-title":"Convergence rate of optimal quantization and application to the clustering performance of the empirical measure","volume":"21","author":"Liu","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3150\/18-bej1065"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/bf02776078"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761110"},{"key":"ref37","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Zhang"},{"key":"ref38","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arjovsky"},{"key":"ref39","first-page":"1774","article-title":"Multi-marginal Wasserstein GAN","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Cao"},{"key":"ref40","first-page":"8798","article-title":"COT-GAN: Generating sequential data via causal optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref41","article-title":"Neural ordinary differential equations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Chen"},{"key":"ref42","article-title":"Neural jump ordinary differential equations: Consistent continuous-time prediction and filtering","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Herrera"},{"key":"ref43","first-page":"7829","article-title":"Neural rough differential equations for long time series","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Morrill"},{"issue":"290","key":"ref44","first-page":"1","article-title":"On universal approximation and error bounds for Fourier neural operators","volume":"22","author":"Kovachki","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00314-5"},{"issue":"1","key":"ref46","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1214\/aop\/1176988847","article-title":"Sharper bounds for Gaussian and empirical processes","volume":"22","author":"Talagrand","year":"1994","journal-title":"Ann. Probab."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279968"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/18-aos1766"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz025"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2603151"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12236"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1214\/12-AIHP517"},{"key":"ref53","article-title":"The least doubling constant of a path graph","author":"Durand-Cartagena","year":"2021","journal-title":"arXiv:2111.09196"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113354"},{"key":"ref55","article-title":"Small transformers compute universal metric embeddings","volume":"24","author":"Kratsios","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2003.158.679"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1090\/s0894-0347-03-00436-3"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09546-4"},{"key":"ref59","article-title":"Inverse problems are solvable on real number signal processing hardware","author":"Boche","year":"2022","journal-title":"arXiv:2204.02066"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3326879"},{"key":"ref61","article-title":"Non-computability of the pseudoinverse on digital computers","author":"Boche","year":"2022","journal-title":"arXiv:2212.02940"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106297"},{"issue":"3","key":"ref63","first-page":"589","article-title":"Bi-lipschitz embeddings into low-dimensional Euclidean spaces","volume":"31","author":"Jiri","year":"1990","journal-title":"Comment. Math. Univ. Carolin."},{"key":"ref64","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport","volume":"338","author":"Villani","year":"2009"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511581274"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"ref68","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"Bartlett","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-026-09745-8"},{"key":"ref71","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60932-9","volume-title":"Constructive Approximation","volume":"304","author":"Lorentz","year":"1996"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.040"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-020-09462-z"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-024-09649-8"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2010.04.001"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.52202\/075280-1936"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-021-09548-z"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref79","article-title":"Computing nonvacuous generalization bounds for deep (Stochastic) neural networks with many more parameters than training data","author":"Dziugaite","year":"2017","journal-title":"arXiv:1703.11008"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11611849\/11520939.pdf?arnumber=11520939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T05:17:33Z","timestamp":1784265453000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11520939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":80,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3693950","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}