{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T04:16:12Z","timestamp":1782879372880,"version":"3.54.5"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581114","type":"print"},{"value":"9783030581121","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-58112-1_7","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"95-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Model-Based Algorithm Configuration with Default-Guided Probabilistic Sampling"],"prefix":"10.1007","author":[{"given":"Marie","family":"Anastacio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Hoos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-642-15396-9_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"K Ahmadizadeh","year":"2010","unstructured":"Ahmadizadeh, K., Dilkina, B., Gomes, C.P., Sabharwal, A.: An empirical study of optimization for maximizing diffusion in networks. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 514\u2013521. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15396-9_41"},{"key":"7_CR2","unstructured":"Anastacio, M., Luo, C., Hoos, H.: Exploitation of default parameter values in automated algorithm configuration. In: Workshop Data Science Meets Optimisation (DSO), IJCAI 2019, August 2019"},{"key":"7_CR3","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Samulowitz, H., Sellmann, M., Tierney, K.: Model-based genetic algorithms for algorithm configuration. In: Proceedings of the IJCAI 2015, pp. 733\u2013739 (2015)"},{"key":"7_CR4","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04244-7_14"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A., Mu\u00f1oz, J.C.: A study of the lot-sizing polytope. Math. Program. 99(3), 443\u2013465 (2004). \nhttps:\/\/doi.org\/10.1007\/s10107-003-0465-8","journal-title":"Math. Program."},{"key":"7_CR6","unstructured":"Balint, A., Manthey, N.: SparrowToRiss. In: Proceedings of the SAT Competition 2014, pp. 77\u201378 (2014)"},{"key":"7_CR7","unstructured":"Biere, A.: Yet another local search solver and lingeling and friends entering the SAT competition 2014 (2014)"},{"key":"7_CR8","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02538-9_13"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-14186-7_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"R Brummayer","year":"2010","unstructured":"Brummayer, R., Lonsing, F., Biere, A.: Automated testing and debugging of SAT and QBF solvers. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 44\u201357. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14186-7_6"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-69404-7_17","volume-title":"Learning and Intelligent Optimization","author":"LP C\u00e1ceres","year":"2017","unstructured":"C\u00e1ceres, L.P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Hoos, H., St\u00fctzle, T.: An experimental study of adaptive capping in irace. In: Battiti, R., Kvasov, D.E., Sergeyev, Y.D. (eds.) LION 2017. LNCS, vol. 10556, pp. 235\u2013250. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69404-7_17"},{"key":"7_CR11","unstructured":"Domhan, T., Springenberg, J.T., Hutter, F.: Speeding up automatic hyperparameter optimization of deep neural networks by extrapolation of learning curves. In: Yang, Q., Wooldridge, M.J. (eds.) IJCAI 2015, pp. 3460\u20133468. AAAI Press (2015)"},{"key":"7_CR12","unstructured":"Fawcett, C., Helmert, M., Hoos, H., Karpas, E., R\u00f6ger, G., Seipp, J.: FD-Autotune: domain-specific configuration using fast downward. In: Proceedings of the ICAPS Workshop, PAL 2011, pp. 13\u201320 (2011)"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10732-014-9275-9","volume":"22","author":"C Fawcett","year":"2015","unstructured":"Fawcett, C., Hoos, H.H.: Analysing differences between algorithm configurations through ablation. J. Heuristics 22(4), 431\u2013458 (2015). \nhttps:\/\/doi.org\/10.1007\/s10732-014-9275-9","journal-title":"J. Heuristics"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187\u2013188","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187\u2013188, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1613\/jair.1183","volume":"20","author":"A Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs in LPG. J. Artif. Intell. Res. 20, 239\u2013290 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.artint.2008.01.002","volume":"172","author":"A Gerevini","year":"2008","unstructured":"Gerevini, A., Saetti, A., Serina, I.: An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artif. Intell. 172, 899\u2013944 (2008)","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"7_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/FI-2011-399","volume":"107","author":"A Gerevini","year":"2011","unstructured":"Gerevini, A., Saetti, A., Serina, I.: An empirical analysis of some heuristic features for planning through local search and action graphs. Fundamenta Informaticae 107(2\u20133), 167\u2013197 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68155-7_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"CP Gomes","year":"2008","unstructured":"Gomes, C.P., van Hoeve, W.-J., Sabharwal, A.: Connections in networks: a hybrid approach. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 303\u2013307. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68155-7_27"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.swevo.2011.08.003","volume":"1","author":"M Hauschild","year":"2011","unstructured":"Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Swarm Evol. Comput. 1(3), 111\u2013128 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70\u201380 (2012)","journal-title":"Commun. ACM"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-13520-0_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"F Hutter","year":"2010","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 186\u2013202. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13520-0_23"},{"key":"7_CR23","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"7_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":"7_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.09.006","volume":"243","author":"F Hutter","year":"2017","unstructured":"Hutter, F., Lindauer, M., Balint, A., Bayless, S., Hoos, H.H., Leyton-Brown, K.: The configurable SAT solver challenge (CSSC). Artif. Intell. 243, 1\u201325 (2017)","journal-title":"Artif. Intell."},{"key":"7_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., et al.: 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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09584-4_4"},{"key":"7_CR27","first-page":"25:1","volume":"18","author":"L Kotthoff","year":"2017","unstructured":"Kotthoff, L., Thornton, C., Hoos, H.H., Hutter, F., Leyton-Brown, K.: Auto-WEKA 2.0: automatic model selection and hyperparameter optimization in WEKA. J. Mach. Learn. Res. 18, 25:1\u201325:5 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Jhingran, A., Mackie-Mason, J., Tygar, D.J. (eds.) Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00), Minneapolis, MN, USA, 17\u201320 October 2000, pp. 66\u201376. ACM (2000)","DOI":"10.1145\/352871.352879"},{"key":"7_CR29","unstructured":"Lindauer, M., Hutter, F.: Warmstarting of model-based algorithm configuration. In: Proceedings of the AAAI-18, IAAI-18, and EAAI-18, pp. 1355\u20131362 (2018)"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1240","volume":"20","author":"D Long","year":"2003","unstructured":"Long, D., Fox, M.: The 3rd international planning competition: results and analysis. J. Artif. Intell. Res. 20, 1\u201359 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","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)","journal-title":"Oper. Res. Perspect."},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Luo, C., Hoos, H.H., Cai, S., Lin, Q., Zhang, H., Zhang, D.: Local search with efficient automatic configuration for minimum vertex cover. In: IJCAI-19, pp. 1297\u20131304. International Joint Conferences on Artificial Intelligence Organization (2019)","DOI":"10.24963\/ijcai.2019\/180"},{"key":"7_CR33","unstructured":"Mugrauer, F., Balint, A.: Sat encoded low autocorrelation binary sequence (labs) benchmark description. In: Proceedings of the SAT Competition 2013, pp. 117\u2013118 (2013)"},{"key":"7_CR34","unstructured":"Penberthy, J.S., Weld, D.S.: Temporal planning with continuous change. In: Proceedings of the AAAI-94, vol. 2, pp. 1010\u20131015 (1994)"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-99259-4_22","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"Y Pushak","year":"2018","unstructured":"Pushak, Y., Hoos, H.: Algorithm configuration landscapes: more benign than expected? In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 271\u2013283. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99259-4_22"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Thornton, C., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms. In: The 19th ACM SIGKDD, KDD 2013, pp. 847\u2013855 (2013)","DOI":"10.1145\/2487575.2487629"},{"key":"7_CR37","unstructured":"Vallati, M., Fawcett, C., Gerevini, A., Hoos, H.H., Saetti, A.: Automatic generation of efficient domain-optimized planners from generic parametrized planners. In: Proceedings of the RCRA 2011, pp. 111\u2013123 (2011)"},{"key":"7_CR38","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: Proceedings of the RCRA 2011, pp. 16\u201330 (2011)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:15:16Z","timestamp":1599063316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_7","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":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","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":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","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":"268","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":"99","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":"37% - 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":"3","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":"2.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}