{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T21:11:15Z","timestamp":1759871475765,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","funder":[{"name":"Land Nordrhein-Westfalen","award":["Dataninja (Trustworthy AI for Seamless Problem Solving: Next Generation Intelligence Joins Robust Data Analysis"],"award-info":[{"award-number":["Dataninja (Trustworthy AI for Seamless Problem Solving: Next Generation Intelligence Joins Robust Data Analysis"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712256.3726480","type":"proceedings-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T12:28:18Z","timestamp":1751977698000},"page":"1190-1198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep reinforcement learning for instance-specific algorithm configuration"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5040-2115","authenticated-orcid":false,"given":"Elias","family":"Schede","sequence":"first","affiliation":[{"name":"Bielefeld University, Bielefeld, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-9060","authenticated-orcid":false,"given":"Moritz","family":"Seiler","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5931-4907","authenticated-orcid":false,"given":"Kevin","family":"Tierney","sequence":"additional","affiliation":[{"name":"Bielefeld University, Bielefeld, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9788-8282","authenticated-orcid":false,"given":"Heike","family":"Trautmann","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13922"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.006"},{"key":"e_1_3_2_1_3_1","volume-title":"International Joint Conference on Artificial Intelligence (IJCAI). 733\u2013739","author":"Ans\u00f3tegui Carlos","year":"2015","unstructured":"Carlos Ans\u00f3tegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, and Kevin Tierney. 2015. Model-based genetic algorithms for algorithm configuration. In International Joint Conference on Artificial Intelligence (IJCAI). 733\u2013739."},{"volume-title":"Theory and Applications of Satisfiability Testing - SAT","author":"Ans\u00f3tegui Carlos","key":"e_1_3_2_1_4_1","unstructured":"Carlos Ans\u00f3tegui, Josep Pon, Meinolf Sellmann, and Kevin Tierney. 2021. Py-DGGA: Distributed GGA for automatic configuration. In Theory and Applications of Satisfiability Testing - SAT, Vol. 12831. Springer, 11\u201320."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"e_1_3_2_1_6_1","volume-title":"International Joint Conference on Artificial Intelligence (IJCAI). 399\u2013404","author":"Audemard Gilles","year":"2009","unstructured":"Gilles Audemard and Laurent Simon. 2009. Predicting learnt clauses quality in modern SAT solvers. In International Joint Conference on Artificial Intelligence (IJCAI). 399\u2013404."},{"volume-title":"Principles and Practice of Constraint Programming (CP)","author":"Audemard Gilles","key":"e_1_3_2_1_7_1","unstructured":"Gilles Audemard and Laurent Simon. 2012. Refining restarts strategies for SAT and UNSAT. In Principles and Practice of Constraint Programming (CP), Vol. 7514. Springer, 118\u2013126."},{"key":"e_1_3_2_1_8_1","unstructured":"Fahiem Bacchus Jeremias Berg Matti J\u00e4rvisalo and Ruben Martins. 2020. MaxSAT evaluation 2020: Solver and benchmark descriptions."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071343"},{"volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Berg Jeremias","key":"e_1_3_2_1_10_1","unstructured":"Jeremias Berg, Emir Demirovi\u0107, and Peter J Stuckey. 2019. Core-boosted linear search for incomplete MaxSAT. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer, 39\u201356."},{"key":"e_1_3_2_1_11_1","volume-title":"IsaSAT and Kissat entering the SAT Competition","author":"Biere Armin","year":"2024","unstructured":"Armin Biere, Tobias Faller, Katalin Fazekas, Mathias Fleury, Nils Froleyks, and Florian Pollitt. 2024. CaDiCaL, Gimsatul, IsaSAT and Kissat entering the SAT Competition 2024. In SAT Competition 2024 - Solver, Benchmark and Proof Checker Descriptions (Department of Computer Science Report Series B, Vol. B-2024-1). 8\u201310."},{"key":"e_1_3_2_1_12_1","volume-title":"International Conference on Machine Learning (ICML). PMLR, 933\u2013941","author":"Dauphin Yann N","year":"2017","unstructured":"Yann N Dauphin, Angela Fan, Michael Auli, and David Grangier. 2017. Language modeling with gated convolutional networks. In International Conference on Machine Learning (ICML). PMLR, 933\u2013941."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00061"},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on Artificial Intelligence and Statistics. 249\u2013256","author":"Glorot Xavier","year":"2010","unstructured":"Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In International Conference on Artificial Intelligence and Statistics. 249\u2013256."},{"key":"e_1_3_2_1_15_1","volume-title":"International Conference on Machine Learning (ICML). PMLR","author":"Haarnoja Tuomas","year":"2018","unstructured":"Tuomas Haarnoja, Aurick Zhou, Pieter Abbeel, and Sergey Levine. 2018. Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor. In International Conference on Machine Learning (ICML). PMLR, 1861\u20131870."},{"key":"e_1_3_2_1_16_1","unstructured":"Jesse Michael Han. 2020. Enhancing SAT solvers with glue variable predictions. (2020). https:\/\/arxiv.org\/abs\/2007.02559"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"volume-title":"Learning and Intelligent Optimization (LION5)","author":"Hutter Frank","key":"e_1_3_2_1_19_1","unstructured":"Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown. 2011. Sequential modelbased optimization for general algorithm configuration. In Learning and Intelligent Optimization (LION5). Springer, 507\u2013523."},{"volume-title":"Learning and Intelligent Optimization (LION8)","author":"Hutter Frank","key":"e_1_3_2_1_20_1","unstructured":"Frank Hutter, Manuel L\u00f3pez-Ib\u00e1nez, Chris Fawcett, Marius Lindauer, Holger H Hoos, Kevin Leyton-Brown, and Thomas St\u00fctzle. 2014. AClib: A benchmark library for algorithm configuration. In Learning and Intelligent Optimization (LION8). Springer, 36\u201340."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"e_1_3_2_1_22_1","unstructured":"IBM. 2022. ILOG CPLEX optimization studio 22.1.1: user's manual. https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1?topic=cplex-optimizers"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-60750-606-5-751"},{"key":"e_1_3_2_1_24_1","volume-title":"Kevin Tierney, and Dimitri Wei\u00df.","author":"Kemminer Robin","year":"2024","unstructured":"Robin Kemminer, Jannick Lange, Jens Peter Kempkes, Kevin Tierney, and Dimitri Wei\u00df. 2024. Configuring Mixed-Integer Programming Solvers for Large-Scale Instances. In Operations Research Forum, Vol. 5. Springer, 1\u201314."},{"key":"e_1_3_2_1_25_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.132"},{"key":"e_1_3_2_1_27_1","unstructured":"Marius Lindauer Katharina Eggensperger Matthias Feurer Andr\u00e9 Biedenkapp Difan Deng Carolin Benjamins Ren\u00e9 Sass and Frank Hutter. 2021. SMAC3: A versatile bayesian optimization package for hyperparameter optimization. (2021). arXiv:2109.09831"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4726"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.12.086"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_3_2_1_31_1","volume-title":"International Joint Conference on Artificial Intelligence (IJCAI). 608\u2013614","author":"Malitsky Yuri","year":"2013","unstructured":"Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, and Meinolf Sellmann. 2013. Algorithm portfolios based on cost-sensitive hierarchical clustering. In International Joint Conference on Artificial Intelligence (IJCAI). 608\u2013614."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29828-8_16"},{"key":"e_1_3_2_1_33_1","unstructured":"Marius Merschformann. 2024. SardineCan. https:\/\/github.com\/merschformann\/sardine-can commit fa7ccc7."},{"volume-title":"Theory and Applications of Satisfiability Testing","author":"Nadel Alexander","key":"e_1_3_2_1_34_1","unstructured":"Alexander Nadel. 2018. Solving MaxSAT with bit-vector optimization. In Theory and Applications of Satisfiability Testing. Springer, 54\u201372."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI50451.2021.9660123"},{"key":"e_1_3_2_1_36_1","volume-title":"The boosting approach to machine learning: An overview. Nonlinear Estimation and Classification","author":"Schapire Robert E.","year":"2003","unstructured":"Robert E. Schapire. 2003. The boosting approach to machine learning: An overview. Nonlinear Estimation and Classification (2003), 149\u2013171."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13676"},{"key":"e_1_3_2_1_38_1","volume-title":"Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."},{"key":"e_1_3_2_1_39_1","volume-title":"Deep-ELA: Deep exploratory landscape analysis with self-supervised pretrained transformers for single-and aulti-objective continuous optimization problems. arXiv preprint arXiv:2401.01192","author":"Seiler Moritz Vinzent","year":"2024","unstructured":"Moritz Vinzent Seiler, Pascal Kerschke, and Heike Trautmann. 2024. Deep-ELA: Deep exploratory landscape analysis with self-supervised pretrained transformers for single-and aulti-objective continuous optimization problems. arXiv preprint arXiv:2401.01192 (2024)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528834"},{"key":"e_1_3_2_1_41_1","volume-title":"IEEE Symposium Series on Computational Intelligence. IEEE, 361\u2013368","author":"Seiler Moritz Vinzent","year":"2023","unstructured":"Moritz Vinzent Seiler, Jeroen Rook, Jonathan Heins, Oliver Ludger Preu\u00df, Jakob Bossek, and Heike Trautmann. 2023. Using reinforcement learning for perinstance algorithm configuration on the TSP. In IEEE Symposium Series on Computational Intelligence. IEEE, 361\u2013368."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106740"},{"volume-title":"Learning and Intelligent Optimization (LION9) (Lecture Notes in Computer Science","author":"Tierney Kevin","key":"e_1_3_2_1_43_1","unstructured":"Kevin Tierney and Yuri Malitsky. 2015. An algorithm selection benchmark of the container pre-marshalling Problem. In Learning and Intelligent Optimization (LION9) (Lecture Notes in Computer Science, Vol. 8994). Springer, 17\u201322."},{"key":"e_1_3_2_1_44_1","volume-title":"Instance-wise algorithm configuration with graph neural networks. arXiv preprint arXiv:2202.04910","author":"Valentin Romeo","year":"2022","unstructured":"Romeo Valentin, Claudio Ferrari, J\u00e9r\u00e9my Scheurer, Andisheh Amrollahi, Chris Wendler, and Max B Paulus. 2022. Instance-wise algorithm configuration with graph neural networks. arXiv preprint arXiv:2202.04910 (2022)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.06.064"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110160"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622673.1622687"},{"key":"e_1_3_2_1_49_1","volume-title":"Iternational Joint Conference on Artificial Intelligence (IJCAI). 16\u201330","author":"Xu Lin","year":"2011","unstructured":"Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. 2011. Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming. In Iternational Joint Conference on Artificial Intelligence (IJCAI). 16\u201330."},{"key":"e_1_3_2_1_50_1","first-page":"20147","article-title":"Multi-agent dynamic algorithm configuration","volume":"35","author":"Xue Ke","year":"2022","unstructured":"Ke Xue, Jiacheng Xu, Lei Yuan, Miqing Li, Chao Qian, Zongzhang Zhang, and Yang Yu. 2022. Multi-agent dynamic algorithm configuration. Advances in Neural Information Processing Systems (NeurIPS) 35 (2022), 20147\u201320161.","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"}],"event":{"name":"GECCO '25: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712256.3726480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T20:43:18Z","timestamp":1759869798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712256.3726480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":50,"alternative-id":["10.1145\/3712256.3726480","10.1145\/3712256"],"URL":"https:\/\/doi.org\/10.1145\/3712256.3726480","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"}}]}}