{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:17:52Z","timestamp":1768339072804,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF AI Institute","award":["2112085"],"award-info":[{"award-number":["2112085"]}]},{"name":"NSF ASCENT","award":["2328241"],"award-info":[{"award-number":["2328241"]}]},{"name":"NSF CNS","award":["2003111"],"award-info":[{"award-number":["2003111"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/lcsys.2024.3525096","type":"journal-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T19:44:48Z","timestamp":1735847088000},"page":"3309-3314","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Thompson Sampling Under Constrained Communication"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9931-1145","authenticated-orcid":false,"given":"Saba","family":"Zerefa","sequence":"first","affiliation":[{"name":"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6502-6430","authenticated-orcid":false,"given":"Zhaolin","family":"Ren","sequence":"additional","affiliation":[{"name":"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9943-0638","authenticated-orcid":false,"given":"Haitong","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9545-3050","authenticated-orcid":false,"given":"Na","family":"Li","sequence":"additional","affiliation":[{"name":"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138"},{"key":"ref2","first-page":"115","article-title":"Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Bergstra"},{"issue":"54","key":"ref3","first-page":"1","article-title":"SMAC3: A versatile Bayesian optimization package for hyperparameter optimization","volume":"23","author":"Lindauer","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1039\/C9SC04026A"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-04832-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2015.08.020"},{"key":"ref8","first-page":"1","article-title":"Finite sample convergence rates of zero-order stochastic optimization methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wibisono"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1115\/1.3653121"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-38527-2_55"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"ref12","article-title":"A tutorial on Bayesian optimization","author":"Frazier","year":"2018","journal-title":"arXiv:1807.02811"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/24725854.2024.2335513"},{"key":"ref14","first-page":"1015","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","volume-title":"Proc. 27th Int. Conf. Mach. Learn.","author":"Srinivas"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/2200000070"},{"key":"ref17","first-page":"1","article-title":"An empirical evaluation of Thompson sampling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chapelle"},{"key":"ref18","first-page":"1","article-title":"Optimal order simple regret for Gaussian process bandits","volume-title":"Proc. 35th Int. Conf. Neural Inf. Process. Syst.","author":"Vakili"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref20","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Agrawal"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS55552.2023.10341675"},{"key":"ref22","first-page":"133","article-title":"Parallelised Bayesian optimisation via Thompson sampling","volume-title":"Proc. 21st Int. Conf. Artif. Intell. Stat.","author":"Kandasamy"},{"key":"ref23","first-page":"1","article-title":"The parallel knowledge gradient method for batch Bayesian optimization","volume-title":"Proc. 30th Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref24","article-title":"TS-RSR: A provably efficient approach for batch Bayesian optimization","author":"Ren","year":"2024","journal-title":"arXiv:2403.04764"},{"key":"ref25","first-page":"1470","article-title":"Parallel and distributed Thompson sampling for large-scale accelerated exploration of chemical space","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Hern\u00e1ndez-Lobato"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3309099"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981665"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/327"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-405163-8.00008-9"},{"issue":"68","key":"ref30","first-page":"1","article-title":"An information-theoretic analysis of Thompson sampling","volume":"17","author":"Russo","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2024.3525096"},{"key":"ref32","first-page":"21524","article-title":"BOTORCH: A framework for efficient monte-carlo Bayesian optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Balandat"},{"issue":"290","key":"ref33","first-page":"18","article-title":"On random graphs I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debrecen"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7782633\/10411713\/10820119-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7782633\/10411713\/10820119.pdf?arnumber=10820119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T19:01:08Z","timestamp":1737399668000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10820119\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2024.3525096","relation":{},"ISSN":["2475-1456"],"issn-type":[{"value":"2475-1456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}