{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:32:36Z","timestamp":1772641956640,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","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":"am","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\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2007714"],"award-info":[{"award-number":["2007714"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2221871"],"award-info":[{"award-number":["2221871"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"publisher","award":["HR00112190130"],"award-info":[{"award-number":["HR00112190130"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/jsait.2023.3260770","type":"journal-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T18:10:42Z","timestamp":1679508642000},"page":"773-788","source":"Crossref","is-referenced-by-count":2,"title":["Compression for Multi-Arm Bandits"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7721-4854","authenticated-orcid":false,"given":"Osama A.","family":"Hanna","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California at Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin F.","family":"Yang","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California at Los Angeles, 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":"Electrical and Computer Engineering Department, University of California at Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Solving multi-arm bandit using a few bits of communication","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Hanna"},{"key":"ref2","article-title":"A survey on practical applications of multi-armed and contextual bandits","volume-title":"arXiv:1904.10040","author":"Bouneffouf","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6761049"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591989"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27926-8_29"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613423"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290964"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500851"},{"issue":"2","key":"ref12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350495"},{"key":"ref15","first-page":"1","article-title":"Minimax policies for adversarial and stochastic bandits","volume-title":"Proc. COLT","volume":"7","author":"Audibert"},{"key":"ref16","first-page":"1587","article-title":"Anytime optimal algorithms in stochastic multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Degenne"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0313-60"},{"key":"ref18","first-page":"355","article-title":"Stochastic linear optimization under bandit feedback","volume-title":"Proc. 21st Annu. Conf. Learn. Theory","author":"Dani"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref21","first-page":"1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","volume-title":"Proc. Conf. Learn. Theory","author":"Agrawal"},{"key":"ref22","first-page":"99","article-title":"Further optimal regret bounds for Thompson sampling","volume-title":"Proc. Artif. Intell. Stat.","author":"Agrawal"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.92.19.8584"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/s0001867800047790"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3267732"},{"key":"ref26","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Agrawal"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/17-EJS1341SI"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref29","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh"},{"key":"ref30","first-page":"1399","article-title":"RATQ: A universal fixed-length quantizer for stochastic optimization","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Mayekar"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3105359"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2986467"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref34","first-page":"623","article-title":"The sample complexity of exploration in the multi-armed bandit problem","volume":"5","author":"Mannor","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1987.1104491"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952664"},{"key":"ref37","article-title":"Distributed multi-agent multi-armed bandits","author":"Landgren","year":"2019"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1381"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16901"},{"key":"ref40","first-page":"1079","article-title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","volume":"7","author":"Even-Dar","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","article-title":"One-bit feedback is sufficient for upper confidence bound policies","author":"Vial","year":"2020","journal-title":"arXiv:2012.02876"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref43","first-page":"1","article-title":"Epoch-greedy algorithm for multi-armed bandits with side information","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"20","author":"Langford"},{"key":"ref44","first-page":"3","article-title":"Associative reinforcement learning using linear probabilistic concepts","volume-title":"Proc. ICML","author":"Abe"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0446"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.256489"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10153453\/10078296-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10153453\/10078296.pdf?arnumber=10078296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T07:41:05Z","timestamp":1709451665000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10078296\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":47,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2023.3260770","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}