{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:11Z","timestamp":1773378131320,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834399","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1665-1670","source":"Crossref","is-referenced-by-count":3,"title":["Remote Contextual Bandits"],"prefix":"10.1109","author":[{"given":"Francesco","family":"Pase","sequence":"first","affiliation":[{"name":"University of Padova,Padova,Italy"}]},{"given":"Deniz","family":"G\u00fcnd\u00fcz","sequence":"additional","affiliation":[{"name":"University of Padova,Padova,Italy"}]},{"given":"Michele","family":"Zorzi","sequence":"additional","affiliation":[{"name":"University of Padova,Padova,Italy"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","volume":"26","author":"zhang","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2646342"},{"key":"ref12","article-title":"Learning to communicate with deep multi-agent reinforcement learning","author":"foerster","year":"2016"},{"key":"ref13","first-page":"2252","article-title":"Learning multiagent communication with backpropagation","author":"sukhbaatar","year":"2016","journal-title":"Proc of 30th Int’l Conf on Neural Information Proc Systems"},{"key":"ref14","article-title":"Emergence of language with multi-agent games: Learning to communicate with sequences of symbols","author":"havrylov","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref15","article-title":"Multi-agent cooperation and the emergence of (natural) language","author":"lazaridou","year":"2017"},{"key":"ref16","article-title":"Multi-agent multi-armed bandits with limited communication","author":"agarwal","year":"2021"},{"key":"ref17","article-title":"Solving multi-arm bandit using a few bits of communication","author":"hanna","year":"2021","journal-title":"38th International Conference on Machine Learning"},{"key":"ref18","article-title":"Analysis of Thompson sampling for partially observable contextual multi-armed bandits","author":"park","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036955"},{"key":"ref3","author":"cover","year":"2006","journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)"},{"key":"ref6","article-title":"Efficient Parallel Methods for Deep Reinforcement Learning","author":"clemente","year":"2017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3087248"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057194"},{"key":"ref7","article-title":"Decentralized estimation and decision theory","author":"berger","year":"1979","journal-title":"IEEE 7th Spring Workshop on Inf Theory"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/MCOM.001.2000394","article-title":"Communicate to learn at the edge","volume":"58","author":"g\u00fcnd\u00fcz","year":"2020","journal-title":"IEEE Communications Magazine"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2941458"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2953750"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2307\/2371219"},{"key":"ref22","first-page":"1417","article-title":"Simple Bayesian algorithms for best arm identification","volume":"49","author":"russo","year":"2016","journal-title":"29th Annual Conference on Learning Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref24","article-title":"Thompson sampling with approximate inference","author":"phan","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref23","article-title":"Asymptotic convergence of Thompson sampling","author":"kalkanli","year":"2020"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834399.pdf?arnumber=9834399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:27Z","timestamp":1773347787000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834399\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834399","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}