{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:40Z","timestamp":1750306960048,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,6]],"date-time":"2013-07-06T00:00:00Z","timestamp":1373068800000},"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":[[2013,7,6]]},"DOI":"10.1145\/2464576.2464687","type":"proceedings-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T13:26:51Z","timestamp":1374672411000},"page":"223-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Noisy optimization convergence rates"],"prefix":"10.1145","author":[{"given":"Sandra","family":"Astete Morales","sequence":"first","affiliation":[{"name":"TAO, University of Paris-Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Liu","sequence":"additional","affiliation":[{"name":"TAO, University of Paris-Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[{"name":"TAO, University of Paris-Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.11.017"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04378-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31866-5_13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9391-3"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of Lion4 (accepted); presented in TRSH 2009 in Birmingham","author":"Rolet P.","year":"2009","unstructured":"P. Rolet and O. Teytaud . Bandit-based estimation of distribution algorithms for noisy optimization: Rigorous runtime analysis . In Proceedings of Lion4 (accepted); presented in TRSH 2009 in Birmingham , 2009 . P. Rolet and O. Teytaud. Bandit-based estimation of distribution algorithms for noisy optimization: Rigorous runtime analysis. In Proceedings of Lion4 (accepted); presented in TRSH 2009 in Birmingham, 2009."}],"event":{"name":"GECCO '13: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Amsterdam The Netherlands","acronym":"GECCO '13"},"container-title":["Proceedings of the 15th annual conference companion on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464576.2464687","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2464576.2464687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:12Z","timestamp":1750235952000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2464576.2464687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,6]]},"references-count":5,"alternative-id":["10.1145\/2464576.2464687","10.1145\/2464576"],"URL":"https:\/\/doi.org\/10.1145\/2464576.2464687","relation":{},"subject":[],"published":{"date-parts":[[2013,7,6]]},"assertion":[{"value":"2013-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}