{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:53Z","timestamp":1750220993654,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Investissement d'avenir project","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]},{"name":"Ministry of Science and Higher Education of the Russian Federation","award":["08-08"],"award-info":[{"award-number":["08-08"]}]},{"name":"Paris Ile-de-France Region"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321827","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"855-863","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates"],"prefix":"10.1145","author":[{"given":"Anna","family":"Rodionova","sequence":"first","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Antonov","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arina","family":"Buzdalova","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996355"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics. World Scientific.   Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics. World Scientific.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'92)","author":"B\u00e4ck Thomas","year":"1992","unstructured":"Thomas B\u00e4ck . 1992 . The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm . In Proc. of Parallel Problem Solving from Nature (PPSN'92) . Elsevier, 87--96. Thomas B\u00e4ck. 1992. The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm. In Proc. of Parallel Problem Solving from Nature (PPSN'92). Elsevier, 87--96."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645513.657408"},{"key":"e_1_3_2_1_5_1","volume-title":"Per Kristian Lehre, and Dirk Sudholt","author":"Badkobeh Golnaz","year":"2014","unstructured":"Golnaz Badkobeh , Per Kristian Lehre, and Dirk Sudholt . 2014 . Unbiased Black-Box Complexity of Parallel Search. In Proc. of Parallel Problem Solving from Nature (PPSN'14) (Lecture Notes in Computer Science), Vol. 8672 . Springer , 892--901. Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. 2014. Unbiased Black-Box Complexity of Parallel Search. In Proc. of Parallel Problem Solving from Nature (PPSN'14) (Lecture Notes in Computer Science), Vol. 8672. Springer, 892--901."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science)","author":"Pinto Eduardo Carvalho","key":"e_1_3_2_1_7_1","unstructured":"Eduardo Carvalho Pinto and Carola Doerr . 2018. A Simple Proof for the Usefulness of Crossover in Black-Box Optimization . In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science) , Vol. 11102 . Springer , 29--41. Full version available at http:\/\/arxiv.org\/abs\/1812.00493. Eduardo Carvalho Pinto and Carola Doerr. 2018. A Simple Proof for the Usefulness of Crossover in Black-Box Optimization. In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science), Vol. 11102. Springer, 29--41. Full version available at http:\/\/arxiv.org\/abs\/1812.00493."},{"key":"e_1_3_2_1_8_1","first-page":"298","volume-title":"Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms. CoRR abs\/1812.00493","author":"Pinto Eduardo Carvalho","year":"2018","unstructured":"Eduardo Carvalho Pinto and Carola Doerr . 2018. Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms. CoRR abs\/1812.00493 ( 2018 ). arXiv:1812.00493 http:\/\/arxiv.org\/abs\/1812.00493 An extended abstract appeared in Proc. of Artificial Evolution (EA '17), pages 298 -- 305 . Eduardo Carvalho Pinto and Carola Doerr. 2018. Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms. CoRR abs\/1812.00493 (2018). arXiv:1812.00493 http:\/\/arxiv.org\/abs\/1812.00493 An extended abstract appeared in Proc. of Artificial Evolution (EA'17), pages 298--305."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"volume-title":"Theory of Randomized Search Heuristics in Discrete Search Spaces","author":"Doerr Benjamin","key":"e_1_3_2_1_10_1","unstructured":"Benjamin Doerr and Carola Doerr . 2018. Theory of Parameter Control Mechanisms for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices . In Theory of Randomized Search Heuristics in Discrete Search Spaces , Benjamin Doerr and Frank Neumann (Eds.). Springer . To appear. Available online at https:\/\/arxiv.org\/abs\/1804.05650. Benjamin Doerr and Carola Doerr. 2018. Theory of Parameter Control Mechanisms for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. In Theory of Randomized Search Heuristics in Discrete Search Spaces, Benjamin Doerr and Frank Neumann (Eds.). Springer. To appear. Available online at https:\/\/arxiv.org\/abs\/1804.05650."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321733"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908950"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0502-x"},{"key":"e_1_3_2_1_15_1","volume-title":"Complexity Theory for Discrete Black-Box Optimization Heuristics. CoRR abs\/1801.02037","author":"Doerr Carola","year":"2018","unstructured":"Carola Doerr . 2018. Complexity Theory for Discrete Black-Box Optimization Heuristics. CoRR abs\/1801.02037 ( 2018 ). arXiv:1801.02037 http:\/\/arxiv.org\/abs\/1801.02037 Carola Doerr. 2018. Complexity Theory for Discrete Black-Box Optimization Heuristics. CoRR abs\/1801.02037 (2018). arXiv:1801.02037 http:\/\/arxiv.org\/abs\/1801.02037"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205560"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205621"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"e_1_3_2_1_19_1","volume-title":"Marc Schoenauer, and Mich\u00e9le Sebag.","author":"Fialho \u00c1lvaro","year":"2008","unstructured":"\u00c1lvaro Fialho , Lu\u00eds Da Costa , Marc Schoenauer, and Mich\u00e9le Sebag. 2008 . Extreme Value Based Adaptive Operator Selection. In Proc. of Parallel Problem Solving from Nature (PPSN'08) (Lecture Notes in Computer Science), Vol. 5199 . Springer , 175--184. \u00c1lvaro Fialho, Lu\u00eds Da Costa, Marc Schoenauer, and Mich\u00e9le Sebag. 2008. Extreme Value Based Adaptive Operator Selection. In Proc. of Parallel Problem Solving from Nature (PPSN'08) (Lecture Notes in Computer Science), Vol. 5199. Springer, 175--184."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9213-y"},{"volume-title":"Analyzing Evolutionary Algorithms---The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_21_1","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms---The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms---The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.007"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023416.59689.4e"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967671"},{"volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science)","author":"Lengler Johannes","key":"e_1_3_2_1_27_1","unstructured":"Johannes Lengler . 2018. A General Dichotomy of Evolutionary Algorithms on Monotone Functions . In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science) , Vol. 11102 . Springer , 3--15. Johannes Lengler. 2018. A General Dichotomy of Evolutionary Algorithms on Monotone Functions. In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science), Vol. 11102. Springer, 3--15."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9125-3"},{"volume-title":"Friedrich Fromman Verlag (G\u00fcnther Holzboog KG)","author":"Rechenberg Ingo","key":"e_1_3_2_1_29_1","unstructured":"Ingo Rechenberg . 1973. Evolutionsstrategie. Friedrich Fromman Verlag (G\u00fcnther Holzboog KG) , Stuttgart . Ingo Rechenberg. 1973. Evolutionsstrategie. Friedrich Fromman Verlag (G\u00fcnther Holzboog KG), Stuttgart."},{"key":"e_1_3_2_1_30_1","volume-title":"Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates. arXiv e-prints:1904.08032","author":"Rodionova Anna","year":"2019","unstructured":"Anna Rodionova , Kirill Antonov , Arina Buzdalova , and Carola Doerr . 2019. Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates. arXiv e-prints:1904.08032 ( 2019 ). arXiv:1904.08032 https:\/\/arxiv.org\/abs\/1904.08032 Full version containing additional figures and tables. Anna Rodionova, Kirill Antonov, Arina Buzdalova, and Carola Doerr. 2019. Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates. arXiv e-prints:1904.08032 (2019). arXiv:1904.08032 https:\/\/arxiv.org\/abs\/1904.08032 Full version containing additional figures and tables."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570306"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208240"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Prague Czech Republic","acronym":"GECCO '19"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321827","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:29Z","timestamp":1750206329000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":32,"alternative-id":["10.1145\/3321707.3321827","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321827","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}