{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T05:15:34Z","timestamp":1778130934808,"version":"3.51.4"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["2007714"],"award-info":[{"award-number":["2007714"]}]},{"name":"NSF","award":["2221871"],"award-info":[{"award-number":["2221871"]}]},{"name":"Army Research Laboratory under Cooperative Agreement","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}]},{"name":"Amazon Faculty Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/jsait.2026.3677413","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:58:49Z","timestamp":1774468729000},"page":"134-145","source":"Crossref","is-referenced-by-count":0,"title":["Fundamental Limits of Learning Under Erasure-Constrained Communication Channels"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7190-6426","authenticated-orcid":false,"given":"Merve","family":"Karakas","sequence":"first","affiliation":[{"name":"University of California, Los Angeles (UCLA), Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7721-4854","authenticated-orcid":false,"given":"Osama","family":"Hanna","sequence":"additional","affiliation":[{"name":"Meta, GenAI, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin F.","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles (UCLA), Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1002-5829","authenticated-orcid":false,"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles (UCLA), Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195223"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116669"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/s21237855"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660151"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2018.2890512"},{"key":"ref6","volume-title":"Computer Networking: A Top-Down Approach","author":"Kurose","year":"2012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-36305-y"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-023-00779-2"},{"key":"ref9","first-page":"14315","article-title":"Prediction with corrupted expert advice","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Amir"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/isit54713.2023.10206591"},{"key":"ref11","first-page":"3898","article-title":"Multi-agent bandit learning through heterogeneous action erasure channels","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Hanna"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539701398375"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350495"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref19","first-page":"1562","article-title":"Better algorithms for stochastic bandits with adversarial corruptions","volume-title":"Proc. Conf. Learn. Theory","author":"Gupta"},{"key":"ref20","first-page":"1453","article-title":"Online learning under delayed feedback","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Joulani"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9604"},{"key":"ref22","first-page":"4105","article-title":"Bandits with delayed, aggregated anonymous feedback","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pike-Burke"},{"key":"ref23","article-title":"Stochastic bandit models for delayed conversions","author":"Vernade","year":"2017","journal-title":"arXiv:1706.09186"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/icassp.2017.7952664"},{"key":"ref25","first-page":"2730","article-title":"Cooperative multi-agent bandits with heavy tails","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dubey"},{"key":"ref26","first-page":"1","article-title":"Multi-agent multi-armed bandits with limited communication","author":"Agarwal","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","first-page":"74799","article-title":"Decentralized randomly distributed multi-agent multi-armed bandit with heterogeneous rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref28","first-page":"4120","article-title":"Optimal algorithms for multiplayer multi-armed bandits","volume-title":"Proc. Mach. Learn. Res.","author":"Wang"},{"key":"ref29","first-page":"22392","article-title":"Heterogeneous multi-player multi-armed bandits: Closing the gap and generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shi"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/isit57864.2024.10619688"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10998-010-3055-6"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2020.3021525"},{"key":"ref33","article-title":"Action poisoning attacks on linear contextual bandits","author":"Liu","year":"2023","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/trustcom56396.2022.00153"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/471"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/11395188\/11456033-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8700143\/11395188\/11456033.pdf?arnumber=11456033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T05:04:02Z","timestamp":1778130242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11456033\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/jsait.2026.3677413","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}