{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:44:59Z","timestamp":1725558299153},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137990"},{"type":"electronic","value":"9783642138003"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13800-3_8","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T02:35:53Z","timestamp":1276828553000},"page":"97-110","source":"Crossref","is-referenced-by-count":8,"title":["Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Rolet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-45356-3_4","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"D.V. Arnold","year":"2000","unstructured":"Arnold, D.V., Beyer, H.-G.: Efficiency and mutation strength adaptation of the (mu\/mui,lambda)-es in a noisy environment. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol.\u00a01917, pp. 39\u201348. Springer, Heidelberg (2000)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Arnold, D.V., Georg Beyer, H.: Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge. Technical report (2006)","DOI":"10.1007\/s11047-006-9025-5"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78761-7_60","volume-title":"Applications of Evolutionary Computing","author":"D.V. Arnold","year":"2008","unstructured":"Arnold, D.V., Van Wart, D.C.S.: Cumulative step length adaptation for evolution strategies using negative recombination weights. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Drechsler, R., Ek\u00e1rt, A., Esparcia-Alc\u00e1zar, A.I., Farooq, M., Fink, A., McCormack, J., O\u2019Neill, M., Romero, J., Rothlauf, F., Squillero, G., Uyar, A.\u015e., Yang, S. (eds.) EvoWorkshops 2008. LNCS, vol.\u00a04974, pp. 545\u2013554. Springer, Heidelberg (2008)"},{"issue":"2\/3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2\/3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2004.11.017","volume":"334","author":"A. Auger","year":"2005","unstructured":"Auger, A.: Convergence results for (1,\u03bb)-SA-ES using the theory of \u03d5-irreducible markov chains. Theoretical Computer Science\u00a0334, 35\u201369 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR6","first-page":"38","volume":"3","author":"S. Bernstein","year":"1924","unstructured":"Bernstein, S.: On a modification of chebyshev\u2019s inequality and of the error formula of laplace. Original publication: Ann. Sci. Inst. Sav. Ukraine, Sect. Math. 1,\u00a03(1), 38\u201349 (1924)","journal-title":"Original publication: Ann. Sci. Inst. Sav. Ukraine, Sect. Math. 1"},{"key":"8_CR7","volume-title":"The Theory of Probabilities","author":"S. Bernstein","year":"1946","unstructured":"Bernstein, S.: The Theory of Probabilities. Gastehizdat Publishing House, Moscow (1946)"},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolutions Strategies","author":"H.-G. Beyer","year":"2001","unstructured":"Beyer, H.-G.: The Theory of Evolutions Strategies. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(03)00284-6","volume":"306","author":"A. Bienvenue","year":"2003","unstructured":"Bienvenue, A., Francois, O.: Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. Theor. Comput. Sci.\u00a0306(1-3), 269\u2013289 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat.\u00a023, 493\u2013509 (1952)","journal-title":"Annals of Math. Stat."},{"key":"8_CR11","volume-title":"A probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1997","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A probabilistic Theory of Pattern Recognition. Springer, Heidelberg (1997)"},{"key":"8_CR12","first-page":"101","volume":"3","author":"J.M. Fitzpatrick","year":"1988","unstructured":"Fitzpatrick, J.M., Grefenstette, J.J.: Genetic algorithms in noisy environments. Machine Learning\u00a03, 101\u2013120 (1988)","journal-title":"Machine Learning"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/evco.2007.15.4.411","volume":"15","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Ruette, S., Teytaud, O.: Comparison-based algorithms are robust and randomized algorithms are anytime. Evolutionary Computation\u00a015(4), 411\u2013434 (2007)","journal-title":"Evolutionary Computation"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-58484-6_260","volume-title":"Parallel Problem Solving from Nature - PPSN III","author":"U. Hammel","year":"1994","unstructured":"Hammel, U., B\u00e4ck, T.: Evolution strategies on noisy functions: How to improve convergence properties. In: Davidor, Y., M\u00e4nner, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol.\u00a0866, pp. 159\u2013168. Springer, Heidelberg (1994)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation\u00a011(1) (2003)","DOI":"10.1162\/106365603321828970"},{"key":"8_CR16","first-page":"401","volume-title":"ICML 2009: Proceedings of the 26th Annual International Conference on Machine Learning","author":"V. Heidrich-Meisner","year":"2009","unstructured":"Heidrich-Meisner, V., Igel, C.: Hoeffding and bernstein races for selecting policies in evolutionary direct policy search. In: ICML 2009: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 401\u2013408. ACM, New York (2009)"},{"key":"8_CR17","first-page":"401","volume-title":"ICML 2009: Proceedings of the 26th Annual International Conference on Machine Learning","author":"V. Heidrich-Meisner","year":"2009","unstructured":"Heidrich-Meisner, V., Igel, C.: Hoeffding and bernstein races for selecting policies in evolutionary direct policy search. In: ICML 2009: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 401\u2013408. ACM, New York (2009)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058, 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Jebalia, M., Auger, A.: On multiplicative noise models for stochastic search. In: Parallel Problem Solving From Nature, Dortmund, Germany (2008)","DOI":"10.1007\/978-3-540-87700-4_6"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Jebalia, M., Auger, A.: On multiplicative noise models for stochastic search. In: Parallel Problem Solving From Nature, Dortmund, Germany (2008)","DOI":"10.1007\/978-3-540-87700-4_6"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T. Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in applied mathematics\u00a06, 4\u201322 (1985)","journal-title":"Advances in applied mathematics"},{"key":"8_CR22","first-page":"59","volume-title":"Advances in neural information processing systems","author":"O. Maron","year":"1994","unstructured":"Maron, O., Moore, A.W.: Hoeffding races: Accelerating model selection search for classification and function approximation. In: Advances in neural information processing systems, vol.\u00a06, pp. 59\u201366. Morgan Kaufmann, San Francisco (1994)"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1006556606079","volume":"11","author":"O. Maron","year":"1997","unstructured":"Maron, O., Moore, A.W.: The racing algorithm: Model selection for lazy learners. Artificial Intelligence Review\u00a011, 193\u2013225 (1997)","journal-title":"Artificial Intelligence Review"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/1390156.1390241","volume-title":"ICML 2008: Proceedings of the 25th International Conference on Machine Learning","author":"V. Mnih","year":"2008","unstructured":"Mnih, V., Szepesv\u00e1ri, C., Audibert, J.-Y.: Empirical Bernstein stopping. In: ICML 2008: Proceedings of the 25th International Conference on Machine Learning, pp. 672\u2013679. ACM, New York (2008)"},{"key":"8_CR25","volume-title":"Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart (1973)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Rolet, P., Teytaud, O.: Bandit-based estimation of distribution algorithms for noisy optimization: Rigorous runtime analysis (extended version of lion4\u2019s paper) (2010), \n                    \n                      http:\/\/www.lri.fr\/~teytaud\/lion4long.pdf","DOI":"10.1007\/978-3-642-13800-3_8"},{"key":"8_CR27","unstructured":"Schwefel, H.-P.: Numerical Optimization of Computer Models. John Wiley & Sons, New-York (1981); 2nd edn. (1995)"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Teytaud, O., Auger, A.: On the adaptation of the noise level for stochastic optimization. In: IEEE Congress on Evolutionary Computation, Singapour (2007)","DOI":"10.1109\/CEC.2007.4424857"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13800-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:01:09Z","timestamp":1558278069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13800-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137990","9783642138003"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13800-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}