{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:01:48Z","timestamp":1783749708404,"version":"3.55.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","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\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Paris Ile-de-France Region","award":["Online Configuration of Heuristic Optimization Algorithms"],"award-info":[{"award-number":["Online Configuration of Heuristic Optimization Algorithms"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00453-021-00854-3","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T05:02:52Z","timestamp":1626757372000},"page":"3108-3147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Self-Adjusting Mutation Rates with Provably Optimal Success Rules"],"prefix":"10.1007","volume":"83","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-3227","authenticated-orcid":false,"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"854_CR1","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/2996355","volume":"49","author":"A Aleti","year":"2016","unstructured":"Aleti, A., Moser, I.: A systematic literature review of adaptive parameter control methods for evolutionary algorithms. ACM Comput. Surv. 49, 561\u20135635 (2016)","journal-title":"ACM Comput. Surv."},{"key":"854_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A.: Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed. In: Companion Material for Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201909), pp. 2447\u20132452. ACM (2009)","DOI":"10.1145\/1570256.1570342"},{"key":"854_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Proc. of Parallel Problem Solving from Nature (PPSN\u201910), Lecture Notes in Computer Science, vol. 6238, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"854_CR4","doi-asserted-by":"publisher","unstructured":"Buzdalov, M., Doerr, B., Doerr, C., Vinokurov, D.: Fixed-target runtime analysis. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201920), pp. 1295\u20131303. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3390184","DOI":"10.1145\/3377930.3390184"},{"key":"854_CR5","unstructured":"Carvalho Pinto, E., Doerr, C.: Discussion of a more practice-aware runtime analysis for evolutionary algorithms. In: Proc. of Artificial Evolution (EA\u201917), pp. 298\u2013305 (2017). https:\/\/ea2017.inria.fr\/\/EA2017_Proceedings_web_ISBN_978-2-9539267-7-4.pdf. Extended version available online at arxiv: abs\/1812.00493"},{"key":"854_CR6","doi-asserted-by":"publisher","unstructured":"Carvalho Pinto, E., Doerr, C.: A simple proof for the usefulness of crossover in black-box optimization. In: Proc. of Parallel Problem Solving from Nature (PPSN\u201918), Lecture Notes in Computer Science, vol. 11102, pp. 29\u201341. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_3","DOI":"10.1007\/978-3-319-99259-4_3"},{"key":"854_CR7","doi-asserted-by":"crossref","unstructured":"Costa, L.D., Fialho, \u00c1., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201908), pp. 913\u2013920. ACM (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"854_CR8","unstructured":"Devroye, L.: The compound random search. Ph.D. dissertation, Purdue Univ., West Lafayette, IN (1972)"},{"key":"854_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theor. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"854_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: B.\u00a0Doerr, F.\u00a0Neumann (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 1\u201387. Springer (2020). Also available at arxiv: abs\/1801.06733","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"854_CR11","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm. Algorithmica 80, 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"854_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: Provable performance gains through dynamic parameter choices. In: Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 271\u2013321. Springer (2020). Also available at arxiv: 1804.05650","DOI":"10.1007\/978-3-030-29414-4_6"},{"key":"854_CR13","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C., Lengler, J.: Self-adjusting mutation rates with provably optimal success rules. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201919), pp. 1479\u20131487. ACM (2019). https:\/\/doi.org\/10.1145\/3321707.3321733","DOI":"10.1145\/3321707.3321733"},{"key":"854_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: $$k$$-bit mutation with self-adjusting $$k$$ outperforms standard bit mutation. In: Proc. of Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 824\u2013834. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"854_CR15","doi-asserted-by":"publisher","unstructured":"Doerr, B., Jansen, T., Witt, C., Zarges, C.: A method to derive fixed budget results from expected optimisation times. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201913), pp. 1581\u20131588. ACM (2013). https:\/\/doi.org\/10.1145\/2463372.2463565","DOI":"10.1145\/2463372.2463565"},{"key":"854_CR16","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"854_CR17","doi-asserted-by":"publisher","unstructured":"Doerr, B., K\u00f6tzing, T.: Lower bounds from fitness levels made easy. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201921), pp. 1142\u20131150. ACM (2021). https:\/\/doi.org\/10.1145\/3449639.3459352","DOI":"10.1145\/3449639.3459352"},{"key":"854_CR18","doi-asserted-by":"crossref","unstructured":"Doerr, B., Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of selection hyper-heuristics with adaptive learning periods. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201918), pp. 1015\u20131022. ACM (2018)","DOI":"10.1145\/3205455.3205611"},{"key":"854_CR19","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s00453-020-00726-2","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. Algorithmica 83, 1012\u20131053 (2021)","journal-title":"Algorithmica"},{"key":"854_CR20","doi-asserted-by":"publisher","unstructured":"Doerr, C., Wagner, M.: On the effectiveness of simple success-based parameter selection mechanisms for two classical discrete black-box optimization benchmark problems. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201918), pp. 943\u2013950. ACM (2018). https:\/\/doi.org\/10.1145\/3205455.3205560","DOI":"10.1145\/3205455.3205560"},{"key":"854_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"\u00c1E Eiben","year":"1999","unstructured":"Eiben, \u00c1.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evolut. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"854_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10472-010-9213-y","volume":"60","author":"\u00c1 Fialho","year":"2010","unstructured":"Fialho, \u00c1., Costa, L.D., Schoenauer, M., Sebag, M.: Analyzing bandit-based adaptive operator selection mechanisms. Ann. Math. Artif. Intell. 60, 25\u201364 (2010). https:\/\/doi.org\/10.1007\/s10472-010-9213-y","journal-title":"Ann. Math. Artif. Intell."},{"key":"854_CR23","doi-asserted-by":"crossref","unstructured":"Hansen, N., Gawelczyk, A., Ostermeier, A.: Sizing the population with respect to the local progress in (1,$$\\lambda $$)-evolution strategies - a theoretical analysis. In: Proc. of Congress on Evolutionary Computation (CEC\u201995), pp. 80\u201385. IEEE (1995)","DOI":"10.1109\/ICEC.1995.489123"},{"key":"854_CR24","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolut. Comput. 13, 413\u2013440 (2005)","journal-title":"Evolut. Comput."},{"key":"854_CR25","doi-asserted-by":"publisher","unstructured":"Karafotias, G., Eiben, \u00c1.E., Hoogendoorn, M.: Generic parameter control with reinforcement learning. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201914), pp. 1319\u20131326. ACM (2014). https:\/\/doi.org\/10.1145\/2576768.2598360","DOI":"10.1145\/2576768.2598360"},{"key":"854_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, \u00c1.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evolut. Comput. 19, 167\u2013187 (2015)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"854_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"Kern, S., M\u00fcller, S.D., Hansen, N., B\u00fcche, D., Ocenasek, J., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms - a comparative review. Natural Comput. 3, 77\u2013112 (2004)","journal-title":"Natural Comput."},{"key":"854_CR28","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proc. of Foundations of Genetic Algorithms (FOGA\u201911), pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"854_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"854_CR30","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of generalised selection hyper-heuristics for pseudo-Boolean optimisation. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201917), pp. 849\u2013856. ACM (2017)","DOI":"10.1145\/3071178.3071288"},{"issue":"3","key":"854_CR31","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1162\/evco_a_00258","volume":"28","author":"A Lissovoi","year":"2020","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: Simple hyper-heuristics control the neighbourhood size of randomised local search optimally for LeadingOnes. Evolut. Comput. 28(3), 437\u2013461 (2020). https:\/\/doi.org\/10.1162\/evco_a_00258","journal-title":"Evolut. Comput."},{"key":"854_CR32","volume-title":"Evolutionsstrategie","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionsstrategie. Friedrich Fromman Verlag (G\u00fcnther Holzboog KG), Stuttgart (1973)"},{"key":"854_CR33","doi-asserted-by":"publisher","unstructured":"Rodionova, A., Antonov, K., Buzdalova, A., Doerr, C.: Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO\u201919), pp. 855\u2013863. ACM (2019). https:\/\/doi.org\/10.1145\/3321707.3321827","DOI":"10.1145\/3321707.3321827"},{"key":"854_CR34","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"MA Schumer","year":"1968","unstructured":"Schumer, M.A., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13, 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"key":"854_CR35","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evolut. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"854_CR36","unstructured":"Trench, W.F.: Introduction to real analysis. Open Textbook Initiative, American Institute of Mathematics (2013)"},{"key":"854_CR37","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: F.\u00a0Orejas, P.G. Spirakis, J.\u00a0van Leeuwen (eds.) Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP\u201901), Lecture Notes in Computer Science, vol. 2076, pp. 64\u201378. Springer (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00854-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00854-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00854-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:11:40Z","timestamp":1725462700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00854-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,20]]},"references-count":37,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["854"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00854-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,20]]},"assertion":[{"value":"10 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}