{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:04Z","timestamp":1760203024938,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["20-51-15009"],"award-info":[{"award-number":["20-51-15009"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["20-51-15009"],"award-info":[{"award-number":["20-51-15009"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459377","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:51:58Z","timestamp":1624297918000},"page":"1115-1123","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Lazy parameter tuning and control"],"prefix":"10.1145","author":[{"given":"Denis","family":"Antipov","sequence":"first","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"Institute Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390172"},{"key":"e_1_3_2_1_2_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov , Maxim Buzdalov , and Benjamin Doerr . 2020 . First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature , PPSN 2020, Part II. Springer, 560--573. Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. 2020. First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 560--573."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459377"},{"key":"e_1_3_2_1_4_1","volume-title":"PPSN","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov and Benjamin Doerr . 2020 . Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature , PPSN 2020, Part II. Springer, 545--559. Denis Antipov and Benjamin Doerr. 2020. Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature, PPSN 2020, Part II. Springer, 545--559."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340317"},{"key":"e_1_3_2_1_6_1","volume-title":"The (1 + (\u03bb, \u03bb)) GA Is Even Faster on Multimodal Problems. CoRR abs\/2004.06702","author":"Antipov Denis","year":"2020","unstructured":"Denis Antipov , Benjamin Doerr , and Vitalii Karavaev . 2020. The (1 + (\u03bb, \u03bb)) GA Is Even Faster on Multimodal Problems. CoRR abs\/2004.06702 ( 2020 ). arXiv:2004.06702 Denis Antipov, Benjamin Doerr, and Vitalii Karavaev. 2020. The (1 + (\u03bb, \u03bb)) GA Is Even Faster on Multimodal Problems. CoRR abs\/2004.06702 (2020). arXiv:2004.06702"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390148"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459350"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3079194"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.03.001"},{"key":"e_1_3_2_1_12_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Dang Duc-Cuong","year":"2016","unstructured":"Duc-Cuong Dang , Tobias Friedrich , Timo K\u00f6tzing , Martin S. Krejca , Per Kristian Lehre , Pietro S. Oliveto , Dirk Sudholt , and Andrew M. Sutton . 2016. Escaping local optima with diversity mechanisms and crossover . In Genetic and Evolutionary Computation Conference, GECCO 2016 . ACM, 645--652. Duc-Cuong Dang, Tobias Friedrich, Timo K\u00f6tzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, and Andrew M. Sutton. 2016. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016. ACM, 645--652."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908885"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321747"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389823"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0341-1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0477-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_23_1","volume-title":"Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations. CoRR abs\/1805.10902","author":"Friedrich Tobias","year":"2018","unstructured":"Tobias Friedrich , Andreas G\u00f6bel , Francesco Quinzan , and Markus Wagner . 2018. Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations. CoRR abs\/1805.10902 ( 2018 ). Tobias Friedrich, Andreas G\u00f6bel, Francesco Quinzan, and Markus Wagner. 2018. Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations. CoRR abs\/1805.10902 (2018)."},{"key":"e_1_3_2_1_24_1","volume-title":"PPSN","author":"Friedrich Tobias","year":"2018","unstructured":"Tobias Friedrich , Andreas G\u00f6bel , Francesco Quinzan , and Markus Wagner . 2018 . Heavy-tailed mutation operators in single-objective combinatorial optimization. In Parallel Problem Solving from Nature , PPSN 2018, Part I. Springer, 134--145. Tobias Friedrich, Andreas G\u00f6bel, Francesco Quinzan, and Markus Wagner. 2018. Heavy-tailed mutation operators in single-objective combinatorial optimization. In Parallel Problem Solving from Nature, PPSN 2018, Part I. Springer, 134--145."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908884"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205515"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205608"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389833"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459336"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72904-2_10"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340305"},{"volume-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph G\u00fcnter","key":"e_1_3_2_1_35_1","unstructured":"G\u00fcnter Rudolph . 1997. Convergence Properties of Evolutionary Algorithms . Verlag Dr . Kov\u01cec. G\u00fcnter Rudolph. 1997. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kov\u01cec."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731092"},{"key":"e_1_3_2_1_37_1","volume-title":"PPSN","author":"Whitley Darrell","year":"2018","unstructured":"Darrell Whitley , Swetha Varadarajan , Rachel Hirsch , and Anirban Mukhopadhyay . 2018 . Exploration and exploitation without mutation: solving the jump function in Θ(n) time. In Parallel Problem Solving from Nature , PPSN 2018, Part II. Springer, 55--66. Darrell Whitley, Swetha Varadarajan, Rachel Hirsch, and Anirban Mukhopadhyay. 2018. Exploration and exploitation without mutation: solving the jump function in Θ(n) time. In Parallel Problem Solving from Nature, PPSN 2018, Part II. Springer, 55--66."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"},{"key":"e_1_3_2_1_39_1","volume-title":"ICIC","author":"Wu Mengxi","year":"2018","unstructured":"Mengxi Wu , Chao Qian , and Ke Tang . 2018 . Dynamic mutation based Pareto optimization for subset selection. In Intelligent Computing Methodologies , ICIC 2018, Part III. Springer, 25--35. Mengxi Wu, Chao Qian, and Ke Tang. 2018. Dynamic mutation based Pareto optimization for subset selection. In Intelligent Computing Methodologies, ICIC 2018, Part III. Springer, 25--35."}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459377"}},"subtitle":["choosing all parameters randomly from a power-law distribution"],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":39,"alternative-id":["10.1145\/3449639.3459377","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459377","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}