{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:55:18Z","timestamp":1774022118576,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/ijcnn48605.2020.9207422","type":"proceedings-article","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T00:40:33Z","timestamp":1601426433000},"page":"1-8","source":"Crossref","is-referenced-by-count":4,"title":["Regret Analysis of Stochastic Multi-armed Bandit Problem with Clustered Information Feedback"],"prefix":"10.1109","author":[{"given":"Tianchi","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Tandon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"133","article-title":"Parallelised bayesian optimisation via thompson sampling","author":"kandasamy","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref11","first-page":"592","article-title":"On bayesian upper confidence bounds for bandit problems","author":"kaufmann","year":"2012","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref12","first-page":"228","article-title":"Information complexity in bandit subset selection","author":"kaufmann","year":"2013","journal-title":"Conference on Learning Theory"},{"key":"ref13","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"2015","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref15","first-page":"2442","article-title":"An information-theoretic analysis of thompson sampling","volume":"17","author":"russo","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/2200000070"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/2200000070"},{"key":"ref18","article-title":"Budgeted multi-armed bandits with multiple plays","author":"xia","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761809"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref3","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume":"3","author":"auer","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986276"},{"key":"ref5","article-title":"A sequential monte carlo approach to thompson sampling for bayesian optimization","author":"bijl","year":"2016"},{"key":"ref8","first-page":"359","article-title":"The kl-ucb algorithm for bounded stochastic bandits and beyond","author":"garivier","year":"2011","journal-title":"Proceedings of the 24th Annual Conference on Learning Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1119"},{"key":"ref2","first-page":"99","article-title":"Further optimal regret bounds for thompson sampling","author":"agrawal","year":"2013","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref1","first-page":"39","article-title":"Analysis of thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"2012","journal-title":"Conference on Learning Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"}],"event":{"name":"2020 International Joint Conference on Neural Networks (IJCNN)","location":"Glasgow, United Kingdom","start":{"date-parts":[[2020,7,19]]},"end":{"date-parts":[[2020,7,24]]}},"container-title":["2020 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9200848\/9206590\/09207422.pdf?arnumber=9207422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:53:53Z","timestamp":1656453233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9207422\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ijcnn48605.2020.9207422","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}