{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:22:50Z","timestamp":1776752570387,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712256.3726408","type":"proceedings-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T12:28:18Z","timestamp":1751977698000},"page":"1199-1207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Greedy Restart Schedules: A Baseline for Dynamic Algorithm Selection on Numerical Black-box Optimization Problems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3929-7465","authenticated-orcid":false,"given":"Lennart","family":"Sch\u00e4permeier","sequence":"first","affiliation":[{"name":"TU Dresden, Dresden, Germany"},{"name":"ScaDS.AI, Dresden\/Leipzig, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Performance evaluation of an advanced local search evolutionary algorithm. In 2005 IEEE congress on evolutionary computation","author":"Auger Anne","unstructured":"Anne Auger and Nikolaus Hansen. 2005. Performance evaluation of an advanced local search evolutionary algorithm. In 2005 IEEE congress on evolutionary computation, Vol. 2. IEEE, 1777\u20131784."},{"key":"e_1_3_2_1_2_1","volume-title":"A restart CMA evolution strategy with increasing population size. In 2005 IEEE congress on evolutionary computation","author":"Auger Anne","unstructured":"Anne Auger and Nikolaus Hansen. 2005. A restart CMA evolution strategy with increasing population size. In 2005 IEEE congress on evolutionary computation, Vol. 2. IEEE, 1769\u20131776."},{"key":"e_1_3_2_1_3_1","volume-title":"COCOpf: An algorithm portfolio framework. arXiv preprint arXiv:1405.3487","author":"Baudi\u0161 Petr","year":"2014","unstructured":"Petr Baudi\u0161. 2014. COCOpf: An algorithm portfolio framework. arXiv preprint arXiv:1405.3487 (2014)."},{"key":"e_1_3_2_1_4_1","series-title":"SIAM Journal on scientific computing 16, 5","volume-title":"A limited memory algorithm for bound constrained optimization","author":"Byrd Richard H","year":"1995","unstructured":"Richard H Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. 1995. A limited memory algorithm for bound constrained optimization. SIAM Journal on scientific computing 16, 5 (1995), 1190\u20131208."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101534"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3463167"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654100"},{"key":"e_1_3_2_1_8_1","volume-title":"Deep reinforcement learning for dynamic algorithm selection: A proof-of-principle study on differential evolution","author":"Guo Hongshu","year":"2024","unstructured":"Hongshu Guo, Yining Ma, Zeyuan Ma, Jiacheng Chen, Xinglin Zhang, Zhiguang Cao, Jun Zhang, and Yue-Jiao Gong. 2024. Deep reinforcement learning for dynamic algorithm selection: A proof-of-principle study on differential evolution. IEEE Transactions on Systems, Man, and Cybernetics: Systems (2024)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570333"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1808977"},{"key":"e_1_3_2_1_11_1","volume-title":"Completely derandomized self-adaptation in evolution strategies. Evolutionary computation 9, 2","author":"Hansen Nikolaus","year":"2001","unstructured":"Nikolaus Hansen and Andreas Ostermeier. 2001. Completely derandomized self-adaptation in evolution strategies. Evolutionary computation 9, 2 (2001), 159\u2013195."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70055-2_7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000015"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464576.2501592"},{"key":"e_1_3_2_1_15_1","volume-title":"Automated algorithm selection: Survey and perspectives. Evolutionary computation 27, 1","author":"Kerschke Pascal","year":"2019","unstructured":"Pascal Kerschke, Holger H Hoos, Frank Neumann, and Heike Trautmann. 2019. Automated algorithm selection: Survey and perspectives. Evolutionary computation 27, 1 (2019), 3\u201345."},{"key":"e_1_3_2_1_16_1","volume-title":"Leveraging TSP solver complementarity through machine learning. Evolutionary computation 26, 4","author":"Kerschke Pascal","year":"2018","unstructured":"Pascal Kerschke, Lars Kotthoff, Jakob Bossek, Holger H Hoos, and Heike Trautmann. 2018. Leveraging TSP solver complementarity through machine learning. Evolutionary computation 26, 4 (2018), 597\u2013620."},{"key":"e_1_3_2_1_17_1","volume-title":"Automated algorithm selection on continuous black-box problems by combining exploratory landscape analysis and machine learning. Evolutionary computation 27, 1","author":"Kerschke Pascal","year":"2019","unstructured":"Pascal Kerschke and Heike Trautmann. 2019. Automated algorithm selection on continuous black-box problems by combining exploratory landscape analysis and machine learning. Evolutionary computation 27, 1 (2019), 99\u2013127."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Pascal Kerschke and Heike Trautmann. 2019. Comprehensive feature-based landscape analysis of continuous and constrained optimization problems using the R-package facco. Applications in Statistical Computing: From Music Data Analysis to Industrial Quality Improvement (2019) 93\u2013123.","DOI":"10.1007\/978-3-030-25147-5_7"},{"key":"e_1_3_2_1_19_1","volume-title":"A software package for sequential quadratic programming. Forschungsbericht- Deutsche Forschungs- und Versuchsanstalt fur Luft- und Raumfahrt","author":"Kraft Dieter","year":"1988","unstructured":"Dieter Kraft. 1988. A software package for sequential quadratic programming. Forschungsbericht- Deutsche Forschungs- und Versuchsanstalt fur Luft- und Raumfahrt (1988)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528712"},{"key":"e_1_3_2_1_21_1","volume-title":"Using the empirical attainment function for analyzing single-objective black-box optimization algorithms","author":"L\u00f3pez-Ib\u00e1\u00f1ez Manuel","year":"2024","unstructured":"Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Diederick Vermetten, Johann Dreo, and Carola Doerr. 2024. Using the empirical attainment function for analyzing single-objective black-box optimization algorithms. IEEE Transactions on Evolutionary Computation (2024)."},{"key":"e_1_3_2_1_22_1","volume-title":"CMA-ES for hyperparameter optimization of deep neural networks. arXiv preprint arXiv:1604.07269","author":"Loshchilov Ilya","year":"2016","unstructured":"Ilya Loshchilov and Frank Hutter. 2016. CMA-ES for hyperparameter optimization of deep neural networks. arXiv preprint arXiv:1604.07269 (2016)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464576.2482696"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001690"},{"key":"e_1_3_2_1_25_1","volume-title":"An efficient method for finding the minimum of a function of several variables without calculating derivatives. The computer journal 7, 2","author":"Powell Michael JD","year":"1964","unstructured":"Michael JD Powell. 1964. An efficient method for finding the minimum of a function of several variables without calculating derivatives. The computer journal 7, 2 (1964), 155\u2013162."},{"key":"e_1_3_2_1_26_1","volume-title":"International Conference on Parallel Problem Solving from Nature. Springer, 575\u2013589","author":"Schneider Lennart","year":"2022","unstructured":"Lennart Schneider, Lennart Sch\u00e4permeier, Raphael Patrick Prager, Bernd Bischl, Heike Trautmann, and Pascal Kerschke. 2022. HPO\u00d7 ELA: investigating hyperparameter optimization landscapes by means of exploratory landscape analysis. In International Conference on Parallel Problem Solving from Nature. Springer, 575\u2013589."},{"key":"e_1_3_2_1_27_1","volume-title":"Switching between Numerical Black-box Optimization Algorithms with Warm-starting Policies. arXiv preprint arXiv:2204.06539","author":"Schr\u00f6der Dominik","year":"2022","unstructured":"Dominik Schr\u00f6der, Diederick Vermetten, Hao Wang, Carola Doerr, and Thomas B\u00e4ck. 2022. Switching between Numerical Black-box Optimization Algorithms with Warm-starting Policies. arXiv preprint arXiv:2204.06539 (2022)."},{"key":"e_1_3_2_1_28_1","volume-title":"Deep-ELA: Deep exploratory landscape analysis with self-supervised pretrained transformers for single-and multi-objective continuous optimization problems. Evolutionary Computation","author":"Seiler Moritz Vinzent","year":"2025","unstructured":"Moritz Vinzent Seiler, Pascal Kerschke, and Heike Trautmann. 2025. Deep-ELA: Deep exploratory landscape analysis with self-supervised pretrained transformers for single-and multi-objective continuous optimization problems. Evolutionary Computation (2025), 1\u201327."},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence. IEEE, 519\u2013524","author":"Swarzberg Stefan","year":"1994","unstructured":"Stefan Swarzberg, Gregory Seront, and Hugues Bersini. 1994. STEP: The easiest way to optimize a function. In Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence. IEEE, 519\u2013524."},{"key":"e_1_3_2_1_30_1","volume-title":"Reviewing and benchmarking parameter control methods in differential evolution","author":"Tanabe Ryoji","year":"2019","unstructured":"Ryoji Tanabe and Alex Fukunaga. 2019. Reviewing and benchmarking parameter control methods in differential evolution. IEEE transactions on cybernetics 50, 3 (2019), 1170\u20131184."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3326891"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390189"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30229-9_22"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Pauli Virtanen Ralf Gommers Travis E Oliphant Matt Haberland Tyler Reddy David Cournapeau Evgeni Burovski Pearu Peterson Warren Weckesser Jonathan Bright et al. 2020. SciPy 1.0: fundamental algorithms for scientific computing in Python. Nature methods 17 3 (2020) 261\u2013272.","DOI":"10.1038\/s41592-020-0772-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622673.1622687"}],"event":{"name":"GECCO '25: Genetic and Evolutionary Computation Conference","location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25","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\/pdf\/10.1145\/3712256.3726408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T20:43:04Z","timestamp":1759869784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712256.3726408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":36,"alternative-id":["10.1145\/3712256.3726408","10.1145\/3712256"],"URL":"https:\/\/doi.org\/10.1145\/3712256.3726408","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}