{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T04:27:53Z","timestamp":1730262473093,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T00:00:00Z","timestamp":1635638400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T00:00:00Z","timestamp":1635638400000},"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":[[2021,10,31]]},"DOI":"10.1109\/ieeeconf53345.2021.9723280","type":"proceedings-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:26:46Z","timestamp":1646425606000},"page":"464-470","source":"Crossref","is-referenced-by-count":1,"title":["Best Arm Identification under Additive Transfer Bandits"],"prefix":"10.1109","author":[{"given":"Ojash","family":"Neopane","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Machine Learning Department,Pittsburgh,PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaditya","family":"Ramdas","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Department of Statistics and Data Science,Pittsburgh,PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aarti","family":"Singh","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Machine Learning Department,Pittsburgh,PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1028","article-title":"Maximin action identification: a new bandit framework for games","author":"garivier","year":"2016","journal-title":"Conference on Learning Theory"},{"key":"ref11","first-page":"4897","article-title":"Monte-carlo tree search by best arm identification","author":"kaufmann","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref12","first-page":"593","article-title":"Structured best arm identification with fixed confidence","author":"huang","year":"2017","journal-title":"International Conference on Algorithmic Learning Theory"},{"key":"ref13","first-page":"550","article-title":"Bounded regret for finite-armed structured bandits","author":"lattimore","year":"2014","journal-title":"Advances in neural information processing systems"},{"article-title":"Exploiting correlation in finite-armed structured bandits","year":"2018","author":"gupta","key":"ref14"},{"key":"ref15","first-page":"10666","article-title":"Sequential experimental design for transductive linear bandits","author":"fiez","year":"2019","journal-title":"Advances in neural information processing systems"},{"article-title":"An empirical process approach to the union bound: Practical algorithms for combinatorial and linear bandits","year":"2020","author":"katz-samuels","key":"ref16"},{"key":"ref17","article-title":"Sample complexity of partition identification using multi-armed bandits","author":"juneja","year":"2019","journal-title":"Proceedings of the Thirty-Second Conference on Learning Theory"},{"article-title":"The simulator: Understanding adaptive sampling in the moderate-confidence regime","year":"2017","author":"simchowitz","key":"ref18"},{"key":"ref19","first-page":"655","article-title":"PAC subset selection in stochastic multi-armed bandits","volume":"12","author":"kalyanakrishnan","year":"2012","journal-title":"Proceedings of the Twenty-Ninth International Conference on Machine Learning"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460875"},{"key":"ref27","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":"The Journal of Machine Learning Research"},{"article-title":"Best arm identification in generalized linear bandits","year":"2019","author":"kazerouni","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2017.XIII.034"},{"key":"ref5","first-page":"262","article-title":"Sim-to-real robot learning from pixels with progressive nets","author":"rusu","year":"2017","journal-title":"Conference on Robot Learning"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2930976"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2854758"},{"key":"ref2","first-page":"41","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"COLT"},{"article-title":"Uniform, nonparametric, non-asymptotic confidence sequences","year":"2018","author":"howard","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref20","first-page":"228","article-title":"Information complexity in bandit subset selection","author":"kaufmann","year":"2013","journal-title":"Conference on Learning Theory"},{"key":"ref22","first-page":"379","article-title":"Combinatorial pure exploration of multi-armed bandits","author":"chen","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref21","first-page":"1690","article-title":"An optimal algorithm for the thresholding bandit problem","author":"locatelli","year":"2016","journal-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning-Volume 48"},{"key":"ref24","first-page":"647","article-title":"Pure exploration of multi-armed bandit under matroid constraints","author":"chen","year":"2016","journal-title":"Conference on Learning Theory"},{"key":"ref23","first-page":"558","article-title":"Disagreement-based combinatorial pure exploration: Sample complexity bounds and an efficient algorithm","author":"cao","year":"2019","journal-title":"Conference on Learning Theory"},{"key":"ref26","first-page":"1004","article-title":"Improved learning complexity in combinatorial pure exploration bandits","author":"gabillon","year":"2016","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref25","first-page":"482","article-title":"Nearly optimal sampling algorithms for combinatorial pure exploration","author":"chen","year":"2017","journal-title":"Conference on Learning Theory"}],"event":{"name":"2021 55th Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2021,10,31]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2021,11,3]]}},"container-title":["2021 55th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9723034\/9723086\/09723280.pdf?arnumber=9723280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T20:16:39Z","timestamp":1655324199000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9723280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,31]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf53345.2021.9723280","relation":{},"subject":[],"published":{"date-parts":[[2021,10,31]]}}}