{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:57:08Z","timestamp":1772906228549,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Department of Sciene and Technology, Government of India","award":["CRG\/2021\/002923"],"award-info":[{"award-number":["CRG\/2021\/002923"]}]},{"name":"Department of Sciene and Technology, Government of India","award":["MTR\/2021\/000532"],"award-info":[{"award-number":["MTR\/2021\/000532"]}]},{"DOI":"10.13039\/100017167","name":"International Centre for Theoretical Sciences (ICTS)","doi-asserted-by":"publisher","award":["ICTS\/paap2019\/08"],"award-info":[{"award-number":["ICTS\/paap2019\/08"]}],"id":[{"id":"10.13039\/100017167","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tit.2022.3163524","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:58:06Z","timestamp":1648670286000},"page":"5248-5267","source":"Crossref","is-referenced-by-count":6,"title":["Statistically Robust, Risk-Averse Best Arm Identification in Multi-Armed Bandits"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6287-5705","authenticated-orcid":false,"given":"Anmol","family":"Kagrecha","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, IIT Bombay, Mumbai, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3849-8858","authenticated-orcid":false,"given":"Jayakrishnan","family":"Nair","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, IIT Bombay, Mumbai, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4436-5103","authenticated-orcid":false,"given":"Krishna","family":"Jagannathan","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, IIT Madras, Chennai, India"}]}],"member":"263","reference":[{"key":"ref1","first-page":"11269","article-title":"Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kagrecha"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2263494"},{"key":"ref4","first-page":"937","article-title":"Pure exploration of multi-armed bandits with heavy-tailed payoffs","volume-title":"Proc. 34th Conf. Uncertainty Artif. Intell.","author":"Yu"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450896-6.50004-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9965.00068"},{"key":"ref7","first-page":"5577","article-title":"Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Prashanth"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref10","first-page":"1089","article-title":"Extreme bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Carpentier"},{"key":"ref11","first-page":"3275","article-title":"Risk-aversion in multi-armed bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sani"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2592622"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40935-6_16"},{"key":"ref14","article-title":"Generalized risk-aversion in stochastic multi-armed bandits","volume-title":"arXiv:1405.0833","author":"Zimin","year":"2014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_35"},{"key":"ref16","article-title":"PAC bandits with risk constraints","volume-title":"Proc. ISAIM","author":"David"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.11.005"},{"key":"ref18","first-page":"245","article-title":"Exploration vs exploitation vs safety: Risk-aware multi-armed bandits","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"Galichet"},{"key":"ref19","article-title":"Distributionally-aware exploration for CVaR bandits","volume-title":"Proc. NIPS Workshop Saf. Robustness Decis. Making","author":"Tamkin"},{"key":"ref20","first-page":"1295","article-title":"A general approach to multi-armed bandits under risk criteria","volume-title":"Proc. Conf. Learn. Theory","author":"Cassel"},{"key":"ref21","first-page":"25578","article-title":"Optimal best-arm identification methods for tail-risk measures","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Agrawal"},{"key":"ref22","first-page":"998","article-title":"Optimal best arm identification with fixed confidence","volume-title":"Proc. Conf. Learn. Theory","author":"Garivier"},{"key":"ref23","first-page":"622","article-title":"Bandit algorithms: Letting go of logarithmic regret for statistical robustness","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Ashutosh"},{"key":"ref24","first-page":"11599","article-title":"Thompson sampling algorithms for mean-variance bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhu"},{"key":"ref25","first-page":"716","article-title":"Optimal Thompson sampling strategies for support-aware CVaR bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Baudry"},{"key":"ref26","first-page":"12513","article-title":"Quantile bandits for best arms identification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3081525"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511721434"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/9781009053730"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.171377"},{"key":"ref31","first-page":"974","article-title":"Portfolio choices with orthogonal bandit learning","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Shen"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/713665670"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9228-z"},{"key":"ref34","first-page":"1","article-title":"Meta-scheduling for the wireless downlink through learning with bandit feedback","volume-title":"Proc. Int. Symp. Modeling Optim. Mobile, Ad Hoc, Wireless Netw. (WiOPT)","author":"Song"},{"issue":"1","key":"ref35","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","article-title":"Heavy-tailed phenomena in satisfiability and constraint satisfaction problems","volume":"24","author":"Gomes","year":"2000","journal-title":"J. Automated Reasoning"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/047120644X"},{"key":"ref37","first-page":"13","article-title":"Best arm identification in multi-armed bandits","volume-title":"Proc. 23rd Conf. Learn. Theory (COLT)","author":"Audibert"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/570950"},{"issue":"1","key":"ref39","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"Kaufmann","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref40","article-title":"Selecting the best system and multi-armed bandits","volume-title":"arXiv:1507.04564","author":"Glynn","year":"2015"},{"key":"ref41","first-page":"1238","article-title":"Almost optimal exploration in multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karnin"},{"key":"ref42","article-title":"What doubling tricks can and can\u2019t do for multi-armed bandits","volume-title":"arXiv:1803.06971","author":"Besson","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316481"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.11.008"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700058"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"ref47","first-page":"1056","article-title":"Tightening exploration in upper confidence reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bourel"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2016.08.016"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1201\/chlenopuamt"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9829223\/09745056.pdf?arnumber=9745056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:27:36Z","timestamp":1705537656000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9745056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":49,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3163524","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}