{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:28:34Z","timestamp":1759177714289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700705"},{"type":"electronic","value":"9783031700712"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70071-2_5","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"70-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Optimization Through Genetic Drift"],"prefix":"10.1007","author":[{"given":"Cella","family":"Florescu","sequence":"first","affiliation":[]},{"given":"Marc","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[]},{"given":"Ulysse","family":"Schaller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Dang, D.C., Lehre, P.K., Nguyen, P.T.H.: Level-based analysis of the univariate marginal distribution algorithm. Algorithmica 81 (2019)","key":"5_CR1","DOI":"10.1007\/s00453-018-0507-5"},{"unstructured":"De\u00a0Bonet, J., Isbell, C., Viola, P.: Mimic: Finding optima by estimating probability densities. In: Advances in Neural Information Processing Systems, vol. 9 (1996)","key":"5_CR2"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on jump functions. Algorithmica 83, 3059\u20133107 (2021)","journal-title":"Algorithmica"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.4230\/DagRep.12.5.17","author":"B Doerr","year":"2022","unstructured":"Doerr, B., Krejca, M., Lehre, P.K.: Estimation-of-distribution algorithms: theory and applications. Panel discussion (2022). https:\/\/doi.org\/10.4230\/DagRep.12.5.17","journal-title":"Panel discussion"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Krejca, M.S.: Significance-based estimation-of-distribution algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1483\u20131490 (2018)","key":"5_CR5","DOI":"10.1145\/3205455.3205553"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2020.11.028","volume":"851","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Krejca, M.S.: A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. Theoret. Comput. Sci. 851, 121\u2013128 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/evco_a_00293","volume":"29","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Krejca, M.S.: The univariate marginal distribution algorithm copes well with deception and epistasis. Evol. Comput. 29(4), 543\u2013563 (2021)","journal-title":"Evol. Comput."},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1109\/TEVC.2020.2987361","volume":"24","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Zheng, W.: Sharp bounds for genetic drift in estimation of distribution algorithms. IEEE Trans. Evol. Comput. 24(6), 1140\u20131149 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-006-9001-0","volume":"5","author":"S Droste","year":"2006","unstructured":"Droste, S.: A rigorous analysis of the compact genetic algorithm for linear functions. Nat. Comput. 5, 257\u2013283 (2006). https:\/\/doi.org\/10.1007\/s11047-006-9001-0","journal-title":"Nat. Comput."},{"doi-asserted-by":"crossref","unstructured":"Florescu, C., Kaufmann, M., Lengler, J., Schaller, U.: Faster optimization through genetic drift. arXiv preprint arXiv:2404.12147 (2024)","key":"5_CR10","DOI":"10.1007\/978-3-031-70071-2_5"},{"issue":"3","key":"5_CR11","first-page":"477","volume":"21","author":"T Friedrich","year":"2016","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The compact genetic algorithm is efficient under extreme gaussian noise. IEEE Trans. Evol. Comput. 21(3), 477\u2013490 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-031-14721-0_41","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVII: 17th International Conference, PPSN 2022, Dortmund, Germany, September 10\u201314, 2022, Proceedings, Part II","author":"T Friedrich","year":"2022","unstructured":"Friedrich, T., K\u00f6tzing, T., Neumann, F., Radhakrishnan, A.: Theoretical study of\u00a0optimizing rugged landscapes with\u00a0the\u00a0cGA. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tu\u0161ar, T. (eds.) Parallel Problem Solving from Nature \u2013 PPSN XVII: 17th International Conference, PPSN 2022, Dortmund, Germany, September 10\u201314, 2022, Proceedings, Part II, pp. 586\u2013599. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14721-0_41"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.4230\/DagRep.7.5.22","volume":"7","author":"C Gie\u00dfen","year":"2017","unstructured":"Gie\u00dfen, C.: Theory of randomized optimization heuristics (Dagstuhl Seminar 17191). Dagstuhl Rep. 7(5), 22\u201355 (2017). https:\/\/doi.org\/10.4230\/DagRep.7.5.22","journal-title":"Dagstuhl Rep."},{"doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Sieberling, O.: Hardest monotone functions for evolutionary algorithms (2023)","key":"5_CR14","DOI":"10.1007\/978-3-031-57712-3_10"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-031-30035-6_11","volume-title":"Evolutionary Computation in Combinatorial Optimization: 23rd European Conference, EvoCOP 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, April 12\u201314, 2023, Proceedings","author":"M Kaufmann","year":"2023","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: OneMax is not the\u00a0easiest function for\u00a0fitness improvements. In: P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T. (eds.) Evolutionary Computation in Combinatorial Optimization: 23rd European Conference, EvoCOP 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, April 12\u201314, 2023, Proceedings, pp. 162\u2013178. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30035-6_11"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-29414-4_9","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"MS Krejca","year":"2020","unstructured":"Krejca, M.S., Witt, C.: Theory of estimation-of-distribution algorithms. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 405\u2013442. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_9"},{"doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Nguyen, P.T.H.: On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. In: Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, pp. 154\u2013168 (2019)","key":"5_CR17","DOI":"10.1145\/3299904.3340316"},{"doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Nguyen, P.T.H.: Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1497\u20131505 (2019)","key":"5_CR18","DOI":"10.1145\/3321707.3321834"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 89\u2013131. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11047-022-09915-0","volume":"23","author":"J Lengler","year":"2024","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. Nat. Comput. 23(1), 115\u2013129 (2024). https:\/\/doi.org\/10.1007\/s11047-022-09915-0","journal-title":"Nat. Comput."},{"key":"5_CR21","first-page":"84","volume":"12692","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Riedi, S.: Runtime analysis of the ($$\\mu $$+ 1)-EA on the dynamic BinVal function. Evol. Comput. Comb. Optim. 12692, 84\u201399 (2021)","journal-title":"Evol. Comput. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Lengler, J., Schaller, U.: The (1+ 1)-EA on noisy linear functions with random positive weights. In: 2018 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 712\u2013719. IEEE (2018)","key":"5_CR22","DOI":"10.1109\/SSCI.2018.8628785"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s00453-020-00778-4","volume":"83","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Sudholt, D., Witt, C.: The complex parameter landscape of the compact genetic algorithm. Algorithmica 83, 1096\u20131137 (2021)","journal-title":"Algorithmica"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-24855-2_3","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004: Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004. Proceedings, Part II","author":"M Pelikan","year":"2004","unstructured":"Pelikan, M., Lin, T.-K.: Parameter-less hierarchical BOA. In: Deb, K. (ed.) Genetic and Evolutionary Computation \u2013 GECCO 2004: Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004. Proceedings, Part II, pp. 24\u201335. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24855-2_3"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1007\/s00453-018-0480-z","volume":"81","author":"D Sudholt","year":"2019","unstructured":"Sudholt, D., Witt, C.: On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica 81, 1450\u20131489 (2019)","journal-title":"Algorithmica"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s00453-018-0463-0","volume":"81","author":"C Witt","year":"2019","unstructured":"Witt, C.: Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Algorithmica 81, 632\u2013667 (2019)","journal-title":"Algorithmica"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2022.08.014","volume":"940","author":"C Witt","year":"2023","unstructured":"Witt, C.: How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Theoret. Comput. Sci. 940, 18\u201342 (2023)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70071-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T21:39:33Z","timestamp":1732743573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70071-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700705","9783031700712"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70071-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}