{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:49Z","timestamp":1750307509314,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,8]]},"DOI":"10.1145\/1569901.1570255","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"1951-1956","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal robust expensive optimization is tractable"],"prefix":"10.1145","author":[{"given":"Philippe","family":"Rolet","sequence":"first","affiliation":[{"name":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France"}]},{"given":"Mich\u00e8le","family":"Sebag","sequence":"additional","affiliation":[{"name":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[{"name":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"]]A. Auger and O. Teytaud. Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica Accepted.   ]]A. Auger and O. Teytaud. Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica Accepted."},{"key":"e_1_3_2_1_2_1","volume-title":"PPSN--BTP workshop","author":"Gelly S.","year":"2006","unstructured":"]] S. Gelly , S. Ruette , and O. Teytaud . Comparison-based algorithms: worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in eda, and implementations with billiards . In PPSN--BTP workshop , 2006 . ]]S. Gelly, S. Ruette, and O. Teytaud. Comparison-based algorithms: worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in eda, and implementations with billiards. In PPSN--BTP workshop, 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753683717"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_106"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"]]\n      O.\n      Teytaud\n     and \n      H.\n      Fournier\n  . \n  Lower bounds for evolution strategies using VC-dimension\n  . In G. Rudolph T. Jansen S. M. Lucas C. Poloni and N. Beume editors PPSN volume \n  5199\n   of \n  Lecture Notes in Computer Science pages \n  102\n  --\n  111\n  . \n  Springer 2008\n  .  ]]O. Teytaud and H. Fournier. Lower bounds for evolution strategies using VC-dimension. In G. Rudolph T. Jansen S. M. Lucas C. Poloni and N. Beume editors PPSN volume 5199 of Lecture Notes in Computer Science pages 102--111. Springer 2008.","DOI":"10.1007\/978-3-540-87700-4_11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_3"},{"key":"e_1_3_2_1_9_1","volume-title":"Global optimization based on noisy evaluations: an empirical study of two statistical approaches. Journal of Global Optimization, page 17 pages","author":"Vazquez E.","year":"2008","unstructured":"]] E. Vazquez , J. Villemonteix , M. Sidorkiewicz , and E. Walter . Global optimization based on noisy evaluations: an empirical study of two statistical approaches. Journal of Global Optimization, page 17 pages , 2008 . ]]E. Vazquez, J. Villemonteix, M. Sidorkiewicz, and E. Walter. Global optimization based on noisy evaluations: an empirical study of two statistical approaches. Journal of Global Optimization, page 17 pages, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9354-2"},{"key":"e_1_3_2_1_11_1","first-page":"1586","volume-title":"In Evolutionary Computation, 2004. CEC2004. Congress on","author":"Zhou Z.","year":"2004","unstructured":"]] Z. Zhou . Hierarchical surrogate-assisted evolutionary optimization framework . In In Evolutionary Computation, 2004. CEC2004. Congress on , pages 1586 -- 1593 , 2004 . ]]Z. Zhou. Hierarchical surrogate-assisted evolutionary optimization framework. In In Evolutionary Computation, 2004. CEC2004. Congress on, pages 1586--1593, 2004."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1570255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:59Z","timestamp":1750249079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1570255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":11,"alternative-id":["10.1145\/1569901.1570255","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1570255","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}