{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:48:06Z","timestamp":1757540886321,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030921200"},{"type":"electronic","value":"9783030921217"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92121-7_2","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T17:13:15Z","timestamp":1638983595000},"page":"7-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning to\u00a0Optimize Black-Box Functions with\u00a0Extreme Limits on\u00a0the\u00a0Number of\u00a0Function Evaluations"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Ans\u00f3tegui","sequence":"first","affiliation":[]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[]},{"given":"Tapan","family":"Shah","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Tierney","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"2_CR1","unstructured":"Blackbox BBO Challenge. https:\/\/bbochallenge.com\/. Accessed 12 Mar 2020"},{"key":"2_CR2","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-12767-1_5","volume-title":"Approximation and Optimization","author":"SP Adam","year":"2019","unstructured":"Adam, S.P., Alexandropoulos, S.-A.N., Pardalos, P.M., Vrahatis, M.N.: No free lunch theorem: a review. In: Demetriou, I.C., Pardalos, P.M. (eds.) Approximation and Optimization. SOIA, vol. 145, pp. 57\u201382. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12767-1_5"},{"key":"2_CR3","unstructured":"Ansotegui, C., Malitsky, Y., Samulowitz, H., Sellmann, M., Tierney, K.: Model-based genetic algorithms for algorithm configuration. In: IJCAI, pp. 733\u2013739 (2015)"},{"key":"2_CR4","unstructured":"Ansotegui, C., Pon, J.: PyDGGA. https:\/\/ulog.udl.cat\/"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_14"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-05348-2_27","volume-title":"Learning and Intelligent Optimization","author":"C Ans\u00f3tegui","year":"2019","unstructured":"Ans\u00f3tegui, C., Heymann, B., Pon, J., Sellmann, M., Tierney, K.: Hyper-reactive tabu search for MaxSAT. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P.M. (eds.) LION 12 2018. LNCS, vol. 11353, pp. 309\u2013325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05348-2_27"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Ans\u00f3tegui, C., Pon, J., Sellmann, M.: Boosting evolutionary algorithm configuration. Ann. Math. Artif. Intell. (2021). https:\/\/doi.org\/10.1007\/s10472-020-09726-y","DOI":"10.1007\/s10472-020-09726-y"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Pon, J., Sellmann, M., Tierney, K.: Reactive dialectic search portfolios for MaxSAT. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 31 (2017)","DOI":"10.1609\/aaai.v31i1.10660"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Atkinson, S., Ghosh, S., Chennimalai Kumar, N., Khan, G., Wang, L.: Bayesian task embedding for few-shot Bayesian optimization. In: AIAA Scitech 2020 Forum, p. 1145 (2020)","DOI":"10.2514\/6.2020-1145"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Awad, N.H., Ali, M.Z., Suganthan, P.N.: Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems. In: 2017 IEEE Congress on Evolutionary Computation, pp. 372\u2013379, June 2017","DOI":"10.1109\/CEC.2017.7969336"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck, T., Schwefel, H.P.: An overview of evolutionary algorithms for parameter optimization. Evol. Comput. 1(1), 1\u201323 (1993)","journal-title":"Evol. Comput."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2016","unstructured":"Bischl, B., et al.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2016)","journal-title":"Artif. Intell."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Brest, J., Mau\u010dec, M.S., Bo\u0161kovi\u0107, B.: iL-SHADE: improved L-SHADE algorithm for single objective real-parameter optimization. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 1188\u20131195, July 2016","DOI":"10.1109\/CEC.2016.7743922"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Brest, J., Mau\u010dec, M.S., Bo\u0161kovi\u0107, B.: Single objective real-parameter optimization: algorithm jSO. In: 2017 IEEE Congress on Evolutionary Computation, pp. 1311\u20131318 (2017)","DOI":"10.1109\/CEC.2017.7969456"},{"key":"2_CR15","unstructured":"Cowen-Rivers, A.I., et al.: HEBO: heteroscedastic evolutionary Bayesian optimisation. arXiv preprint arXiv:2012.03826 (2020)"},{"issue":"1\u20132","key":"2_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1 + 1) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00182-7","journal-title":"Theor. Comput. Sci."},{"key":"2_CR17","unstructured":"Eriksson, D., Pearce, M., Gardner, J., Turner, R.D., Poloczek, M.: Scalable global optimization via local Bayesian optimization. In: Advances in Neural Information Processing Systems, pp. 5496\u20135507 (2019)"},{"key":"2_CR18","series-title":"The Springer Series on Challenges in Machine Learning","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-05318-5_1","volume-title":"Automated Machine Learning","author":"M Feurer","year":"2019","unstructured":"Feurer, M., Hutter, F.: Hyperparameter optimization. In: Hutter, F., Kotthoff, L., Vanschoren, J. (eds.) Automated Machine Learning. TSSCML, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05318-5_1"},{"key":"2_CR19","unstructured":"Frazier, P.I.: A tutorial on Bayesian optimization. arXiv preprint arXiv:1807.02811 (2018)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0026589","volume-title":"Artificial Evolution","author":"F Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 1\u201351. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0026589"},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1002\/wics.27","volume":"1","author":"RF Gunst","year":"2009","unstructured":"Gunst, R.F., Mason, R.L.: Fractional factorial design. Wiley Interdisc. Rev. Comput. Stat. 1(2), 234\u2013244 (2009)","journal-title":"Wiley Interdisc. Rev. Comput. Stat."},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"114","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. Methods Softw. 36(1), 114\u2013144 (2020)","journal-title":"Optim. Methods Softw."},{"key":"2_CR23","unstructured":"Hansen, N., Akimoto, Y., Baudis, P.: CMA-ES\/pycma on Github, February 2019. https:\/\/doi.org\/10.5281\/zenodo.2559634"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., M\u00fcller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 11(1), 1\u201318 (2003)","journal-title":"Evol. Comput."},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Head, T., Kumar, M., Nahrstaedt, H., Louppe, G., Shcherbatyi, I.: scikit-optimize\/scikit-optimize, September 2020. https:\/\/doi.org\/10.5281\/zenodo.4014775","DOI":"10.5281\/zenodo.4014775"},{"key":"2_CR26","unstructured":"Lattimore, T., Kveton, B., Li, S., Szepesvari, C.: TopRank: a practical algorithm for online stochastic ranking. arXiv preprint arXiv:1806.02248 (2018)"},{"key":"2_CR27","unstructured":"Liu, J., Tunguz, B., Titericz, G.: GPU accelerated exhaustive search for optimal ensemble of black-box optimization algorithms. arXiv preprint arXiv:2012.04201 (2020)"},{"key":"2_CR28","unstructured":"Lu, T., P\u00e1l, D., P\u00e1l, M.: Contextual multi-armed bandits. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 485\u2013492 (2010)"},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00401706.2000.10485979","volume":"42","author":"MD McKay","year":"2000","unstructured":"McKay, M.D., Beckman, R.J., Conover, W.J.: A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42(1), 55\u201361 (2000)","journal-title":"Technometrics"},{"key":"2_CR30","unstructured":"Mesaoudi-Paul, A.E., Bengs, V., H\u00fcllermeier, E.: Online preselection with context information under the plackett-luce model (2020)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Qin, A.K., Suganthan, P.N.: Self-adaptive differential evolution algorithm for numerical optimization. In: 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1785\u20131791, September 2005","DOI":"10.1109\/CEC.2005.1554904"},{"key":"2_CR32","unstructured":"Ram\u00f3n, D.C.: xKuZz\/pyade, March 2021. https:\/\/github.com\/xKuZz\/pyade. Accessed 05 Oct 2017"},{"key":"2_CR33","series-title":"Medizinische Informatik und Statistik","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-81283-5_8","volume-title":"Simulationsmethoden in der Medizin und Biologie","author":"I Rechenberg","year":"1978","unstructured":"Rechenberg, I.: Evolutionsstrategien. In: Schneider, B., Ranft, U. (eds.) Simulationsmethoden in der Medizin und Biologie. MEDINFO, vol. 8, pp. 83\u2013114. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/978-3-642-81283-5_8"},{"key":"2_CR34","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical Bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems, pp. 2960\u20132968 (2012)"},{"issue":"4","key":"2_CR35","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. Glob. Optim. 11(4), 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Glob. Optim."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.: Success-history based parameter adaptation for differential evolution. In: 2013 IEEE Congress on Evolutionary Computation, Cancun, Mexico, pp. 71\u201378. IEEE, June 2013","DOI":"10.1109\/CEC.2013.6557555"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.S.: Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China, pp. 1658\u20131665. IEEE, July 2014","DOI":"10.1109\/CEC.2014.6900380"},{"key":"2_CR38","unstructured":"Wistuba, M., Grabocka, J.: Few-shot Bayesian optimization with deep kernel surrogates. In: International Conference on Learning Representations (2021). https:\/\/openreview.net\/forum?id=bJxgv5C3sYc"},{"issue":"2","key":"2_CR39","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00158-018-1906-6","volume":"58","author":"P Ye","year":"2018","unstructured":"Ye, P., Pan, G., Dong, Z.: Ensemble of surrogate based global optimization methods using hierarchical design space reduction. Struct. Multidiscip. Optim. 58(2), 537\u2013554 (2018). https:\/\/doi.org\/10.1007\/s00158-018-1906-6","journal-title":"Struct. Multidiscip. Optim."}],"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-030-92121-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T01:02:58Z","timestamp":1726275778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92121-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030921200","9783030921217"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92121-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","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":"Athens","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion15.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","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":"30","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":"86% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}