{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:33:13Z","timestamp":1759336393813,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100018903","name":"Baidu Research, Bellevue, WA, USA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100018903","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/tit.2022.3209931","type":"journal-article","created":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T20:46:38Z","timestamp":1664225198000},"page":"1761-1776","source":"Crossref","is-referenced-by-count":3,"title":["Extreme Bandits Using Robust Statistics"],"prefix":"10.1109","volume":"69","author":[{"given":"Sujay","family":"Bhatt","sequence":"first","affiliation":[{"name":"Cognitive Computing Laboratory, Baidu Research, Bellevue, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5979-8868","authenticated-orcid":false,"given":"Ping","family":"Li","sequence":"additional","affiliation":[{"name":"Cognitive Computing Laboratory, Baidu Research, Bellevue, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9947-2574","authenticated-orcid":false,"given":"Gennady","family":"Samorodnitsky","sequence":"additional","affiliation":[{"name":"Cognitive Computing Laboratory, Baidu Research, Bellevue, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref6","first-page":"1355","article-title":"The max K-armed bandit: A new model of exploration applied to search heuristic selection","volume-title":"Proc. 20th Nat. Conf. Artif. Intell. 17th Innov. Appl. Artif. Intell. Conf. (AAAI)","author":"Cicirello"},{"key":"ref7","first-page":"211","article-title":"A classification framework for anomaly detection","volume":"6","author":"Steinwart","year":"2005","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","first-page":"259","article-title":"No regret bound for extreme bandits","volume-title":"Proc. 19th Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Nishihara"},{"key":"ref9","first-page":"135","article-title":"An asymptotically optimal algorithm for the max k-armed bandit problem","volume-title":"Proc. 21st Nat. Conf. Artif. Intell. 18th Innov. Appl. Artif. Intell. Conf. (AAAI)","author":"Streeter"},{"key":"ref10","first-page":"1089","article-title":"Extreme bandits","volume-title":"Proc. Adv. Neural Inf. Process. (NIPS)","author":"Carpentier"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71246-8_24"},{"key":"ref12","first-page":"878","article-title":"PAC lower bounds and efficient algorithms for the max K-armed bandit problem","volume-title":"Proc. 33rd Int. Conf. Mach. Learn. (ICML)","author":"David"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11889205_40"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4749-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592686"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402973"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3008091"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2010.05.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346723"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2011.04.147"},{"issue":"1","key":"ref21","first-page":"6765","article-title":"Hyperband: A novel bandit-based approach to hyperparameter optimization","volume":"18","author":"Li","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1021\/cc034040l"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719062"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803888"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_225287"},{"key":"ref26","first-page":"1448","article-title":"Thompson sampling for 1-dimensional exponential family bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Korda"},{"key":"ref27","first-page":"937","article-title":"Pure exploration of multi-armed bandits with heavy-tailed payoffs","volume-title":"Proc. 34th Conf. Uncertainty Artif. Intell. (UAI)","author":"Yu"},{"key":"ref28","first-page":"1214","article-title":"Regret analysis of the finite-horizon Gittins index strategy for multi-armed bandits","volume-title":"Proc. 29th Conf. Learn. Theory (COLT)","author":"Lattimore"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10046300\/09903456.pdf?arnumber=9903456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:52:01Z","timestamp":1705963921000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9903456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":29,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3209931","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}