{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:36:14Z","timestamp":1761964574318,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080000"},{"type":"electronic","value":"9783319080017"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08001-7_10","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:53:00Z","timestamp":1402419180000},"page":"108-119","source":"Crossref","is-referenced-by-count":4,"title":["Continuum Armed Bandit Problem of Few Variables in High Dimensions"],"prefix":"10.1007","author":[{"given":"Hemant","family":"Tyagi","sequence":"first","affiliation":[]},{"given":"Bernd","family":"G\u00e4rtner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Awerbuch, B., Kleinberg, R.: Near-optimal adaptive routing: Shortest paths and geometric generalizations. In: Proceedings of ACM Symposium on Theory of Computing (2004)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Online oblivious routing. In: Proceedings of ACM Symposium in Parallelism in Algorithms and Architectures, pp. 44\u201349 (2003)","DOI":"10.1145\/777417.777420"},{"key":"10_CR3","unstructured":"Monteleoni, C., Jaakkola, T.: Online learning of non-stationary sequences. In: Advances in Neural Information Processing Systems (2003)"},{"key":"10_CR4","unstructured":"Blum, A., Kumar, V., Rudra, A., Wu, F.: Online learning in online auctions. In: Proceedings of 14th Symp. on Discrete Alg., pp. 202\u2013204 (2003)"},{"key":"10_CR5","unstructured":"Kleinberg, R., Leighton, T.: The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In: Proceedings of Foundations of Computer Science, pp. 594\u2013605 (2003)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T.L. Lai","year":"1985","unstructured":"Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocations rules. Proceedings of Adv. in Appl. Math.\u00a06, 4\u201322 (1985)","journal-title":"Proceedings of Adv. in Appl. Math."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0531(74)90066-0","volume":"9","author":"M. Rothschild","year":"1974","unstructured":"Rothschild, M.: A two-armed bandit theory of market pricing. Journal of Economic Theory\u00a09, 185\u2013202 (1974)","journal-title":"Journal of Economic Theory"},{"key":"10_CR8","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: The adversarial multi-armed bandit problem. In: Proceedings of 36th Annual Symposium on Foundations of Computer Science, pp. 322\u2013331 (1995)"},{"issue":"2-3","key":"10_CR9","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 multiarmed bandit problem. Mach. Learn.\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"10_CR10","unstructured":"Kleinberg, R.: Nearly tight bounds for the continuum-armed bandit problem. In: 18th Advances in Neural Information Processing Systems (2004)"},{"key":"10_CR11","unstructured":"Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the dark: An efficient algorithm for bandit linear optimization. In: Proceedings of the 21st Annual Conference on Learning Theory, COLT 2008 (2008)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00365-010-9105-8","volume":"33","author":"R. DeVore","year":"2011","unstructured":"DeVore, R., Petrova, G., Wojtaszczyk, P.: Approximation of functions of few variables in high dimensions. Constr. Approx.\u00a033, 125\u2013143 (2011)","journal-title":"Constr. Approx."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M. Belkin","year":"2003","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput.\u00a015, 1373\u20131396 (2003)","journal-title":"Neural Comput."},{"key":"10_CR14","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 and Optimization\u00a033, 1926\u20131951 (1995)","journal-title":"SIAM J. Control and Optimization"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1109\/TAC.2009.2019797","volume":"54","author":"E.W. Cope","year":"2009","unstructured":"Cope, E.W.: Regret and convergence bounds for a class of continuum-armed bandit problems. IEEE Transactions on Automatic Control\u00a054, 1243\u20131253 (2009)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Auer, P., Ortner, R., Szepesvari, C.: Improved rates for the stochastic continuum-armed bandit problem. In: Proceedings of 20th Conference on Learning Theory (COLT), pp. 454\u2013468 (2007)","DOI":"10.1007\/978-3-540-72927-3_33"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Slivkins, A., Upfal, E.: Multi-armed bandits in metric spaces. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 681\u2013690 (2008)","DOI":"10.1145\/1374376.1374475"},{"key":"10_CR18","first-page":"1587","volume":"12","author":"S. Bubeck","year":"2011","unstructured":"Bubeck, S., Munos, R., Stoltz, G., Szepesvari, C.: X-armed bandits. Journal of Machine Learning Research (JMLR)\u00a012, 1587\u20131627 (2011)","journal-title":"Journal of Machine Learning Research (JMLR)"},{"key":"10_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-24412-4_14","volume-title":"Algorithmic Learning Theory","author":"S. Bubeck","year":"2011","unstructured":"Bubeck, S., Stoltz, G., Yu, J.Y.: Lipschitz bandits without the Lipschitz constant. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS (LNAI), vol.\u00a06925, pp. 144\u2013158. Springer, Heidelberg (2011)"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2003","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput.\u00a032(1), 48\u201377 (2003)","journal-title":"SIAM J. Comput."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Mossel, E., O\u2019Donnell, R., Servedio, R.: Learning juntas. In: Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 206\u2013212. ACM (2003)","DOI":"10.1145\/780542.780574"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Tyagi, H., G\u00e4rtner, B.: Continuum armed bandit problem of few variables in high dimensions. CoRR, abs\/1304.5793 (2013)","DOI":"10.1007\/978-3-319-08001-7_10"},{"key":"10_CR24","first-page":"2635","volume":"11","author":"J.-Y. Audibert","year":"2010","unstructured":"Audibert, J.-Y., Bubeck, S.: Regret bounds and minimax policies under partial monitoring. Journal of Machine Learning Research\u00a011, 2635\u20132686 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"10_CR25","unstructured":"Kleinberg, R.D.: Online Decision Problems with Large Strategy Sets. PhD thesis. MIT, Boston (2005)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08001-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:05:24Z","timestamp":1746263124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08001-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080000","9783319080017"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08001-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}