{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T02:11:50Z","timestamp":1782353510254,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729259","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_33","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"454-468","source":"Crossref","is-referenced-by-count":67,"title":["Improved Rates for the Stochastic Continuum-Armed Bandit Problem"],"prefix":"10.1007","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald","family":"Ortner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Csaba","family":"Szepesv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Kleinberg, R.: Nearly tight bounds for the continuum-armed bandit problem. In: Advances in Neural Information Processing Systems 17 NIPS, 697\u2013704 (2004)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1137\/S0363012992237273","volume":"33","author":"R. Agrawal","year":"1995","unstructured":"Agrawal, R.: The continuum-armed bandit problem. SIAM J. Control Optim.\u00a033, 1926\u20131951 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"33_CR3","unstructured":"Cope, E.: Regret and convergence bounds for a class of continuum-armed bandit problems. submitted (2006)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multi-armed bandit problem. Mach. Learn.\u00a047, 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1109\/TIT.2005.847729","volume":"51","author":"N. Cesa-Bianchi","year":"2004","unstructured":"Cesa-Bianchi, N., Lugosi, G., Stoltz, G.: Minimizing regret with label efficient prediction. IEEE Trans. Inform. Theory\u00a051, 2152\u20132162 (2004)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:05Z","timestamp":1605762485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_33","relation":{},"subject":[]}}