{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:12:33Z","timestamp":1778249553629,"version":"3.51.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147135","type":"print"},{"value":"9783031147142","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:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_4","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"46-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Per-run Algorithm Selection with\u00a0Warm-Starting Using Trajectory-Based Features"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5983-7169","authenticated-orcid":false,"given":"Ana","family":"Kostovska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9267-4595","authenticated-orcid":false,"given":"Anja","family":"Jankovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3040-7162","authenticated-orcid":false,"given":"Diederick","family":"Vermetten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"de Nobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4933-5181","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7330-1902","authenticated-orcid":false,"given":"Tome","family":"Eftimov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-3227","authenticated-orcid":false,"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Belkhir, N., Dr\u00e9o, J., Sav\u00e9ant, P., Schoenauer, M.: Per instance algorithm configuration of CMA-ES with limited budget. In: Proceedings of Genetic and Evolutionary Computation (GECCO 2017), pp. 681\u2013688. ACM (2017). https:\/\/doi.org\/10.1145\/3071178.3071343","DOI":"10.1145\/3071178.3071343"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preuss, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO\u201912. pp. 313\u2013320. ACM (2012). https:\/\/doi.org\/10.1145\/2330163.2330209","DOI":"10.1145\/2330163.2330209"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. J. Inst. Math. Appl. 6, 76\u201390 (1970)","journal-title":"J. Inst. Math. Appl."},{"key":"4_CR4","unstructured":"Christ, M., Braun, N., Neuffer, J., Kempa-Liehr, A.W.: tsfresh package for time-series feature engineering. http:\/\/tsfresh.readthedocs.io\/en\/latest\/text\/listoffeatures.html"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-72904-2_3","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"R Cosson","year":"2021","unstructured":"Cosson, R., Derbel, B., Liefooghe, A., Aguirre, H., Tanaka, K., Zhang, Q.: Decomposition-based multi-objective landscape features and automated algorithm selection. In: Zarges, C., Verel, S. (eds.) EvoCOP 2021. LNCS, vol. 12692, pp. 34\u201350. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72904-2_3"},{"key":"4_CR6","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Eftimov, T., Popovski, G., Renau, Q., Koro\u0161ec, P., Doerr, C.: Linear matrix factorization embeddings for single-objective optimization landscapes. In: Proceedings of IEEE Symposium Series on Computational Intelligence (SSCI 2020), pp. 775\u2013782. IEEE (2020). https:\/\/doi.org\/10.1109\/SSCI47803.2020.9308180","DOI":"10.1109\/SSCI47803.2020.9308180"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317\u2013322 (1970)","journal-title":"Comput. J."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"DF Goldfarb","year":"1970","unstructured":"Goldfarb, D.F.: A family of variable-metric methods derived by variational means. Math. Comput. 24, 23\u201326 (1970)","journal-title":"Math. Comput."},{"key":"4_CR10","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-Parameter Black-Box Optimization Benchmarking: Experimental Setup. RR-7215, INRIA (2010)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2020","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optim. Meth. Software 36, 1\u201331 (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Meth. Software"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Hutter, F., Kotthoff, L., Vanschoren, J. (eds.): Automated Machine Learning. TSSCML, Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05318-5","DOI":"10.1007\/978-3-030-05318-5"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Jankovic, A., Doerr, C.: Landscape-aware fixed-budget performance regression and algorithm selection for modular CMA-ES variants. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2020), pp. 841\u2013849. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3390183","DOI":"10.1145\/3377930.3390183"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-030-72699-7_38","volume-title":"Applications of Evolutionary Computation","author":"A Jankovic","year":"2021","unstructured":"Jankovic, A., Eftimov, T., Doerr, C.: Towards feature-based performance regression using trajectory data. In: Castillo, P.A., Jim\u00e9nez Laredo, J.L. (eds.) EvoApplications 2021. LNCS, vol. 12694, pp. 601\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72699-7_38"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Jankovic, A., Popovski, G., Eftimov, T., Doerr, C.: The impact of hyper-parameter tuning for landscape-aware performance regression and algorithm selection. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2021), pp. 687\u2013696. ACM (2021). https:\/\/doi.org\/10.1145\/3449639.3459406","DOI":"10.1145\/3449639.3459406"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Jankovic, A., et al.: Per-Run Algorithm Selection with Warm-starting using Trajectory-based Features - Data, April 2022. https:\/\/doi.org\/10.5281\/zenodo.6458266","DOI":"10.5281\/zenodo.6458266"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Jankovic, A., Vermetten, D., Kostovska, A., de Nobel, J., Eftimov, T., Doerr, C.: Trajectory-based algorithm selection with warm-starting (2022). https:\/\/doi.org\/10.48550\/arxiv.2204.06397","DOI":"10.48550\/arxiv.2204.06397"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02592071","volume":"39","author":"A Kan","year":"1987","unstructured":"Kan, A., Timmer, G.: Stochastic global optimization methods Part II: multi level methods. Math. Program. 39, 57\u201378 (1987). https:\/\/doi.org\/10.1007\/BF02592071","journal-title":"Math. Program."},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Trautmann, H.: The R-package FLACCO for exploratory landscape analysis with applications to multi-objective optimization problems. In: CEC, pp. 5262\u20135269. IEEE (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7748359","DOI":"10.1109\/CEC.2016.7748359"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1613\/jair.4726","volume":"53","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H.H., Hutter, F., Schaub, T.: Autofolio: an automatically configured algorithm selector. J. Artif. Intell. Res. 53, 745\u2013778 (2015). https:\/\/doi.org\/10.1613\/jair.4726","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117058","volume":"201","author":"K Meidani","year":"2022","unstructured":"Meidani, K., Mirjalili, S., Farimani, A.B.: Online metaheuristic algorithm selection. Exp. Syst. Appl. 201, 117058 (2022)","journal-title":"Exp. Syst. Appl."},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2021), pp. 829\u2013836. ACM (2011). https:\/\/doi.org\/10.1145\/2001576.2001690","DOI":"10.1145\/2001576.2001690"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Nobel, J., Wang, H., B\u00e4ck, T.: Explorative data analysis of time series based algorithm features of CMA-ES variants, pp. 510\u2013518, June 2021. https:\/\/doi.org\/10.1145\/3449639.3459399","DOI":"10.1145\/3449639.3459399"},{"key":"4_CR27","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. JMLR 12, 2825\u20132830 (2011)","journal-title":"JMLR"},{"key":"4_CR28","unstructured":"Rapin, J., Teytaud, O.: Nevergrad - A gradient-free optimization platform (2018). http:\/\/GitHub.com\/FacebookResearch\/Nevergrad"},{"key":"4_CR29","unstructured":"van Rijn, S.: Modular CMA-ES framework from [30], v0.3.0 (2018). http:\/\/github.com\/sjvrijn\/ModEA. Available also as PyPi package at http:\/\/pypi.org\/project\/ModEA\/0.3.0\/"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"van Rijn, S., Wang, H., van Leeuwen, M., B\u00e4ck, T.: Evolving the structure of evolution strategies. In: Proceedings of IEEE Symposium Series on Computational Intelligence (SSCI 2016), pp. 1\u20138. IEEE (2016). https:\/\/doi.org\/10.1109\/SSCI.2016.7850138","DOI":"10.1109\/SSCI.2016.7850138"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02592070","volume":"39","author":"AHG RinnooyKan","year":"1987","unstructured":"RinnooyKan, A.H.G., Timmer, G.T.: Stochastic global optimization methods. Part 1: clustering methods. Math. Program. 39(1), 27\u201356 (1987)","journal-title":"Math. Program."},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Schr\u00f6der, D., Vermetten, D., Wang, H., Doerr, C., B\u00e4ck, T.: Chaining of numerical black-box algorithms: Warm-starting and switching points (2022). https:\/\/doi.org\/10.48550\/arxiv.2204.06539","DOI":"10.48550\/arxiv.2204.06539"},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"D Shanno","year":"1970","unstructured":"Shanno, D.: Conditioning of quasi-newton methods for function minimization. Math. Comput. 24, 647\u2013656 (1970)","journal-title":"Math. Comput."},{"issue":"4","key":"4_CR34","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Wang, H., Vermetten, D., Ye, F., Doerr, C., B\u00e4ck, T.: Iohanalyzer: Detailed performance analysis for iterative optimization heuristic. ACM Trans. Evol. Learn. Optim. (2022). https:\/\/doi.org\/10.1145\/3510426, to appear. IOHanalyzer is available at CRAN, on GitHub, and as web-based GUI, see http:\/\/iohprofiler.github.io\/IOHanalyzer\/ for links","DOI":"10.1145\/3510426"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_18"}],"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-14714-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:40:41Z","timestamp":1710261641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_4","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":"14 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)"}}]}}