{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:16:11Z","timestamp":1772770571988,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:00:00Z","timestamp":1660521600000},"content-version":"vor","delay-in-days":226,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A first order progress rate is derived for the intermediate multi-recombinative Evolution Strategy <jats:inline-formula><jats:alternatives><jats:tex-math>$$(\\mu \/\\mu _I, \\lambda )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>\u03bc<\/mml:mi>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>\u03bc<\/mml:mi>\n                      <mml:mi>I<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03bb<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-ES on the highly multimodal Rastrigin test function. The progress is derived within a linearized model applying the method of so-called noisy order statistics. To this end, the mutation-induced variance of the Rastrigin function is determined. The obtained progress approximation is compared to simulations and yields strengths and limitations depending on mutation strength and distance to the optimizer. Furthermore, the progress is iterated using the dynamical systems approach and compared to averaged optimization runs. The property of global convergence within given approximation is discussed. As an outlook, the need of an improved first order progress rate as well as the extension to higher order progress including positional fluctuations is explained.<\/jats:p>","DOI":"10.1007\/978-3-031-14721-0_35","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"499-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Progress Rate Analysis of\u00a0Evolution Strategies on\u00a0the\u00a0Rastrigin Function: First Results"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1979-8916","authenticated-orcid":false,"given":"Amir","family":"Omeradzic","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7455-8686","authenticated-orcid":false,"given":"Hans-Georg","family":"Beyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1105-2","volume-title":"Noisy Optimization with Evolution Strategies","author":"D Arnold","year":"2002","unstructured":"Arnold, D.: Noisy Optimization with Evolution Strategies. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"35_CR2","doi-asserted-by":"publisher","unstructured":"Beyer, H.G.: The Theory of Evolution Strategies. Natural Computing Series. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04378-3","DOI":"10.1007\/978-3-662-04378-3"},{"key":"35_CR3","doi-asserted-by":"publisher","unstructured":"Beyer, H.G.: Convergence analysis of evolutionary algorithms that are based on the paradigm of information geometry. Evol. Comput. 22(4), 679\u2013709 (2014). https:\/\/doi.org\/10.1162\/EVCO_a_00132","DOI":"10.1162\/EVCO_a_00132"},{"key":"35_CR4","doi-asserted-by":"publisher","unstructured":"Beyer, H.G., Melkozerov, A.: The dynamics of self-adaptive multi-recombinant evolution strategies on the general ellipsoid model. IEEE Trans. Evol. Comput. 18(5), 764\u2013778 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2283968","DOI":"10.1109\/TEVC.2013.2283968"},{"key":"35_CR5","doi-asserted-by":"publisher","unstructured":"Beyer, H.G., Sendhoff, B.: Simplify your covariance matrix adaptation evolution strategy. IEEE Trans. Evol. Comput. 21(5), 746\u2013759 (2017). https:\/\/doi.org\/10.1109\/TEVC.2017.2680320","DOI":"10.1109\/TEVC.2017.2680320"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Glasmachers, T., Schaul, T., Sun, Y., Wierstra, D., Schmidhuber, J.: Exponential natural evolution strategies. In: Branke, J., et al., (ed.) GECCO 2010: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 393\u2013400. ACM, New York (2010)","DOI":"10.1145\/1830483.1830557"},{"key":"35_CR7","doi-asserted-by":"publisher","unstructured":"Hansen, N., Kern, S.: Evaluating the CMA evolution strategy on multimodal test functions. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 282\u2013291. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_29","DOI":"10.1007\/978-3-540-30217-9_29"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, N., M\u00fcller, S., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 11(1), 1\u201318 (2003)","DOI":"10.1162\/106365603321828970"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Mobahi, H., Fisher, J.: A theoretical analysis of optimization by Gaussian continuation. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1205\u20131211. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9356"},{"key":"35_CR10","doi-asserted-by":"publisher","unstructured":"M\u00fcller, N., Glasmachers, T.: Non-local optimization: imposing structure on optimization problems by relaxation. In: Foundations of Genetic Algorithms, vol. 16, pp. 1\u201310. ACM (2021). https:\/\/doi.org\/10.1145\/3450218.3477307","DOI":"10.1145\/3450218.3477307"},{"key":"35_CR11","unstructured":"Ollivier, Y., Arnold, L., Auger, A., Hansen, N.: Information-geometric optimization algorithms: a unifying picture via invariance principles. J. Mach. Learn. Res. 18(18), 1\u201365 (2017)"},{"key":"35_CR12","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart (1973)"},{"key":"35_CR13","volume-title":"Numerical Optimization of Computer Models","author":"HP Schwefel","year":"1981","unstructured":"Schwefel, H.P.: Numerical Optimization of Computer Models. Wiley, Chichester (1981)"},{"key":"35_CR14","doi-asserted-by":"publisher","unstructured":"Zhang, J., Bi, S., Zhang, G.: A directional Gaussian smoothing optimization method for computational inverse design in nanophotonics. Mater. Des. 197, 109213 (2021). https:\/\/doi.org\/10.1016\/j.matdes.2020.109213","DOI":"10.1016\/j.matdes.2020.109213"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:03:22Z","timestamp":1710259402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}