{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:35:46Z","timestamp":1774643746524,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055403","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"72-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Kernel-based methods for bandit convex optimization"],"prefix":"10.1145","author":[{"given":"S\u00e9bastien","family":"Bubeck","sequence":"first","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin Tat","family":"Lee","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronen","family":"Eldan","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"J. Abernethy E. Hazan and A. Rakhlin. 2008.  J. Abernethy E. Hazan and A. Rakhlin. 2008."},{"key":"e_1_3_2_2_2_1","volume-title":"Dark: An Efficient Algorithm for Bandit Linear Optimization. In Proceedings of the 21st Annual Conference on Learning Theory (COLT)."},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of the 23rd Annual Conference on Learning Theory (COLT).","author":"Agarwal A."},{"key":"e_1_3_2_2_4_1","unstructured":"A. Agarwal D.P. Foster D. Hsu S.M. Kakade and A. Rakhlin. 2011. Stochastic convex optimization with bandit feedback. In Advances in Neural Information Processing Systems (NIPS).   A. Agarwal D.P. Foster D. Hsu S.M. Kakade and A. Rakhlin. 2011. Stochastic convex optimization with bandit feedback. In Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the 29th Annual Conference on Learning Theory (COLT).","author":"Bach F."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-03-11912-2"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of the 28th Annual Conference on Learning Theory (COLT).","author":"Belloni A."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the 25th Annual Conference on Learning Theory (COLT).","author":"Bubeck S."},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of the 28th Annual Conference on Learning Theory (COLT).","author":"Bubeck S."},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings of the 29th Annual Conference on Learning Theory (COLT).","author":"Bubeck S."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"S. Bubeck Y.T. Lee and R. Eldan. 2016. Kernel-based methods for bandit convex optimization. arXiv preprint arXiv:1607.03084 (2016).  S. Bubeck Y.T. Lee and R. Eldan. 2016. Kernel-based methods for bandit convex optimization. arXiv preprint arXiv:1607.03084 (2016).","DOI":"10.1145\/3055399.3055403"},{"key":"e_1_3_2_2_13_1","unstructured":"A. Conn K. Scheinberg and L. Vicente. 2009.  A. Conn K. Scheinberg and L. Vicente. 2009."},{"key":"e_1_3_2_2_14_1","unstructured":"Introduction to Derivative-Free Optimization. Society for Industrial and Applied Mathematics (SIAM).   Introduction to Derivative-Free Optimization. Society for Industrial and Applied Mathematics (SIAM)."},{"key":"e_1_3_2_2_15_1","unstructured":"V. Dani T. Hayes and S. Kakade. 2008. The price of bandit information for online optimization. In Advances in Neural Information Processing Systems (NIPS).   V. Dani T. Hayes and S. Kakade. 2008. The price of bandit information for online optimization. In Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_3_2_2_16_1","unstructured":"O. Dekel R. Eldan and T. Koren. 2015. Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff. In Advances in Neural Information Processing Systems 28 C. Cortes N. D. Lawrence D. D. Lee M. Sugiyama and R. Garnett (Eds.). 2926\u20132934.   O. Dekel R. Eldan and T. Koren. 2015. Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff. In Advances in Neural Information Processing Systems 28 C. Cortes N. D. Lawrence D. D. Lee M. Sugiyama and R. Garnett (Eds.). 2926\u20132934."},{"key":"e_1_3_2_2_17_1","unstructured":"P. Erd\u00f6s. 1939.  P. Erd\u00f6s. 1939."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"On a family of symmetric Bernoulli convolutions. American Journal of Mathematics 61 4 (1939) 974\u2013976.  On a family of symmetric Bernoulli convolutions. American Journal of Mathematics 61 4 (1939) 974\u2013976.","DOI":"10.2307\/2371641"},{"key":"e_1_3_2_2_19_1","volume-title":"In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Flaxman A."},{"key":"e_1_3_2_2_20_1","unstructured":"E. Hazan and K. Levy. 2014. Bandit Convex Optimization: Towards Tight Bounds. In Advances in Neural Information Processing Systems (NIPS).   E. Hazan and K. Levy. 2014. Bandit Convex Optimization: Towards Tight Bounds. In Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_3_2_2_21_1","unstructured":"E. Hazan and Y. Li. 2016. An optimal algorithm for bandit convex optimization. arXiv preprint arXiv:1603.04350 (2016).  E. Hazan and Y. Li. 2016. An optimal algorithm for bandit convex optimization. arXiv preprint arXiv:1603.04350 (2016)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-004-0344-0"},{"key":"e_1_3_2_2_23_1","unstructured":"R. Kleinberg. 2004. Nearly tight bounds for the continuum-armed bandit problem. Advances in Neural Information Processing Systems (NIPS) (2004).   R. Kleinberg. 2004. Nearly tight bounds for the continuum-armed bandit problem. Advances in Neural Information Processing Systems (NIPS) (2004)."},{"key":"e_1_3_2_2_24_1","first-page":"1244","article-title":"On an algorithm for the minimization of convex functions","volume":"160","author":"Levin A.","year":"1965","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_2_25_1","volume-title":"Lecture Notes in Math.","volume":"1376","author":"Milman V. D."},{"key":"e_1_3_2_2_26_1","unstructured":"A. Nemirovski and D. Yudin. 1983.  A. Nemirovski and D. Yudin. 1983."},{"key":"e_1_3_2_2_27_1","unstructured":"Problem Complexity and Method Efficiency in Optimization. Wiley Interscience.  Problem Complexity and Method Efficiency in Optimization. Wiley Interscience."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321281.321291"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Y. Peres W. Schlag and B. Solomyak. 2000. Sixty years of Bernoulli convolutions. In Fractal geometry and stochastics II. Springer 39\u201365.  Y. Peres W. Schlag and B. Solomyak. 2000. Sixty years of Bernoulli convolutions. In Fractal geometry and stochastics II. Springer 39\u201365.","DOI":"10.1007\/978-3-0348-8380-1_2"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02312467"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/3.3.175"},{"key":"e_1_3_2_2_32_1","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTAT). 636\u2013642","author":"Saha A."},{"key":"e_1_3_2_2_33_1","volume-title":"Proceedings of the 26th Annual Conference on Learning Theory (COLT).","author":"Shamir O.","year":"2013"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:26Z","timestamp":1750220606000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":33,"alternative-id":["10.1145\/3055399.3055403","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055403","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}