{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:29:27Z","timestamp":1773329367985,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["819789"],"award-info":[{"award-number":["819789"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["861137"],"award-info":[{"award-number":["861137"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015464","name":"European Office of Aerospace Research and Development","doi-asserted-by":"publisher","award":["FA9550-18-1-7009"],"award-info":[{"award-number":["FA9550-18-1-7009"]}],"id":[{"id":"10.13039\/100015464","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015464","name":"European Office of Aerospace Research and Development","doi-asserted-by":"publisher","award":["FA8655-22-1-7034"],"award-info":[{"award-number":["FA8655-22-1-7034"]}],"id":[{"id":"10.13039\/100015464","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015464","name":"European Office of Aerospace Research and Development","doi-asserted-by":"publisher","award":["777826"],"award-info":[{"award-number":["777826"]}],"id":[{"id":"10.13039\/100015464","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10589-024-00616-1","type":"journal-article","created":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T14:03:02Z","timestamp":1729260182000},"page":"691-727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Stochastic zeroth order descent with structured directions"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3839-1429","authenticated-orcid":false,"given":"Marco","family":"Rando","sequence":"first","affiliation":[]},{"given":"Cesare","family":"Molinari","sequence":"additional","affiliation":[]},{"given":"Silvia","family":"Villa","sequence":"additional","affiliation":[]},{"given":"Lorenzo","family":"Rosasco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,18]]},"reference":[{"key":"616_CR1","unstructured":"Garrigos, G., Gower, R.M.: Handbook of convergence theorems for (stochastic) gradient methods (2024). arXiv:2301.11235 [math.OC]"},{"key":"616_CR2","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S., Sutskever, I.: Evolution strategies as a scalable alternative to reinforcement learning (2017). arXiv:1703.03864 [stat.ML]"},{"key":"616_CR3","unstructured":"Mania, H., Guy, A., Recht, B.: Simple random search of static linear policies is competitive for reinforcement learning. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems. NIPS\u201918, pp. 1805\u20131814. Curran Associates Inc., Red Hook, NY, USA (2018)"},{"key":"616_CR4","unstructured":"Choromanski, K., Rowland, M., Sindhwani, V., Turner, R., Weller, A.: Structured evolution with compact architectures for scalable policy optimization. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 970\u2013978 (2018). https:\/\/proceedings.mlr.press\/v80\/choromanski18a.html"},{"key":"616_CR5","unstructured":"Flaxman, A., Kalai, A.T., McMahan, B.: Online convex optimization in the bandit setting: Gradient descent without a gradient. In: SODA \u201905 Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 385\u2013394 (2005). https:\/\/www.microsoft.com\/en-us\/research\/publication\/online-convex-optimization-bandit-setting-gradient-descent-without-gradient\/"},{"key":"616_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization","author":"JC Spall","year":"2003","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization, 1st edn. John Wiley & Sons Inc, USA (2003)","edition":"1"},{"key":"616_CR7","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to derivative-free optimization. In: MPS-SIAM Series on Optimization (2009)","DOI":"10.1137\/1.9780898718768"},{"issue":"5","key":"616_CR8","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"JC Duchi","year":"2015","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: the power of two function evaluations. IEEE Trans. Inf. Theory 61(5), 2788\u20132806 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2409256","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"616_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2017). https:\/\/doi.org\/10.1007\/s10208-015-9296-2","journal-title":"Found. Comput. Math."},{"key":"616_CR10","unstructured":"Chen, R., Wild, S.: Randomized derivative-free optimization of noisy convex functions (2015). arXiv:1507.03332 [math.OC]"},{"issue":"2","key":"616_CR11","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/21M1392966","volume":"32","author":"H Cai","year":"2022","unstructured":"Cai, H., McKenzie, D., Yin, W., Zhang, Z.: Zeroth-order regularized optimization (zoro): approximately sparse gradients and adaptive sampling. SIAM J. Optim. 32(2), 687\u2013714 (2022). https:\/\/doi.org\/10.1137\/21M1392966","journal-title":"SIAM J. Optim."},{"key":"616_CR12","unstructured":"Cai, H., Lou, Y., Mckenzie, D., Yin, W.: A zeroth-order block coordinate descent algorithm for huge-scale black-box optimization. In: Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 1193\u20131203 (2021). https:\/\/proceedings.mlr.press\/v139\/cai21d.html"},{"key":"616_CR13","unstructured":"Gasnikov, A., Novitskii, A., Novitskii, V., Abdukhakimov, F., Kamzolov, D., Beznosikov, A., Takac, M., Dvurechensky, P., Gu, B.: The power of first-order smooth optimization for black-box non-smooth problems. In: Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 162, pp. 7241\u20137265. PMLR, Virtual Conference (2022). https:\/\/proceedings.mlr.press\/v162\/gasnikov22a.html"},{"issue":"3","key":"616_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385\u2013482 (2003). https:\/\/doi.org\/10.1137\/S003614450242889","journal-title":"SIAM Rev."},{"issue":"3","key":"616_CR15","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25(3), 1515\u20131541 (2015). https:\/\/doi.org\/10.1137\/140961602","journal-title":"SIAM J. Optim."},{"key":"616_CR16","doi-asserted-by":"publisher","unstructured":"Roberts, L., Royer, C.W.: Direct search based on probabilistic descent in reduced spaces (2023). https:\/\/doi.org\/10.1137\/22M1488569","DOI":"10.1137\/22M1488569"},{"issue":"3","key":"616_CR17","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S1052623496312848","volume":"11","author":"EJ Anderson","year":"2001","unstructured":"Anderson, E.J., Ferris, M.C.: A direct search algorithm for optimization with noisy function evaluations. SIAM J. Optim. 11(3), 837\u2013857 (2001). https:\/\/doi.org\/10.1137\/S1052623496312848","journal-title":"SIAM J. Optim."},{"key":"616_CR18","doi-asserted-by":"publisher","unstructured":"Kim, S., Zhang, D.: Convergence properties of direct search methods for stochastic optimization, (2010). https:\/\/doi.org\/10.1109\/WSC.2010.5679089","DOI":"10.1109\/WSC.2010.5679089"},{"issue":"1","key":"616_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10589-021-00329-9","volume":"81","author":"KJ Dzahini","year":"2022","unstructured":"Dzahini, K.J.: Expected complexity analysis of stochastic direct-search. Comput. Optim. Appl. 81(1), 179\u2013200 (2022). https:\/\/doi.org\/10.1007\/s10589-021-00329-9","journal-title":"Comput. Optim. Appl."},{"key":"616_CR20","unstructured":"Dzahini, K.J., Wild, S.M.: Direct search for stochastic optimization in random subspaces with zeroth-, first-, and second-order convergence and expected complexity (2024). https:\/\/arxiv.org\/abs\/2403.13320"},{"issue":"1","key":"616_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-020-00249-0","volume":"79","author":"C Audet","year":"2021","unstructured":"Audet, C., Dzahini, K.J., Kokkolaras, M., Le Digabel, S.: Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates. Comput. Optim. Appl. 79(1), 1\u201334 (2021). https:\/\/doi.org\/10.1007\/s10589-020-00249-0","journal-title":"Comput. Optim. Appl."},{"key":"616_CR22","doi-asserted-by":"publisher","first-page":"927","DOI":"10.21914\/anziamj.v48i0.95","volume":"48","author":"CJ Price","year":"2006","unstructured":"Price, C.J., Reale, M., Robertson, B.: A direct search method for smooth and nonsmooth unconstrained optimization. ANZIAM J. 48, 927\u2013948 (2006)","journal-title":"ANZIAM J."},{"issue":"3","key":"616_CR23","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1093\/imanum\/drs027","volume":"33","author":"R Garmanjani","year":"2013","unstructured":"Garmanjani, R., Vicente, L.N.: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J. Numer. Anal. 33(3), 1008\u20131028 (2013). https:\/\/doi.org\/10.1093\/imanum\/drs027","journal-title":"IMA J. Numer. Anal."},{"key":"616_CR24","doi-asserted-by":"crossref","unstructured":"Popovic, D., Teel, A.R.: Direct search methods for nonsmooth optimization. In: 2004 43rd IEEE Conference on Decision and Control (CDC)(IEEE Cat. No. 04CH37601), vol. 3, pp. 3173\u20133178. IEEE (2004)","DOI":"10.1109\/CDC.2004.1428960"},{"issue":"4","key":"616_CR25","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013). https:\/\/doi.org\/10.1137\/120880811","journal-title":"SIAM J. Optim."},{"key":"616_CR26","unstructured":"Khaled, A., Richt\u00e1rik, P.: Better Theory for SGD in the Nonconvex World (2020)"},{"key":"616_CR27","doi-asserted-by":"publisher","unstructured":"Koz\u00e1k, D., Molinari, C., Rosasco, L., Tenorio, L., Villa, S.: Zeroth-order optimization with orthogonal random directions. Springer, 233 Spring Street, New York, NY 10013, USA (2023). https:\/\/doi.org\/10.1007\/s10107-022-01866-9","DOI":"10.1007\/s10107-022-01866-9"},{"key":"616_CR28","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10589-021-00271-w","volume":"79","author":"D Koz\u00e1k","year":"2021","unstructured":"Koz\u00e1k, D., Becker, S., Doostan, A., Tenorio, L.: A stochastic subspace approach to gradient-free optimization in high dimensions. Comput. Optim. Appl. 79, 339\u2013368 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"616_CR29","doi-asserted-by":"publisher","unstructured":"Wang, T., Feng, Y.: Convergence rates of zeroth order gradient descent for \u0141ojasiewicz functions. INFORMS Journal on Computing. https:\/\/doi.org\/10.1287\/ijoc.2023.0247","DOI":"10.1287\/ijoc.2023.0247"},{"issue":"2","key":"616_CR30","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10208-021-09513-z","volume":"22","author":"AS Berahas","year":"2022","unstructured":"Berahas, A.S., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. 22(2), 507\u2013560 (2022)","journal-title":"Found. Comput. Math."},{"key":"616_CR31","unstructured":"Rando, M., Molinari, C., Rosasco, L., Villa, S.: An optimal structured zeroth-order algorithm for non-smooth optimization. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems, vol. 36, pp. 36738\u201336767 (2023). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2023\/file\/7429f4c1b267cf619f28c4d4f1532f99-Paper-Conference.pdf"},{"issue":"1","key":"616_CR32","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-014-0847-0","volume":"155","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L.N.: Worst case complexity of direct search under convexity. Math. Program. 155(1), 307\u2013332 (2016). https:\/\/doi.org\/10.1007\/s10107-014-0847-0","journal-title":"Math. Program."},{"issue":"4","key":"616_CR33","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s11590-015-0908-1","volume":"10","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L., Zhang, Z.: On the optimal order of worst case complexity of direct search. Optim. Lett. 10(4), 699\u2013708 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0908-1","journal-title":"Optim. Lett."},{"issue":"2","key":"616_CR34","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22(2), 674\u2013701 (2012). https:\/\/doi.org\/10.1137\/110831659","journal-title":"SIAM J. Optim."},{"key":"616_CR35","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2009","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of \u0141ojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362, 3319\u20133363 (2009). https:\/\/doi.org\/10.1090\/S0002-9947-09-05048-X","journal-title":"Trans. Am. Math. Soc."},{"key":"616_CR36","unstructured":"Balasubramanian, K., Ghadimi, S.: Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates. Advances in Neural Information Processing Systems 31 (2018)"},{"key":"616_CR37","unstructured":"Kone\u010dn\u00fd, J., Richt\u00e1rik, P.: Simple Complexity Analysis of Simplified Direct Search (2014)"},{"issue":"4","key":"616_CR38","doi-asserted-by":"publisher","first-page":"2726","DOI":"10.1137\/19M1244378","volume":"30","author":"EH Bergou","year":"2020","unstructured":"Bergou, E.H., Gorbunov, E., Richt\u00e1rik, P.: Stochastic three points method for unconstrained smooth minimization. SIAM J. Optim. 30(4), 2726\u20132749 (2020). https:\/\/doi.org\/10.1137\/19M1244378","journal-title":"SIAM J. Optim."},{"key":"616_CR39","unstructured":"Hall, J.R., Carey, V.: Accelerating derivative-free optimization with dimension reduction and hyperparameter learning (2021). arXiv:2101.07444 [math.OC]"},{"key":"616_CR40","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.acha.2022.03.003","volume":"60","author":"H Cai","year":"2022","unstructured":"Cai, H., McKenzie, D., Yin, W., Zhang, Z.: A one-bit, comparison-based gradient estimator. Appl. Comput. Harmon. Anal. 60, 242\u2013266 (2022)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"616_CR41","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"JW Kiefer","year":"1952","unstructured":"Kiefer, J.W.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23(3), 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"616_CR42","doi-asserted-by":"crossref","unstructured":"Grapiglia, G.N.: Worst-case evaluation complexity of a derivative-free quadratic regularization method (2022)","DOI":"10.1007\/s11590-023-01984-z"},{"key":"616_CR43","unstructured":"Chikuse, Y.: Statistics on Special Manifolds. vol. 174 (2012)"},{"issue":"87\u201389","key":"616_CR44","first-page":"2","volume":"117","author":"S Lojasiewicz","year":"1963","unstructured":"Lojasiewicz, S.: A topological property of real analytic subsets. Coll. du CNRS, Les \u00e9quations aux d\u00e9riv\u00e9es partielles 117(87\u201389), 2 (1963)","journal-title":"Coll. du CNRS, Les \u00e9quations aux d\u00e9riv\u00e9es partielles"},{"key":"616_CR45","doi-asserted-by":"publisher","unstructured":"Powell, M.J.D.: In: Gomez, S., Hennart, J.-P. (eds.) A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation, pp. 51\u201367. Springer, Dordrecht (1994). https:\/\/doi.org\/10.1007\/978-94-015-8330-5_4","DOI":"10.1007\/978-94-015-8330-5_4"},{"issue":"3","key":"616_CR46","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s101070100290","volume":"92","author":"MJD Powell","year":"2002","unstructured":"Powell, M.J.D.: Uobyqa: unconstrained optimization by quadratic approximation. Math. Program. 92(3), 555\u2013582 (2002). https:\/\/doi.org\/10.1007\/s101070100290","journal-title":"Math. Program."},{"key":"616_CR47","doi-asserted-by":"publisher","unstructured":"Powell, M.J.D.: In: Di\u00a0Pillo, G., Roma, M. (eds.) The NEWUOA software for unconstrained optimization without derivatives, pp. 255\u2013297. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/0-387-30065-1_16","DOI":"10.1007\/0-387-30065-1_16"},{"key":"616_CR48","unstructured":"Powell, M.J., et al.: The bobyqa algorithm for bound constrained optimization without derivatives. Cambridge NA Report NA2009\/06, University of Cambridge, Cambridge 26, 26\u201346 (2009)"},{"issue":"1","key":"616_CR49","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-022-01836-1","volume":"199","author":"C Cartis","year":"2023","unstructured":"Cartis, C., Roberts, L.: Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. 199(1), 461\u2013524 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01836-1","journal-title":"Math. Program."},{"issue":"2","key":"616_CR50","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoo.2019.0016","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust-region method via supermartingales. INFORMS J. Optim. 1(2), 92\u2013119 (2019)","journal-title":"INFORMS J. Optim."},{"key":"616_CR51","unstructured":"Dzahini, K.J., Wild, S.M.: Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses (2022)"},{"key":"616_CR52","doi-asserted-by":"crossref","unstructured":"Ha, Y., Shashaani, S.: Iteration Complexity and Finite-Time Efficiency of Adaptive Sampling Trust-Region Methods for Stochastic Derivative-Free Optimization (2024)","DOI":"10.1080\/24725854.2024.2335513"},{"key":"616_CR53","unstructured":"Srinivas, N., Krause, A., Kakade, S.M., Seeger, M.: Gaussian process optimization in the bandit setting: No regret and experimental design. In: Proceedings of the 27th International Conference on International Conference on Machine Learning, pp. 1015\u20131022 (2010)"},{"key":"616_CR54","unstructured":"Rando, M., Carratino, L., Villa, S., Rosasco, L.: Ada-bkb: Scalable gaussian process optimization on continuous domains by adaptive discretization. In: Proceedings of The 25th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 151, pp. 7320\u20137348. PMLR, Virtual Conference (2022). https:\/\/proceedings.mlr.press\/v151\/rando22a.html"},{"key":"616_CR55","unstructured":"Frazier, P.I.: A tutorial on bayesian optimization (2018). arXiv:1807.02811 [stat.ML]"},{"issue":"2","key":"616_CR56","doi-asserted-by":"publisher","first-page":"3829","DOI":"10.1214\/18-EJS1497","volume":"12","author":"S Shekhar","year":"2018","unstructured":"Shekhar, S., Javidi, T.: Gaussian process bandits with adaptive discretization. Electron. J. Stat. 12(2), 3829\u20133874 (2018). https:\/\/doi.org\/10.1214\/18-EJS1497","journal-title":"Electron. J. Stat."},{"key":"616_CR57","unstructured":"Salgia, S., Vakili, S., Zhao, Q.: A domain-shrinking based bayesian optimization algorithm with order-optimal regret performance. In: NeurIPS (2021)"},{"key":"616_CR58","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-32494-1_4","volume":"192","author":"N Hansen","year":"2007","unstructured":"Hansen, N.: The CMA evolution strategy: a comparing review 192, 75\u2013102 (2007). https:\/\/doi.org\/10.1007\/3-540-32494-1_4","journal-title":"The CMA evolution strategy: a comparing review"},{"key":"616_CR59","first-page":"34","volume":"3","author":"DN Singh","year":"2012","unstructured":"Singh, D.N.: Review of particle swarm optimization. Int. J. Comput. Intell. Inf. Secur. 3, 34\u201344 (2012)","journal-title":"Int. J. Comput. Intell. Inf. Secur."},{"key":"616_CR60","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-93302-9_6","volume-title":"Active Particles, Volume 3: Advances in Theory, Models, and Applications","author":"C Totzeck","year":"2022","unstructured":"Totzeck, C.: Trends in consensus-based optimization. In: Bellomo, N., Carrillo, J.A., Tadmor, E. (eds.) Active Particles, Volume 3: Advances in Theory, Models, and Applications, pp. 201\u2013226. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-93302-9_6"},{"key":"616_CR61","unstructured":"Fornasier, M., Klock, T., Riedl, K.: Consensus-based optimization methods converge globally (2022)"},{"key":"616_CR62","unstructured":"Rudi, A., Carratino, L., Rosasco, L.: Falkon: An optimal large scale kernel method. In: Advances in Neural Information Processing Systems, vol. 30 (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/file\/05546b0e38ab9175cd905eebcc6ebb76-Paper.pdf"},{"issue":"1","key":"616_CR63","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1093\/mnras\/stw656","volume":"459","author":"RJ Lyon","year":"2016","unstructured":"Lyon, R.J., Stappers, B.W., Cooper, S., Brooke, J.M., Knowles, J.D.: Fifty years of pulsar candidate selection: from simple filters to a new principled real-time classification approach. Mon. Not. R. Astron. Soc. 459(1), 1104\u20131123 (2016). https:\/\/doi.org\/10.1093\/mnras\/stw656","journal-title":"Mon. Not. R. Astron. Soc."},{"key":"616_CR64","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"616_CR65","volume-title":"Introduction to optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to optimization. Optimization Software Inc., Publications Division, New York (1987). (1, 32)"},{"key":"616_CR66","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/B978-0-12-604550-5.50015-8","volume-title":"Optimizing Methods in Statistics","author":"H Robbins","year":"1971","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Rustagi, J.S. (ed.) Optimizing Methods in Statistics, pp. 233\u2013257. Academic Press, Cambridge (1971). https:\/\/doi.org\/10.1016\/B978-0-12-604550-5.50015-8"},{"issue":"3","key":"616_CR67","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1214\/aoms\/1177728716","volume":"25","author":"KL Chung","year":"1954","unstructured":"Chung, K.L.: On a stochastic approximation method. Ann. Math. Stat. 25(3), 463\u2013483 (1954). (Accessed 2022-05-06)","journal-title":"Ann. Math. Stat."},{"key":"616_CR68","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"7825","key":"616_CR69","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., Millman, K.J., Walt, S.J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N.J., Kern, R., Picus, M., Hoyer, S., Kerkwijk, M.H., Brett, M., Haldane, A., R\u00edo, J.F., Wiebe, M., Peterson, P., G\u00e9rard-Marchant, P., Sheppard, K., Reddy, T., Weckesser, W., Abbasi, H., Gohlke, C., Oliphant, T.E.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020). https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"key":"616_CR70","unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., Chintala, S.: PyTorch: An imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems 32, pp. 8024\u20138035. Curran Associates, Inc., Red Hook, NY, USA (2019). http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"616_CR71","first-page":"14410","volume-title":"Advances in Neural Information Processing Systems","author":"G Meanti","year":"2020","unstructured":"Meanti, G., Carratino, L., Rosasco, L., Rudi, A.: Kernel methods through the roof: Handling billions of points efficiently. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol. 33, pp. 14410\u201314422. Curran Associates Inc, Red Hook, NY, USA (2020)"},{"key":"616_CR72","unstructured":"Meanti, G., Carratino, L., De\u00a0Vito, E., Rosasco, L.: Efficient hyperparameter tuning for large scale kernel ridge regression. In: Proceedings of The 25th International Conference on Artificial Intelligence and Statistics (2022)"},{"key":"616_CR73","unstructured":"Liu, S., Kailkhura, B., Chen, P.-Y., Ting, P., Chang, S., Amini, L.: Zeroth-order stochastic variance reduction for nonconvex optimization. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 31 (2018). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2018\/file\/ba9a56ce0a9bfa26e8ed9e10b2cc8f46-Paper.pdf"},{"key":"616_CR74","unstructured":"Ji, K., Wang, Z., Zhou, Y., Liang, Y.: Improved zeroth-order variance reduced algorithms and analysis for nonconvex optimization. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 3100\u20133109 (2019). https:\/\/proceedings.mlr.press\/v97\/ji19a.html"},{"key":"616_CR75","first-page":"592","volume":"54","author":"F Mezzadri","year":"2006","unstructured":"Mezzadri, F.: How to generate random matrices from the classical compact groups. Not. Am. Math. Soc. 54, 592\u2013604 (2006)","journal-title":"Not. Am. Math. Soc."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00616-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00616-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00616-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T13:13:50Z","timestamp":1731676430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00616-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,18]]},"references-count":75,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00616-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,18]]},"assertion":[{"value":"21 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. Furthermore, the authors have no competing or Conflict of interest to declare that are relevant to the content of this article","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}