{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:47Z","timestamp":1740131687089,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-17130003"],"award-info":[{"award-number":["DMS-17130003"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1563918"],"award-info":[{"award-number":["CCF-1563918"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA8750-17-2-0212"],"award-info":[{"award-number":["FA8750-17-2-0212"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/tit.2019.2921985","type":"journal-article","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:38:15Z","timestamp":1560195495000},"page":"7350-7366","source":"Crossref","is-referenced-by-count":4,"title":["Optimization of Smooth Functions With Noisy Observations: Local Minimax Rates"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9410-0392","authenticated-orcid":false,"given":"Yining","family":"Wang","sequence":"first","affiliation":[]},{"given":"Sivaraman","family":"Balakrishnan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8278-3672","authenticated-orcid":false,"given":"Aarti","family":"Singh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"797","article-title":"Escaping from saddle points—Online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proc 19th Ann Conf Learning Theory (COLT)"},{"key":"ref38","first-page":"1594","article-title":"Beyond convexity: Stochastic quasi-convex optimization","author":"hazan","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3150\/09-BEJ184"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176324626"},{"key":"ref31","first-page":"1079","article-title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","volume":"7","author":"even-dar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273541"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref36","first-page":"2679","article-title":"Cluster trees on manifolds","author":"balakrishnan","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2361055"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS661"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585710"},{"key":"ref29","first-page":"353","article-title":"A general agnostic active learning algorithm","author":"dasgupta","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/srep01003"},{"key":"ref1","volume":"1","author":"rasmussen","year":"2006","journal-title":"Gaussian Processes for Machine Learning"},{"key":"ref20","first-page":"697","article-title":"Nearly tight bounds for the continuum-armed bandit problem","author":"kleinberg","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref22","first-page":"667","article-title":"Black-box optimization of noisy functions with unknown smoothness","author":"grill","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref21","first-page":"105","article-title":"Estimation of extreme values and associated level sets of a regression function via selective sampling","author":"minsker","year":"2013","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729392"},{"article-title":"Non-asymptotic bounds for prediction problems and density estimation","year":"2012","author":"minsker","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350965"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704472"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920189"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1561\/2200000048"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v17-2079"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.3150\/13-BEJ555"},{"journal-title":"Texturing and Modeling A Procedural Approach","year":"2003","author":"ebert","key":"ref54"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-4076(97)00011-0"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1214\/aos\/1069362731","article-title":"Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors","volume":"25","author":"lepski","year":"1997","journal-title":"Ann Statist"},{"key":"ref10","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref11","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Proc 19th Ann Conf Learning Theory (COLT)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055464"},{"key":"ref12","first-page":"2672","article-title":"Query complexity of derivative-free optimization","author":"jamieson","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/110850827"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055403"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02592070","article-title":"Stochastic global optimization methods part I: Clustering methods","volume":"39","author":"kan","year":"1987","journal-title":"Math Program"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02592071","article-title":"Stochastic global optimization methods part II: Multi level methods","volume":"39","author":"kan","year":"1987","journal-title":"Math Program"},{"key":"ref17","first-page":"1655","article-title":"X-armed bandits","volume":"12","author":"bubeck","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref18","first-page":"1539","article-title":"A ranking approach to global optimization","author":"malherbe","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref19","first-page":"2314","article-title":"Global optimization of Lipschitz functions","author":"malherbe","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/asmb.2243"},{"key":"ref6","first-page":"2879","article-title":"Convergence rates of efficient global optimization algorithms","volume":"12","author":"bull","year":"2011","journal-title":"J Mach Learn Res"},{"journal-title":"Local Polynomial Modelling and Its Applications","year":"1996","author":"fan","key":"ref5"},{"key":"ref8","article-title":"Hyperparameter optimization: A spectral approach","author":"hazan","year":"2017","journal-title":"arXiv 1706 00764"},{"key":"ref7","first-page":"1723","article-title":"Lower bounds on regret for noisy Gaussian process bandit optimization","author":"scarlett","year":"2017","journal-title":"Proc 19th Ann Conf Learning Theory (COLT)"},{"key":"ref49","volume":"82","author":"korostelev","year":"2012","journal-title":"Minimax Theory of Image Reconstruction"},{"journal-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","author":"nemirovski","key":"ref9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511802256"},{"key":"ref45","first-page":"1463","article-title":"Adaptivity to smoothness in X-armed bandits","author":"locatelli","year":"2018","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1214\/009053604000000049","article-title":"An adaptation theory for nonparametric confidence intervals","volume":"32","author":"cai","year":"2004","journal-title":"Ann Statist"},{"key":"ref47","first-page":"1","article-title":"On the local minima of the empirical risk","author":"jin","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","first-page":"1","article-title":"A hitting time analysis of stochastic gradient Langevin dynamics","author":"zhang","year":"2017","journal-title":"Proc 19th Ann Conf Learning Theory (COLT)"},{"key":"ref41","article-title":"‘Convex until proven guilty’: Dimension-free acceleration of gradient descent on non-convex functions","author":"carmon","year":"2017","journal-title":"arXiv 1705 02766"},{"key":"ref44","article-title":"Asymptotic optimality in stochastic optimization","author":"duchi","year":"2016","journal-title":"arXiv 1612 05612"},{"key":"ref43","first-page":"3431","article-title":"Local minimax complexity of stochastic convex optimization","author":"zhu","year":"2016","journal-title":"Proc NIPS"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8876732\/8734094-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8876732\/08734094.pdf?arnumber=8734094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:17Z","timestamp":1657746557000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8734094\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":58,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2921985","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,11]]}}}