{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:04:37Z","timestamp":1773655477468,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P015638\/1"],"award-info":[{"award-number":["EP\/P015638\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA15140"],"award-info":[{"award-number":["CA15140"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Paris Ile-de-France Region","award":["Online Configuration of Heuristic Optimization Algorithms"],"award-info":[{"award-number":["Online Configuration of Heuristic Optimization Algorithms"]}]},{"DOI":"10.13039\/501100008952","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\/501100008952","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321725","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"889-897","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Hyper-parameter tuning for the (1 + (\n            <i>\u03bb, \u03bb<\/i>\n            )) GA"],"prefix":"10.1145","author":[{"given":"Nguyen","family":"Dang","sequence":"first","affiliation":[{"name":"University of St-Andrews, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996355"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832249.2832351"},{"key":"e_1_3_2_1_3_1","unstructured":"Ml4AAD Group at Freiburg University. {n. d.}. PyImp. https:\/\/github.com\/automl\/ParameterImportance.  Ml4AAD Group at Freiburg University. {n. d.}. PyImp. https:\/\/github.com\/automl\/ParameterImportance."},{"key":"e_1_3_2_1_4_1","unstructured":"HPCaVe Cluster at Sorbonne University. {n. d.}. http:\/\/hpcave.upmc.fr\/index.php\/resources\/mesu-beta\/.  HPCaVe Cluster at Sorbonne University. {n. d.}. http:\/\/hpcave.upmc.fr\/index.php\/resources\/mesu-beta\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570342"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of Learning and Intelligent Optimization (LION'17) (Lecture Notes in Computer Science)","author":"C\u00e1ceres Leslie P\u00e9rez","unstructured":"Leslie P\u00e9rez C\u00e1ceres , Manuel L\u00f3pez-Ib\u00e1\u00f1ez , Holger Hoos , and Thomas St\u00fctzle . 2017. An Experimental Study of Adaptive Capping in irace . In Proc. of Learning and Intelligent Optimization (LION'17) (Lecture Notes in Computer Science) , Vol. 10556 . Springer , 235--250. Leslie P\u00e9rez C\u00e1ceres, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Holger Hoos, and Thomas St\u00fctzle. 2017. An Experimental Study of Adaptive Capping in irace. In Proc. of Learning and Intelligent Optimization (LION'17) (Lecture Notes in Computer Science), Vol. 10556. Springer, 235--250."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science)","author":"Pinto Eduardo Carvalho","unstructured":"Eduardo Carvalho Pinto and Carola Doerr . 2018. A Simple Proof for the Usefulness of Crossover in Black-Box Optimization . In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science) , Vol. 11102 . Springer , 29--41. Full version available at http:\/\/arxiv.org\/abs\/1812.00493. Eduardo Carvalho Pinto and Carola Doerr. 2018. A Simple Proof for the Usefulness of Crossover in Black-Box Optimization. In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science), Vol. 11102. Springer, 29--41. Full version available at http:\/\/arxiv.org\/abs\/1812.00493."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321725"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_12_1","volume-title":"Theory of Randomized Search Heuristics in Discrete Search Spaces","author":"Doerr Benjamin","unstructured":"Benjamin Doerr and Carola Doerr . 2018. Theory of Parameter Control Mechanisms for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices . In Theory of Randomized Search Heuristics in Discrete Search Spaces , Benjamin Doerr and Frank Neumann (Eds.). Springer . To appear. Available online at https:\/\/arxiv.org\/abs\/1804.05650. Benjamin Doerr and Carola Doerr. 2018. Theory of Parameter Control Mechanisms for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices. In Theory of Randomized Search Heuristics in Discrete Search Spaces, Benjamin Doerr and Frank Neumann (Eds.). Springer. To appear. Available online at https:\/\/arxiv.org\/abs\/1804.05650."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908950"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_16_1","volume-title":"IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs\/1810.05281","author":"Doerr Carola","year":"2018","unstructured":"Carola Doerr , Hao Wang , Furong Ye , Sander van Rijn , and Thomas B\u00e4ck . 2018. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs\/1810.05281 ( 2018 ). arXiv:1810.05281 http:\/\/arxiv.org\/abs\/1810.05281 IOHprofiler is available at https:\/\/github.com\/IOHprofiler. Carola Doerr, Hao Wang, Furong Ye, Sander van Rijn, and Thomas B\u00e4ck. 2018. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs\/1810.05281 (2018). arXiv:1810.05281 http:\/\/arxiv.org\/abs\/1810.05281 IOHprofiler is available at https:\/\/github.com\/IOHprofiler."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9213-y"},{"key":"e_1_3_2_1_18_1","volume-title":"International Conference on Machine Learning. 754--762","author":"Hoos Holger","year":"2014","unstructured":"Holger Hoos and Kevin Leyton-Brown . 2014 . An efficient approach for assessing hyperparameter importance . In International Conference on Machine Learning. 754--762 . Holger Hoos and Kevin Leyton-Brown. 2014. An efficient approach for assessing hyperparameter importance. In International Conference on Machine Learning. 754--762."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734953.1734959"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023416.59689.4e"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science)","author":"Lengler Johannes","unstructured":"Johannes Lengler . 2018. A General Dichotomy of Evolutionary Algorithms on Monotone Functions . In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science) , Vol. 11102 . Springer , 3--15. Johannes Lengler. 2018. A General Dichotomy of Evolutionary Algorithms on Monotone Functions. In Proc. of Parallel Problem Solving from Nature (PPSN'18) (Lecture Notes in Computer Science), Vol. 11102. Springer, 3--15."},{"key":"e_1_3_2_1_25_1","article-title":"Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization","volume":"18","author":"Li Lisha","year":"2017","unstructured":"Lisha Li , Kevin G. Jamieson , Giulia DeSalvo , Afshin Rostamizadeh , and Ameet Talwalkar . 2017 . Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization . Journal of Machine Learning Research 18 (2017), 185:1--185:52. http:\/\/jmlr.org\/papers\/v18\/16-558.html Lisha Li, Kevin G. Jamieson, Giulia DeSalvo, Afshin Rostamizadeh, and Ameet Talwalkar. 2017. Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization. Journal of Machine Learning Research 18 (2017), 185:1--185:52. http:\/\/jmlr.org\/papers\/v18\/16-558.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","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\/10.1145\/3321707.3321725","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:19Z","timestamp":1750204399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":26,"alternative-id":["10.1145\/3321707.3321725","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321725","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}