{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:11:16Z","timestamp":1725988276362},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374475","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":112,"title":["Multi-armed bandits in metric spaces"],"prefix":"10.1145","author":[{"given":"Robert","family":"Kleinberg","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Aleksandrs","family":"Slivkins","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992237273"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_4_1","first-page":"454","volume-title":"Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th Conference on Learning Theory (COLT)","author":"Auer P.","year":"2007","unstructured":"P. Auer , R. Ortner , and C. Szepesv\u00e1ri . Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th Conference on Learning Theory (COLT) , pages 454 -- 468 , 2007 . P. Auer, R. Ortner, and C. Szepesv\u00e1ri. Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th Conference on Learning Theory (COLT), pages 454--468, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.016"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/2951539"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-3711-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_1_9_1","volume-title":"Regret and convergence bounds for immediate-reward reinforcement learning with continuous action spaces","author":"Cope E.","year":"2004","unstructured":"E. Cope . Regret and convergence bounds for immediate-reward reinforcement learning with continuous action spaces , 2004 . Unpublished manuscript. E. Cope. Regret and convergence bounds for immediate-reward reinforcement learning with continuous action spaces, 2004. Unpublished manuscript."},{"key":"e_1_3_2_1_10_1","volume-title":"Preprint","author":"Dani V.","year":"2007","unstructured":"V. Dani , T. Hayes , and S. M. Kakade . The Price of Bandit Information for Online Optimization . Preprint , 2007 . V. Dani, T. Hayes, and S. M. Kakade. The Price of Bandit Information for Online Optimization. Preprint, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109660"},{"key":"e_1_3_2_1_12_1","first-page":"385","volume-title":"16th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Flaxman A. D.","year":"2005","unstructured":"A. D. Flaxman , A. T. Kalai , and H. B. McMahan . Online convex optimization in the bandit setting: Gradient descent without a gradient . In 16th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 385 -- 394 , 2005 . A. D. Flaxman, A. T. Kalai, and H. B. McMahan. Online convex optimization in the bandit setting: Gradient descent without a gradient. In 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 385--394, 2005."},{"key":"e_1_3_2_1_13_1","first-page":"241","volume-title":"Progress in Statistics","author":"Gittins J. C.","year":"1974","unstructured":"J. C. Gittins and D. M. Jones . A dynamic allocation index for the sequential design of experiments. In J. G. et al., editor , Progress in Statistics , pages 241 -- 266 . North-Holland , 1974 . J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In J. G. et al., editor, Progress in Statistics, pages 241--266. North-Holland, 1974."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250870"},{"key":"e_1_3_2_1_15_1","volume-title":"18th Advances in Neural Information Processing Systems (NIPS)","author":"Kleinberg R.","year":"2004","unstructured":"R. Kleinberg . Nearly tight bounds for the continuum-armed bandit problem . In 18th Advances in Neural Information Processing Systems (NIPS) , 2004 . Full version appeared as Chapters 4-5 in {16}. R. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. In 18th Advances in Neural Information Processing Systems (NIPS), 2004. Full version appeared as Chapters 4-5 in {16}."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27819-1_8"},{"key":"e_1_3_2_1_18_1","first-page":"12","article-title":"On the constant in the nonuniform version of the Berry-Esseen theorem","volume":"2005","author":"Neammanee K.","year":"1951","unstructured":"K. Neammanee . On the constant in the nonuniform version of the Berry-Esseen theorem . Intl. J. of Mathematics and Mathematical Sciences , 2005 : 12 : 1951 --1967, 2005. K. Neammanee. On the constant in the nonuniform version of the Berry-Esseen theorem. Intl. J. of Mathematics and Mathematical Sciences, 2005:12:1951--1967, 2005.","journal-title":"Intl. J. of Mathematics and Mathematical Sciences"},{"key":"e_1_3_2_1_19_1","volume-title":"Bandits for Taxonomies: A Model-based Approach. In SIAM Intl. Conf. on Data Mining (SDM)","author":"Pandey S.","year":"2007","unstructured":"S. Pandey , D. Agarwal , D. Chakrabarti , and V. Josifovski . Bandits for Taxonomies: A Model-based Approach. In SIAM Intl. Conf. on Data Mining (SDM) , 2007 . S. Pandey, D. Agarwal, D. Chakrabarti, and V. Josifovski. Bandits for Taxonomies: A Model-based Approach. In SIAM Intl. Conf. on Data Mining (SDM), 2007."}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T02:49:26Z","timestamp":1673405366000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":18,"alternative-id":["10.1145\/1374376.1374475","10.1145\/1374376"],"URL":"http:\/\/dx.doi.org\/10.1145\/1374376.1374475","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}