{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:36Z","timestamp":1730279076427,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613513","type":"proceedings-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T19:39:34Z","timestamp":1547753974000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Best Arm Identification for Both Stochastic and Adversarial Multi-armed Bandits"],"prefix":"10.1109","author":[{"given":"Hantao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"423","article-title":"lilUCB: An optimal exploration algorithm for multi-armed bandits","volume":"35","author":"jamieson","year":"2014","journal-title":"Proceedings of the 27th Annual Conference on Learning Theory vol PMLR"},{"key":"ref3","first-page":"655","article-title":"PAC subset selection in stochastic multi-armed bandits","author":"kalyanakrishnan","year":"2012","journal-title":"Proceedings of the 29th International Conference on Machine Learning Omnipress"},{"key":"ref6","first-page":"42.1","article-title":"The best of both worlds: Stochastic and adversarial bandits","volume":"23","author":"bubeck","year":"2012","journal-title":"Proceedings of the 25th Annual Conference on Learning Theory vol"},{"key":"ref5","first-page":"240","article-title":"Non-stochastic best arm identification and hyperparameter optimization","volume":"51","author":"jamieson","year":"2016","journal-title":"Proceedings of the 19th International Conference on Artificial Intelligence and Statistics vol"},{"key":"ref8","first-page":"1287","article-title":"One practical algorithm for both stochastic and adversarial bandits","author":"seldin","year":"2014","journal-title":"Proceedings of the 31st International Conference on Machine Learning Bejing China PMLR"},{"key":"ref7","first-page":"116","article-title":"An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits","volume":"49","author":"auer","year":"2016","journal-title":"Proceedings of the 29th Annual Conference on Learning Theory vol"},{"key":"ref2","first-page":"1238","article-title":"Almost optimal exploration in multi-armed bandits","volume":"28","author":"karnin","year":"2013","journal-title":"Proceedings of the 30th International Conference on Machine Learning"},{"key":"ref9","first-page":"974","article-title":"Portfolio choices with orthogonal bandit learning","author":"shen","year":"2015","journal-title":"Proceedings of the 24th International Conference on Artificial Intelligence ser IJCAI'15 AAAI Press"},{"key":"ref1","first-page":"41","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"Proc 23rd Annu Conf Learn Theory"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613513.pdf?arnumber=8613513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T19:19:13Z","timestamp":1643224753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613513\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613513","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}