{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T21:34:38Z","timestamp":1780695278108,"version":"3.54.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030535513","type":"print"},{"value":"9783030535520","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53552-0_22","type":"book-chapter","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:50:23Z","timestamp":1595004623000},"page":"216-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach"],"prefix":"10.1007","author":[{"given":"Adil","family":"El Mesaoudi-Paul","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitri","family":"Wei\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viktor","family":"Bengs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Tierney","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"22_CR1","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Samulowitz, H., Sellmann, M., Tierney, K.: Model-based genetic algorithms for algorithm configuration. In: IJCAI (2015)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: International Conference on Principles and Practice of Constraint Programming (CP), pp. 142\u2013157 (2009)","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"22_CR3","unstructured":"Audemard, G.: Glucose and syrup in the SAT race 2015. In: SAT Competition 2015 (2015)"},{"key":"22_CR4","unstructured":"Balafrej, A., Bessiere, C., Paparrizou, A.: Multi-armed bandits for adaptive constraint propagation. In: IJCAI (2015)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Sandholm, T., Vitercik, E.: Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. arXiv preprint arXiv:1905.10819 (2019)","DOI":"10.1609\/aaai.v34i04.5721"},{"key":"22_CR6","unstructured":"Bengs, V., H\u00fcllermeier, E.: Preselection Bandits under the Plackett-Luce model. arXiv preprint arXiv:1907.06123 (2019)"},{"key":"22_CR7","unstructured":"Biedenkapp, A., Bozkurt, H.F., Eimer, T., Hutter, F., Lindauer, M.: Dynamic algorithm configuration: foundation of a new meta-algorithmic framework. In: ECAI (2020)"},{"key":"22_CR8","unstructured":"Biere, A.: CaDiCaL at the SAT race 2019. In: SAT Race 2019 - Solver and Benchmark Descriptions, p. 2 (2018)"},{"key":"22_CR9","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Conference on Genetic and Evolutionary Computation (GECCO), pp. 11\u201318 (2002)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-02538-9_13","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"M Birattari","year":"2010","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-Race and iterated F-Race: an overview. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 311\u2013336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9_13"},{"key":"22_CR11","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":"22_CR12","unstructured":"Busa-Fekete, R., H\u00fcllermeier, E., El Mesaoudi-Paul, A.: Preference-Based Online Learning with Dueling Bandits: A Survey. arXiv preprint arXiv:1807.11398 (2018)"},{"key":"22_CR13","unstructured":"Cheng, W., H\u00fcllermeier, E., Dembczynski, K.: Label ranking methods based on the Plackett-Luce model. In: ICML, pp. 215\u2013222 (2010)"},{"key":"22_CR14","unstructured":"Cicirello, V.A., Smith, S.F.: The max k-armed bandit: a new model of exploration applied to search heuristic selection. In: AAAI (2005)"},{"key":"22_CR15","unstructured":"El Mesaoudi-Paul, A., Bengs, V., H\u00fcllermeier, E.: Online preselection with context information under the Plackett-Luce model. arXiv preprint arXiv:2002.04275 (2020)"},{"key":"22_CR16","unstructured":"Fitzgerald, T., Malitsky, Y., O\u2019Sullivan, B.J.: ReACTR: realtime algorithm configuration through tournament rankings. In: IJCAI (2015)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Fitzgerald, T., Malitsky, Y., O\u2019Sullivan, B.J., Tierney, K.: ReACT: real-time algorithm configuration through tournaments. In: Annual Symposium on Combinatorial Search (SoCS) (2014)","DOI":"10.1007\/978-3-319-11230-5_3"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Krohmer, A., Rothenberger, R., Sutton, A.: Phase transitions for scale-free SAT formulas. In: AAAI, pp. 3893\u20133899 (2017)","DOI":"10.1609\/aaai.v31i1.11133"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10472-011-9228-z","volume":"61","author":"M Gagliolo","year":"2011","unstructured":"Gagliolo, M., Schmidhuber, J.: Algorithm portfolio selection as a bandit problem with unbounded losses. Ann. Math. Artif. Intell. 61, 49\u201386 (2011). https:\/\/doi.org\/10.1007\/s10472-011-9228-z","journal-title":"Ann. Math. Artif. Intell."},{"key":"22_CR20","unstructured":"Gir\u00e1ldez-Cru, J., Levy, J.: A modularity-based random SAT instances generator. In: IJCAI, pp. 1952\u20131958 (2015)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-33460-3_12","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"S Guo","year":"2012","unstructured":"Guo, S., Sanner, S., Graepel, T., Buntine, W.: Score-based Bayesian skill learning. In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012. LNCS (LNAI), vol. 7523, pp. 106\u2013121. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33460-3_12"},{"key":"22_CR22","unstructured":"Hoffman, M.D., Brochu, E., de Freitas, N.: Portfolio allocation for Bayesian optimization. In: UAI (2010)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: LION, pp. 507\u2013523 (2011)","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"22_CR24","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)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"22_CR26","unstructured":"IBM: CIBM ILOG CPLEX Optimization Studio: CPLEX User\u2019s Manual (2016). https:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.7.0\/ilog.odms.studio.help\/pdf\/usrcplex.pdf"},{"key":"22_CR27","unstructured":"Jamieson, K.G., Talwalkar, A.: Non-stochastic best arm identification and hyperparameter optimization. In: AISTATS, pp. 240\u2013248 (2016)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Leyton-Brown, K., Lucier, B.: Efficiency through procrastination: approximately optimal algorithm configuration with runtime guarantees. In: IJCAI, vol. 3, p. 1 (2017)","DOI":"10.24963\/ijcai.2017\/281"},{"issue":"1","key":"22_CR29","first-page":"6765","volume":"18","author":"L Li","year":"2017","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., Talwalkar, A.: Hyperband: a novel bandit-based approach to hyperparameter optimization. J. Mach. Learn. Res. 18(1), 6765\u20136816 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"22_CR30","volume-title":"Individual Choice Behavior: A Theoretical Analysis","author":"RD Luce","year":"1959","unstructured":"Luce, R.D.: Individual Choice Behavior: A Theoretical Analysis. Wiley, Hoboken (1959)"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Sellmann, M.: Instance-specific algorithm configuration as a method for non-model-based portfolio generation. In: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR) (2012)","DOI":"10.1007\/978-3-642-29828-8_16"},{"key":"22_CR32","unstructured":"Maron, O., Moore, A.W.: Hoeffding races: accelerating model selection search for classification and function approximation. In: NIPS, pp. 59\u201366 (1993)"},{"key":"22_CR33","unstructured":"Phillips, M., Narayanan, V., Aine, S., Likhachev, M.: Efficient search with an ensemble of heuristics. In: IJCAI (2015)"},{"key":"22_CR34","unstructured":"Plackett, R.: The analysis of Permutations. J. Roy. Stat. Soc. Ser. C (Appl. Stat.) 24(1), 193\u2013202 (1975)"},{"key":"22_CR35","unstructured":"Santos, H., Toffolo, T.: Python MIP: Modeling Examples (2018\u20132019). https:\/\/engineering.purdue.edu\/~mark\/puthesis\/faq\/cite-url\/ . Accessed 23 Jan 2020"},{"issue":"5","key":"22_CR36","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s10994-017-5694-9","volume":"107","author":"D Sch\u00e4fer","year":"2018","unstructured":"Sch\u00e4fer, D., H\u00fcllermeier, E.: Dyad ranking using Plackett-Luce models based on joint feature representations. Mach. Learn. 107(5), 903\u2013941 (2018). https:\/\/doi.org\/10.1007\/s10994-017-5694-9","journal-title":"Mach. Learn."},{"key":"22_CR37","unstructured":"Shang, X., Kaufmann, E., Valko, M.: A simple dynamic bandit algorithm for hyper-parameter tuning. In: Workshop on Automated Machine Learning at ICML, June 2019"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"St-Pierre, D.L., Teytaud, O.: The Nash and the bandit approaches for adversarial portfolios. In: IEEE Conference on Computational Intelligence and Games, pp. 1\u20137 (2014)","DOI":"10.1109\/CIG.2014.6932897"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Tavakol, M., Mair, S., Morik, K.: HyperUCB: hyperparameter optimization using contextual bandits (2019)","DOI":"10.1007\/978-3-030-43823-4_4"},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"Wang, J., Tropper, C.: Optimizing time warp simulation with reinforcement learning techniques. In: Winter Simulation Conference, pp. 577\u2013584 (2007)","DOI":"10.1109\/WSC.2007.4419650"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Yue, Y., Joachims, T.: Interactively optimizing information retrieval systems as a dueling bandits problem. In: Proceedings of International Conference on Machine Learning (ICML), pp. 1201\u20131208 (2009)","DOI":"10.1145\/1553374.1553527"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53552-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T05:02:08Z","timestamp":1667451728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53552-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030535513","9783030535520"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53552-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 July 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION14\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}