{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T13:40:01Z","timestamp":1746452401681,"version":"3.40.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116822"},{"type":"electronic","value":"9783319116839"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11683-9_2","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:24:53Z","timestamp":1414178693000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Log-log Convergence for Noisy Optimization"],"prefix":"10.1007","author":[{"given":"S.","family":"Astete-Morales","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Morales, S.A., Liu, J., Teytaud, O.: Noisy optimization convergence rates. In: GECCO (Companion), pp. 223\u2013224 (2013)","DOI":"10.1145\/2464576.2464687"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"D Jones","year":"1998","unstructured":"Jones, D., Schonlau, M., Welch, W.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Global Optim."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11740698_26","volume-title":"Artificial Evolution","author":"A Auger","year":"2006","unstructured":"Auger, A., Jebalia, M., Teytaud, O.: Algorithms (X, sigma, eta): quasi-random mutations for evolution strategies. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 296\u2013307. Springer, Heidelberg (2006)"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00453-010-9403-3","volume":"59","author":"M Jebalia","year":"2010","unstructured":"Jebalia, M., Auger, A., Hansen, N.: Log linear convergence and divergence of the scale-invariant (1+1)-ES in noisy environments. Algorithmica 59(3), 425\u2013460 (2010)","journal-title":"Algorithmica"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TEVC.2005.859467","volume":"10","author":"DV Arnold","year":"2006","unstructured":"Arnold, D.V., Beyer, H.G.: A general noise model and its effects on evolution strategy performance. IEEE Trans. Evol. Comput. 10, 380\u2013391 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Finck, S., Beyer, H.G., Melkozerov, A.: Noisy optimization: a theoretical strategy comparison of ES, EGS, SPSA & IF on the noisy sphere. In: GECCO, pp. 813\u2013820 (2011)","DOI":"10.1145\/2001576.2001688"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-31866-5_13","volume-title":"Advances in Computer Games","author":"R Coulom","year":"2012","unstructured":"Coulom, R.: CLOP: confident local optimization for noisy Black-Box parameter tuning. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 146\u2013157. Springer, Heidelberg (2012)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Coulom, R., Rolet, P., Sokolovska, N., Teytaud, O.: Handling expensive optimization with large noise. In: Foundations of Genetic Algorithms (2011)","DOI":"10.1145\/1967654.1967660"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Teytaud, O., Decock, J.: Noisy optimization complexity. In: FOGA - Foundations of Genetic Algorithms XII - 2013, Adelaide, Australie (2013)","DOI":"10.1145\/2460239.2460256"},{"key":"2_CR10","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolution Strategies","author":"HG Beyer","year":"2001","unstructured":"Beyer, H.G.: The Theory of Evolution Strategies. Natural Computing Series. Springer, Heideberg (2001)"},{"key":"2_CR11","unstructured":"Yang, X., Birkfellner, W., Niederer, P.: Optimized 2d\/3d medical image registration using the estimation of multivariate normal algorithm (EMNA). In: Biomedical Engineering (2005)"},{"key":"2_CR12","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, 837\u2013857 (2001)","journal-title":"SIAM J. Optim."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1013735414984","volume":"21","author":"S Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M.: A derivative-free algorithm for bound constrained optimization. Comp. Opt. Appl. 21, 119\u2013142 (2002)","journal-title":"Comp. Opt. Appl."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Kim, S., Zhang, D.: Convergence properties of direct search methods for stochastic optimization. In: Proceedings of the Winter Simulation Conference, WSC \u201910, pp. 1003\u20131011 (2010)","DOI":"10.1109\/WSC.2010.5679089"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2008.924423","volume":"13","author":"N Hansen","year":"2009","unstructured":"Hansen, N., Niederberger, S., Guzzella, L., Koumoutsakos, P.: A method for handling uncertainty in evolutionary optimization with an application to feedback control of combustion. IEEE Trans. Evol. Comput. 13, 180\u2013197 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-008-9354-2","volume":"44","author":"J Villemonteix","year":"2008","unstructured":"Villemonteix, J., Vazquez, E., Walter, E.: An informational approach to the global optimization of expensive-to-evaluate functions. J. Global Optim. 44, 509\u2013534 (2008)","journal-title":"J. Global Optim."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1214\/aoms\/1177699070","volume":"38","author":"V Fabian","year":"1967","unstructured":"Fabian, V.: Stochastic approximation of minima with improved asymptotic speed. Ann. Math. Stat. 38, 191\u2013200 (1967)","journal-title":"Ann. Math. Stat."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Rolet, P., Teytaud, O.: Bandit-based estimation of distribution algorithms for noisy optimization: rigorous runtime analysis. In: Proceedings of Lion4 (accepted); presented in TRSH 2009 in Birmingham, pp. 97\u2013110 (2009)","DOI":"10.1007\/978-3-642-13800-3_8"},{"key":"2_CR19","unstructured":"Auger, A.: Convergence results for (1,$$\\lambda $$)-SA-ES using the theory of $$\\varphi $$-irreducible Markov chains"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00453-010-9391-3","volume":"59","author":"H Fournier","year":"2010","unstructured":"Fournier, H., Teytaud, O.: Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns. Algorithmica 59, 387\u2013408 (2010)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11683-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T13:12:31Z","timestamp":1746450751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11683-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116822","9783319116839"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11683-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}