{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T10:53:51Z","timestamp":1753354431294,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902042"],"award-info":[{"award-number":["61902042"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Chongqing Natural Science Foundation","doi-asserted-by":"publisher","award":["cstc2020jcyj-msxmX0652"],"award-info":[{"award-number":["cstc2020jcyj-msxmX0652"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chongqing Talents: Exceptional Young Talents Project","award":["cstc2021ycjh-bgzxm0195"],"award-info":[{"award-number":["cstc2021ycjh-bgzxm0195"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1109\/tnnls.2022.3161806","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T19:32:00Z","timestamp":1649273520000},"page":"9887-9899","source":"Crossref","is-referenced-by-count":4,"title":["A Multiplier Bootstrap Approach to Designing Robust Algorithms for Contextual Bandits"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7935-7210","authenticated-orcid":false,"given":"Hong","family":"Xie","sequence":"first","affiliation":[{"name":"Chongqing Key Laboratory of Software Theory and Technology, Chongqing University, Chongqing, China"}]},{"given":"Qiao","family":"Tang","sequence":"additional","affiliation":[{"name":"Chongqing Key Laboratory of Software Theory and Technology, Chongqing University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7737-9966","authenticated-orcid":false,"given":"Qingsheng","family":"Zhu","sequence":"additional","affiliation":[{"name":"Chongqing Key Laboratory of Software Theory and Technology, Chongqing University, Chongqing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983847"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380148"},{"key":"ref4","first-page":"1","article-title":"Contextual bandits for information retrieval","volume-title":"Proc. Workshop Bayesian Optim., Exp. Design, Bandits, Granada (NIPS)","volume":"12","author":"Hofmann"},{"key":"ref5","article-title":"BanditRank: Learning to rank using contextual bandits","author":"Gampa","year":"2019","journal-title":"arXiv:1910.10410"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/1500000067"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737560"},{"key":"ref8","first-page":"586","article-title":"Parametric bandits: The generalized linear case","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Filippi"},{"key":"ref9","article-title":"Semiparametric contextual bandits","author":"Krishnamurthy","year":"2018","journal-title":"arXiv:1803.04204"},{"key":"ref10","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Abbasi-Yadkori"},{"key":"ref11","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":"ref12","first-page":"208","article-title":"Contextual bandits with linear payoff functions","volume-title":"Proc. 14th Int. Conf. Artif. Intell. Statist.","author":"Chu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS667"},{"key":"ref15","article-title":"Non-asymptotic theory for nonparametric testing","author":"Yang","year":"2017","journal-title":"arXiv:1702.01330"},{"key":"ref16","first-page":"12123","article-title":"Bootstrapping upper confidence bound","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hao"},{"key":"ref17","first-page":"3199","article-title":"Beyond UCB: Optimal and efficient contextual bandits with regression oracles","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Foster"},{"key":"ref18","first-page":"4349","article-title":"Near-optimal representation learning for linear bandits and linear RL","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hu"},{"key":"ref19","first-page":"5805","article-title":"Adapting to misspecification in contextual bandits with offline regression oracles","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Krishnamurthy"},{"key":"ref20","first-page":"6797","article-title":"On approximate Thompson sampling with Langevin algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mazumdar"},{"key":"ref21","first-page":"8371","article-title":"Leveraging good representations in linear contextual bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Papini"},{"key":"ref22","first-page":"187","article-title":"Robust pure exploration in linear bandits with limited budget","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Alieva"},{"key":"ref23","first-page":"7905","article-title":"Online limited memory neural-linear bandits with likelihood matching","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nabati"},{"key":"ref24","first-page":"11492","article-title":"Neural contextual bandits with UCB-based exploration","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhou"},{"key":"ref25","article-title":"Thompson sampling with the online bootstrap","author":"Eckles","year":"2014","journal-title":"arXiv:1410.4009"},{"key":"ref26","article-title":"Bootstrapped Thompson sampling and deep exploration","author":"Osband","year":"2015","journal-title":"arXiv:1507.00300"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767707"},{"key":"ref28","article-title":"A practical method for solving contextual bandit problems using decision trees","author":"Elmachtoub","year":"2017","journal-title":"arXiv:1706.04687"},{"key":"ref29","first-page":"3601","article-title":"Garbage in, reward out: Bootstrapping exploration in multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kveton"},{"key":"ref30","article-title":"New insights into bootstrapping for bandits","author":"Vaswani","year":"2018","journal-title":"arXiv:1805.09793"},{"key":"ref31","article-title":"Linear bandit algorithms using the bootstrap","author":"Sudarsanam","year":"2016","journal-title":"arXiv:1605.01185"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref33","first-page":"6284","article-title":"Boltzmann exploration done right","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cesa-Bianchi"},{"key":"ref34","first-page":"11272","article-title":"Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Kagrecha"},{"key":"ref35","first-page":"8452","article-title":"Optimal algorithms for stochastic multi-armed bandits with heavy tailed rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Lee"},{"key":"ref36","first-page":"1642","article-title":"No-regret algorithms for heavy-tailed linear bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Medina"},{"key":"ref37","first-page":"8430","article-title":"Almost optimal algorithms for linear stochastic bandits with heavy-tailed payoffs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shao"},{"key":"ref38","first-page":"4154","article-title":"Optimal algorithms for Lipschitz bandits with heavy-tailed rewards","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lu"},{"key":"ref39","first-page":"235","article-title":"Forced-exploration based algorithms for playing in stochastic linear bandits","volume-title":"Proc. COLT Workshop On-Line Learn. Feedback","volume":"91","author":"Abbasi-Yadkori"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1230"},{"key":"ref42","first-page":"19","article-title":"An unbiased offline evaluation of contextual bandit algorithms with generalized linear models","volume-title":"Proc. Workshop On-Line Trading Explor. Exploitation","author":"Li"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10336252\/09750401.pdf?arnumber=9750401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T19:11:49Z","timestamp":1708110709000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9750401\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":42,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2022.3161806","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2023,12]]}}}