{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:52:06Z","timestamp":1757310726071,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004063","name":"Knut and Alice Wallenberg Foundation","doi-asserted-by":"publisher","award":["2018.0090"],"award-info":[{"award-number":["2018.0090"]}],"id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"publisher","award":["2020-04718","2021-03709"],"award-info":[{"award-number":["2020-04718","2021-03709"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swedish National Infrastructure for Computing (SNIC) at the Chalmers Centre for Computational Science and Engineering (C3SE) partially funded by the Swedish Research Council","award":["2018-05973"],"award-info":[{"award-number":["2018-05973"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/lcomm.2022.3207385","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T19:32:24Z","timestamp":1663356744000},"page":"2939-2943","source":"Crossref","is-referenced-by-count":5,"title":["Data-Driven Estimation of Capacity Upper Bounds"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5155-8018","authenticated-orcid":false,"given":"Christian","family":"Hager","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-451X","authenticated-orcid":false,"given":"Erik","family":"Agrell","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","first-page":"1","article-title":"Learning deep embeddings with histogram loss","author":"ustinova","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2603151"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2021.3087815"},{"key":"ref11","article-title":"Neural capacity estimators: How reliable are they?","author":"mirkarimi","year":"2021","journal-title":"arXiv 2111 07401"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2017.2758370"},{"key":"ref13","first-page":"531","article-title":"Mutual information neural estimation","author":"belghazi","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849364"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisz\u00e1r","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692214"},{"key":"ref17","first-page":"291","article-title":"An information theoretical identity and a problem involving capacity","volume":"2","author":"tops\u00f8e","year":"1967","journal-title":"Studia Sci Math Hungarica"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(74)90000-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817449"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3390\/e22060607"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2214202"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3390\/e21080760"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815464"},{"key":"ref29","first-page":"5171","article-title":"On variational bounds of mutual information","author":"poole","year":"2019","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ECOC.2018.8535456"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154239"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174109"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517832"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","first-page":"875","article-title":"Formal limitations on the measurement of mutual information","author":"mcallester","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365385"},{"key":"ref21","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027522"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2565668"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165793"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.203901"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9979638\/09893806.pdf?arnumber=9893806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:27:17Z","timestamp":1672082837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9893806\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":31,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2022.3207385","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}