{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T16:10:34Z","timestamp":1791821434765,"version":"4.3.4"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"ONR MURI","award":["N00014-11-1-0688"],"award-info":[{"award-number":["N00014-11-1-0688"]}]},{"DOI":"10.13039\/100000183","name":"U.S. Army Research Office","doi-asserted-by":"crossref","award":["W911NF-11-1-0391"],"award-info":[{"award-number":["W911NF-11-1-0391"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["CIF-31712-23800"],"award-info":[{"award-number":["CIF-31712-23800"]}]},{"name":"National Defense Science and Engineering Graduate Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/tit.2015.2409256","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T20:08:01Z","timestamp":1425586081000},"page":"2788-2806","source":"Crossref","is-referenced-by-count":266,"title":["Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations"],"prefix":"10.1109","volume":"61","author":[{"given":"John C.","family":"Duchi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael I.","family":"Jordan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin J.","family":"Wainwright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andre","family":"Wibisono","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934819"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1214\/aos\/1017939142","article-title":"Information-theoretic determination of minimax rates of convergence","volume":"27","author":"yang","year":"1999","journal-title":"Ann Statist"},{"key":"ref32","first-page":"217","article-title":"Minimax policies for adversarial and stochastic bandits","author":"audibert","year":"2009","journal-title":"Proc Annu Conf Computational Learning Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref37","author":"ledoux","year":"2001","journal-title":"The Concentration of Measure Phenomenon"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/188","volume":"188","author":"buldygin","year":"2000","journal-title":"Metric Characterization of Random Variables and Random Processes"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2215837"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Found Trends Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102464"},{"key":"ref12","author":"nemirovsky","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref13","first-page":"2672","article-title":"Query complexity of derivative-free optimization","volume":"25","author":"jamieson","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"3","article-title":"On the complexity of bandit and derivative-free stochastic convex optimization","author":"shamir","year":"2013","journal-title":"Proc Annu Conf Computational Learning Theory"},{"key":"ref15","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref18","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"xiao","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref19","author":"hiriart-urruty","year":"1993","journal-title":"Convex Analysis and Minimization Algorithms II"},{"key":"ref28","author":"polyak","year":"1987","journal-title":"Introduction to Optimization"},{"key":"ref4","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Proc Annu Conf Computational Learning Theory"},{"key":"ref27","author":"gupal","year":"1979","journal-title":"Stokhasticheskie Methody Resheniya Negladkikh Ekstremal’nykh Zadach (Stochastic Methods for Solving Nonsmooth Extremal Problems)"},{"key":"ref3","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref5","article-title":"Random gradient-free minimization of convex functions","author":"nesterov","year":"2011"},{"key":"ref8","first-page":"335","article-title":"High-probability regret bounds for bandit online linear optimization","author":"bartlett","year":"2008","journal-title":"Proc Annu Conf Computational Learning Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/110850827"},{"key":"ref2","author":"kushner","year":"2003","journal-title":"Stochastic Approximation and Recursive Algorithms and Applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833339"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026319107706"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499354564"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/110831659"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7088688\/07055287.pdf?arnumber=7055287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T14:21:39Z","timestamp":1651414899000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7055287\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":39,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2409256","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5]]}}}