{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:44:03Z","timestamp":1742921043396,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031248658"},{"type":"electronic","value":"9783031248665"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-24866-5_26","type":"book-chapter","created":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T19:02:42Z","timestamp":1675537362000},"page":"347-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparing Surrogate Models for\u00a0Tuning Optimization Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9439-3113","authenticated-orcid":false,"given":"Gustavo","family":"Delazeri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7894-1634","authenticated-orcid":false,"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0786-2127","authenticated-orcid":false,"given":"Marcelo","family":"de Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,5]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a nextgeneration hyperparameter optimization framework. In: Proceedings of the 25rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2019)","DOI":"10.1145\/3292500.3330701"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Astudillo, R., Frazier, P.I.: Thinking inside the box: a tutorial on grey-box bayesian optimization. In: Proceedings of the 2021 Winter Simulation Conference, December 2021","DOI":"10.1109\/WSC52266.2021.9715343"},{"key":"26_CR3","unstructured":"AutoML. RFR: A extensible C++ library for random forests with Python bindings, December 2022. https:\/\/github.com\/automl\/random_forest_run"},{"key":"26_CR4","unstructured":"Bergstra, J., Yamins, D., Cox, D.: Making a science of model search: hyperparameter optimization in hundreds of dimensions for vision architectures. In: Dasgupta, S., McAllester, D. (eds.) Proceedings of the 30th International Conference on Machine Learning, vol. 28. Proceedings of Machine Learning Research 1. Atlanta, Georgia, USA: PMLR, June 2013, pp. 115\u2013123. https:\/\/proceedings.mlr.press\/v28\/bergstra13.html"},{"key":"26_CR5","unstructured":"Bliek, L., Guijt, A., Karlsson, R., Verwer, S., de Weerdt, M.: EXPObench: benchmarking surrogate-based optimisation algorithms on expensive black-box functions. In: CoRR abs\/2106.04618 (2021). arXiv: 2106.04618"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, pp. 785\u2013794. ACM, San Francisco (2016). ISBN: 978-1-4503-4232-2. https:\/\/doi.org\/10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"key":"26_CR7","unstructured":"Claesen, M., Simm, J., Popovic, D., Moreau, Y., Moor, B.D.: Easy hyperparameter search using optunity. In: CoRR abs\/1412.1114 (2014). arXiv: 1412.1114"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s12532-018-0144-7","volume":"10","author":"A Costa","year":"2018","unstructured":"Costa, A., Nannicini, G.: RBFOpt: an open-source library for black-box optimization with costly function evaluations. Math. Program. Comput. 10(4), 597\u2013629 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0144-7","journal-title":"Math. Program. Comput."},{"key":"26_CR9","unstructured":"Cowen-Rivers, A., Lyu, W., Wang, Z., Tutunov, R., Jianye, H., Wang, J., Ammar, H.: HEBO: heteroscedastic evolutionary bayesian optimisation, December 2020. https:\/\/valohaichirpprod.blob.core.windows.net\/papers\/huawei.pdf"},{"key":"26_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"26_CR11","unstructured":"Eggensperger, K., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Efficient benchmarking of hyperparameter optimizers via surrogates. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25\u201330 January 2015, pp. 1114\u20131120. AAAI Press, Austin (2015). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9993"},{"key":"26_CR12","unstructured":"Eggensperger, K., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Efficient benchmarking of hyperparameter optimizers via surrogates. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25\u201330 January, 2015, pp. 1114\u20131120. AAAI Press, Austin (2015). http:\/\/ceur-ws.org\/Vol-1201\/paper-06.pdf"},{"key":"26_CR13","unstructured":"Eggensperger, K., Lindauer, M., Hoos, H.H., Hutter, F., Leyton-Brown, K.: Efficient benchmarking of algorithm configuration procedures via model-based surrogates. In: CoRR abs\/1703.10342 (2017). arXiv: 1703.10342"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Eggensperger, K., Lindauer, M., Hoos, H.H., Hutter, F., Leyton-Brown, K.: Efficient benchmarking of algorithm configurators via model-based surrogates. In: Mach. Learn. 107(1), 15\u201341 (2018). https:\/\/doi.org\/10.1007\/s10994-017-5683-z","DOI":"10.1007\/s10994-017-5683-z"},{"key":"26_CR15","unstructured":"Eggensperger, K., et al.: HPOBench: a collection of reproducible multi-fidelity benchmark problems for HPO. In: Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2) (2021)"},{"key":"26_CR16","unstructured":"Gorishniy, Y., Rubachev, I., Khrulkov, V., Babenko, A.: Revisiting deep learning models for tabular data. In: CoRR abs\/2106.11959 (2021). arXiv: 2106.11959"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Gutmann, H.-M.: A radial basis function method for global optimization. In: J. Global Optim. 19(3), 201\u2013227 (2001). issn: 0925\u20135001. https:\/\/doi.org\/10.1023\/A:1011255519438","DOI":"10.1023\/A:1011255519438"},{"key":"26_CR18","doi-asserted-by":"publisher","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Comput. 9(2), 159\u2013195 (2001). https:\/\/doi.org\/10.1162\/106365601750190398","DOI":"10.1162\/106365601750190398"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, June 2016. https:\/\/doi.org\/10.1109\/cvpr.2016.90","DOI":"10.1109\/cvpr.2016.90"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-99253-2_8","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"R Tin\u00f3s","year":"2018","unstructured":"Tin\u00f3s, R., Helsgaun, K., Whitley, D.: Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 95\u2013107. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_8"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Helsgaun, K.: General k-opt Submoves for the Lin-Kernighan TSP Heuristic. Math. Programm. Comput. 1(2-3), 119\u2013163 (2009)","DOI":"10.1007\/s12532-009-0004-6"},{"key":"26_CR23","unstructured":"Helsgaun, K.: Source Code of the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic (2018). http:\/\/webhotel4.ruc.dk\/~keld\/research\/LKH"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009). https:\/\/doi.org\/10.1613\/jair.2861","journal-title":"J. Artif. Intell. Res."},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-09584-4_4","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2014","unstructured":"Hutter, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Fawcett, C., Lindauer, M., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: AClib: a benchmark library for algorithm configuration. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) LION 2014. LNCS, vol. 8426, pp. 36\u201340. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09584-4_4"},{"key":"26_CR27","doi-asserted-by":"publisher","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: Methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014). https:\/\/doi.org\/10.1016%2Fj.artint.2013.10.003. https:\/\/doi.org\/10.1016\/j.artint.2013.10.003","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"26_CR28","unstructured":"Johnson, D.S., McGeoch, L.A., Rego, C., Glover, F.: 8th DIMACS Implementation Challenge: The Traveling Salesman Problem (2001). http:\/\/dimacs.rutgers.edu\/archive\/Challenges\/TSP"},{"key":"26_CR29","doi-asserted-by":"publisher","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1-2), 81\u201393 (1938). https:\/\/doi.org\/10.1093\/biomet\/30.1-2.81","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"26_CR30","unstructured":"Klein, A., Dai, Z., Hutter, F., Lawrence, N., Gonz\u00e1lez, J.: Meta-surrogate benchmarking for hyperparameter optimization. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems. Curran Associates Inc., Red Hook (2019)"},{"key":"26_CR31","unstructured":"Lindauer, M., et al.: SMAC3: a versatile bayesian optimization package for hyperparameter optimization. In: CoRR (2021). arXiv: 2109.09831 [cs.LG]"},{"key":"26_CR32","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"26_CR33","unstructured":"Malherbe, C., Vayatis, N.: Global optimization of lipschitz functions. In: Proceedings of the 34th International Conference on Machine Learning - Volume 70, ICML 2017. Sydney, NSW, Australia: JMLR.org, pp. 2314\u20132323 (2017)"},{"key":"26_CR34","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"26_CR35","unstructured":"Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V., Gulin, A.: CatBoost: unbiased boosting with categorical features. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems. NIPS 2018, pp. 6639\u20136649. Curran Associates Inc., Montr\u00e9al (2018)"},{"key":"26_CR36","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976). https:\/\/doi.org\/10.1016\/S0065-2458(08)60520-3","journal-title":"Adv. Comput."},{"key":"26_CR37","doi-asserted-by":"publisher","unstructured":"Shepard, D.: A two-dimensional interpolation function for irregularlyspaced data. In: Proceedings of the 1968 23rd ACM National Conference. ACM Press (1968). https:\/\/doi.org\/10.1145\/800186.810616","DOI":"10.1145\/800186.810616"},{"key":"26_CR38","doi-asserted-by":"publisher","unstructured":"\u0160kvorc, U., Eftimov, T., Koro\u0161ec, P.: GECCO black-box optimization competitions. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. ACM, July 2019. https:\/\/doi.org\/10.1145\/3319619.3321996","DOI":"10.1145\/3319619.3321996"},{"key":"26_CR39","unstructured":"Springenberg, J.T., Klein, A., Falkner, S., Hutter, F.: Bayesian optimization with robust bayesian neural networks. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 12. Curran Associates Inc. (2016). https:\/\/proceedings.neurips.cc\/paper\/2016\/file\/a96d3afec184766bfeca7a9f989fc7e7-Paper.pdf"},{"key":"26_CR40","unstructured":"St\u00fctzle, T.: ACOTSP: a software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem (2002). http:\/\/www.aco-metaheuristic.org\/aco-code"},{"key":"26_CR41","unstructured":"Turner, R., et al.: Black-Box Optimization for Machine Learning (2020). https:\/\/github.com\/rdturnermtl\/bbo_challenge_starter_kit"},{"key":"26_CR42","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems, vol. 30. Curran Associates Inc. (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/file\/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf"},{"key":"26_CR43","doi-asserted-by":"publisher","unstructured":"Wilson, D.R., Martinez, T.R.: Improved heterogeneous distance functions. J. Artif. Intell. Res. 6, January 1997. https:\/\/doi.org\/10.1613\/jair.346","DOI":"10.1613\/jair.346"},{"key":"26_CR44","doi-asserted-by":"publisher","unstructured":"Wright, M.N., Ziegler, A.: Ranger: a fast implementation of random forests for high dimensional data in C++ and R. J. Stat. Softw. 77(1 )(2017). https:\/\/doi.org\/10.18637\/jss.v077.i01","DOI":"10.18637\/jss.v077.i01"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24866-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T19:06:25Z","timestamp":1675537585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24866-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031248658","9783031248665"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24866-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"5 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milos Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"5 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion16.sba-research.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"36","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":"3","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":"60% - 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":"2","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}