{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:59:50Z","timestamp":1780451990221,"version":"3.54.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"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":["CCF-1840860"],"award-info":[{"award-number":["CCF-1840860"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2007834"],"award-info":[{"award-number":["CCF-2007834"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Siebel Energy Institute"},{"name":"Carnegie Bosch Institute"},{"name":"Manufacturing Futures Initiative"},{"name":"CyLab IoT Initiative"},{"name":"CyLab Presidential Fellowship"},{"name":"David H. Barakat and LaVerne Owen-Barakat Carnegie Institute of Technology (CIT) Dean\u2019s Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tit.2021.3081508","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T20:21:28Z","timestamp":1621369288000},"page":"6711-6732","source":"Crossref","is-referenced-by-count":32,"title":["Multi-Armed Bandits With Correlated Arms"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6225-0230","authenticated-orcid":false,"given":"Samarth","family":"Gupta","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8826-2253","authenticated-orcid":false,"given":"Shreyas","family":"Chaudhari","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gauri","family":"Joshi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7057-2966","authenticated-orcid":false,"given":"Osman","family":"Ya\u011fan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3651397"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535278"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240369"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref30","first-page":"99","article-title":"Further optimal regret bounds for Thompson sampling","author":"agrawal","year":"2013","journal-title":"Proc Artif Intell Statist"},{"key":"ref37","author":"tsybakov","year":"2008","journal-title":"Introduction to Nonparametric Estimation"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref35","first-page":"423","article-title":"Lil’UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref10","author":"white","year":"2012","journal-title":"Bandit algorithms for website optimization"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012994275440"},{"key":"ref11","article-title":"A survey on contextual multi-armed bandits","author":"zhou","year":"2015","journal-title":"arXiv 1508 03326"},{"key":"ref12","first-page":"1638","article-title":"Taming the monster: A fast and simple algorithm for contextual bandits","author":"agarwal","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref13","first-page":"1763","article-title":"Minimal exploration in structured stochastic bandits","author":"combes","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"550","article-title":"Bounded regret for finite-armed structured bandits","author":"lattimore","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"abbasi-yadkori","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","first-page":"355","article-title":"Stochastic linear optimization under bandit feedback","author":"dani","year":"2008","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054429"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3041246"},{"key":"ref19","first-page":"586","article-title":"Parametric bandits: The generalized linear case","author":"filippi","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737610"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/14-STS504"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155530"},{"key":"ref3","first-page":"359","article-title":"The KL-UCB algorithm for bounded stochastic bandits and beyond","author":"garivier","year":"2011","journal-title":"Proc 24th Annu Conf Learn Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2841822"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.52"},{"key":"ref8","article-title":"Regret of queueing bandits","author":"krishnasamy","year":"2016","journal-title":"arXiv 1604 06377"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_665"},{"key":"ref2","first-page":"1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"2012","journal-title":"Proc Conf Learn Theory"},{"key":"ref9","article-title":"Efficient redundancy techniques to reduce delay in cloud systems","author":"joshi","year":"2016"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref20","first-page":"975","article-title":"Lipschitz bandits: Regret lower bound and optimal algorithms","author":"magureanu","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref22","first-page":"510","article-title":"Regional multi-armed bandits","author":"wang","year":"2018","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2818742"},{"key":"ref24","first-page":"521","article-title":"Unimodal bandits: Regret lower bounds and optimal algorithms","author":"combes","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273587"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2953607"},{"key":"ref25","first-page":"862","article-title":"Solving Bernoulli rank-one bandits with unimodal Thompson sampling","author":"trinh","year":"2020","journal-title":"Proc Algorithmic Learn Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9539105\/09434422.pdf?arnumber=9434422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T18:48:58Z","timestamp":1738176538000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9434422\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":40,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3081508","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}