{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:21Z","timestamp":1778249721424,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"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":"Paris Ile-de-France Region","award":["Online Configuration of Heuristic Optimization Algorithms"],"award-info":[{"award-number":["Online Configuration of Heuristic Optimization Algorithms"]}]},{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321733","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"1479-1487","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Self-adjusting mutation rates with provably optimal success rules"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[{"name":"ETH, Z\u00fcrich, Switzerland"}],"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":"publisher","DOI":"10.1145\/1570256.1570342"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'10) (Lecture Notes in Computer Science)","author":"B\u00f6ttcher S\u00fcntje","unstructured":"S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem . In Proc. of Parallel Problem Solving from Nature (PPSN'10) (Lecture Notes in Computer Science) , Vol. 6238 . Springer , 1--10. S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. In Proc. of Parallel Problem Solving from Nature (PPSN'10) (Lecture Notes in Computer Science), Vol. 6238. Springer, 1--10."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of Artificial Evolution (EA'17)","author":"Pinto Eduardo Carvalho","year":"2017","unstructured":"Eduardo Carvalho Pinto and Carola Doerr . 2017 . Discussion of a More Practice-Aware Runtime Analysis for Evolutionary Algorithms . In Proc. of Artificial Evolution (EA'17) . 298--305. Extended version available online at https:\/\/arxiv.org\/abs\/ 1812.00493. Eduardo Carvalho Pinto and Carola Doerr. 2017. Discussion of a More Practice-Aware Runtime Analysis for Evolutionary Algorithms. In Proc. of Artificial Evolution (EA'17). 298--305. Extended version available online at https:\/\/arxiv.org\/abs\/1812.00493."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science)","author":"Pinto Eduardo Carvalho","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. 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."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389272"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of Evolutionary Computation in Combinatorial Optimization (EvoCOP'18) (Lecture Notes in Computer Science)","author":"Doerr Benjamin","unstructured":"Benjamin Doerr . 2018. Better Runtime Guarantees via Stochastic Domination . In Proc. of Evolutionary Computation in Combinatorial Optimization (EvoCOP'18) (Lecture Notes in Computer Science) , Vol. 10782 . Springer , 1--17. Full version available at http:\/\/arxiv.org\/abs\/1801.04487. Benjamin Doerr. 2018. Better Runtime Guarantees via Stochastic Domination. In Proc. of Evolutionary Computation in Combinatorial Optimization (EvoCOP'18) (Lecture Notes in Computer Science), Vol. 10782. Springer, 1--17. Full version available at http:\/\/arxiv.org\/abs\/1801.04487."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Theory of Randomized Search Heuristics in Discrete Search Spaces","author":"Doerr Benjamin","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","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'16) (Lecture Notes in Computer Science)","author":"Doerr Benjamin","unstructured":"Benjamin Doerr , Carola Doerr , and Jing Yang . 2016. k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation . In Proc. of Parallel Problem Solving from Nature (PPSN'16) (Lecture Notes in Computer Science) , Vol. 9921 . Springer , 824--834. Benjamin Doerr, Carola Doerr, and Jing Yang. 2016. k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation. In Proc. of Parallel Problem Solving from Nature (PPSN'16) (Lecture Notes in Computer Science), Vol. 9921. Springer, 824--834."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205611"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205569"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205560"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9213-y"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598360"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023416.59689.4e"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00114"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071288"},{"key":"e_1_3_2_1_25_1","volume-title":"Friedrich Fromman Verlag (G\u00fcnther Holzboog KG)","author":"Rechenberg Ingo","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_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1968.1098903"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330260"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science), Fernando Orejas, Paul G","author":"Wegener Ingo","unstructured":"Ingo Wegener . 2001. Theoretical Aspects of Evolutionary Algorithms . In Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science), Fernando Orejas, Paul G . Spirakis, and Jan van Leeuwen (Eds.), Vol. 2076 . Springer , 64--78. Ingo Wegener. 2001. Theoretical Aspects of Evolutionary Algorithms. In Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01) (Lecture Notes in Computer Science), Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen (Eds.), Vol. 2076. Springer, 64--78."}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321733","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:19Z","timestamp":1750204399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":27,"alternative-id":["10.1145\/3321707.3321733","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321733","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"}}]}}