{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:39Z","timestamp":1759638159821,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"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_8","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"111-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Evolving Sampling Strategies for One-Shot Optimization Tasks"],"prefix":"10.1007","author":[{"given":"Jakob","family":"Bossek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Kerschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565984","volume-title":"Irregularities of Distribution","author":"J Beck","year":"1987","unstructured":"Beck, J.: Irregularities of Distribution. Cambridge University Press, Cambridge (1987)"},{"key":"8_CR2","unstructured":"Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. (JMLR) 13, 281\u2013305 (2012). \nhttp:\/\/dl.acm.org\/citation.cfm?id=2188395"},{"key":"8_CR3","unstructured":"Bossek, J., Doerr, C., Kerschke, P., Neumann, A., Neumann, F.: Github repository with project data (2020). \nhttps:\/\/github.com\/jakobbossek\/PPSN2020-oneshot\/"},{"key":"8_CR4","unstructured":"Bousquet, O., Gelly, S., Kurach, K., Teytaud, O., Vincent, D.: Critical hyper-parameters: no random, no cry. arXiv preprint \narXiv:1706.03200\n\n (2017)"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0021-9991(79)90019-6","volume":"33","author":"E Braaten","year":"1979","unstructured":"Braaten, E., Weller, G.: An improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integration. J. Comput. Phys. 33(2), 249\u2013258 (1979)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). \nhttps:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Stone, C.J., Olshen, R.A.: Classification and Regression Trees. Wadsworth & Brooks\/Cole Advanced Books & Software, Monterey (1984). \nhttps:\/\/doi.org\/10.1201\/9781315139470"},{"key":"8_CR8","unstructured":"Carnell, R.: lhs: Latin Hypercube Samples, r package version 1.0.2 (2020). \nhttps:\/\/CRAN.R-project.org\/package=lhs"},{"key":"8_CR9","unstructured":"Cauwet, M., et al.: Fully parallel hyperparameter search: reshaped space-filling. arXiv preprint \narXiv:1910.08406\n\n (2019)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-319-78999-6_29","volume-title":"Handbook of Mathematical Geosciences","author":"J-P Chil\u00e8s","year":"2018","unstructured":"Chil\u00e8s, J.-P., Desassis, N.: Fifty years of Kriging. In: Daya Sagar, B.S., Cheng, Q., Agterberg, F. (eds.) Handbook of Mathematical Geosciences, pp. 589\u2013612. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-78999-6_29"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995). \nhttps:\/\/doi.org\/10.1007\/BF00994018","journal-title":"Mach. Learn."},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.ejor.2011.05.032","volume":"214","author":"K Crombecq","year":"2011","unstructured":"Crombecq, K., Laermans, E., Dhaene, T.: Efficient space-filling and non-collapsing sequential design strategies for simulation-based modeling. Eur. J. Oper. Res. 214(3), 683\u2013696 (2011). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2011.05.032","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1145\/234535.234536","volume":"15","author":"DP Dobkin","year":"1996","unstructured":"Dobkin, D.P., Eppstein, D., Mitchell, D.P.: Computing the discrepancy with applications to supersampling patterns. ACM Trans. Graph. 15, 354\u2013376 (1996)","journal-title":"ACM Trans. Graph."},{"key":"8_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-319-04696-9_10","volume-title":"A Panorama of Discrepancy Theory","author":"C Doerr","year":"2014","unstructured":"Doerr, C., Gnewuch, M., Wahlstr\u00f6m, M.: Calculation of discrepancy measures and applications. In: Chen, W., Srivastav, A., Travaglini, G. (eds.) A Panorama of Discrepancy Theory. LNM, vol. 2107, pp. 621\u2013678. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-04696-9_10"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Doerr, C., Rainville, F.D.: Constructing low star discrepancy point sets with genetic algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), pp. 789\u2013796. ACM (2013). \nhttps:\/\/doi.org\/10.1145\/2463372.2463469","DOI":"10.1145\/2463372.2463469"},{"key":"8_CR16","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. NCS. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44874-8"},{"key":"8_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9780470770801","volume-title":"Engineering Design via Surrogate Modelling - A Practical Guide","author":"AIJ Forrester","year":"2008","unstructured":"Forrester, A.I.J., Sobester, A., Keane, A.J.: Engineering Design via Surrogate Modelling - A Practical Guide. Wiley, Chichester (2008)"},{"issue":"12","key":"8_CR18","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365104","volume":"7","author":"JH Halton","year":"1964","unstructured":"Halton, J.H.: Algorithm 247: radical-inverse quasi-random point sequence. Commun. ACM 7(12), 701\u2013702 (1964). \nhttps:\/\/doi.org\/10.1145\/355588.365104","journal-title":"Commun. ACM"},{"key":"8_CR19","unstructured":"Hansen, N., Auger, A., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. arXiv e-prints \narXiv:1603.08785\n\n (2016)"},{"key":"8_CR20","unstructured":"Hansen, N., Finck, S., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: noiseless functions definitions. Technical report RR-6829, Inria (2009). \nhttps:\/\/hal.inria.fr\/inria-00362633\/document"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02415361","volume":"54","author":"E Hlawka","year":"1961","unstructured":"Hlawka, E.: Funktionen von beschr\u00e4nkter variation in der theorie der gleichverteilung. Ann. Mat. Pura Appl. 54, 325\u2013333 (1961). \nhttps:\/\/doi.org\/10.1007\/BF02415361","journal-title":"Ann. Mat. Pura Appl."},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.jspi.2004.02.014","volume":"134","author":"R Jin","year":"2005","unstructured":"Jin, R., Chen, W., Sudjianto, A.: An efficient algorithm for constructing optimal design of computer experiments. J. Stat. Plan. Infer. 134(1), 268\u2013287 (2005). \nhttps:\/\/doi.org\/10.1016\/j.jspi.2004.02.014","journal-title":"J. Stat. Plan. Infer."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13, 455\u2013492 (1998). \nhttps:\/\/doi.org\/10.1023\/A:1008306431147","journal-title":"J. Global Optim."},{"key":"8_CR24","unstructured":"Koksma, J.F.: Een algemeene stelling uit de theorie der gelijkmatige verdeeling modulo $$1$$. Mathematica B (Zutphen) 11, 7\u201311 (1942\/3)"},{"key":"8_CR25","volume-title":"Uniform Distribution of Sequences","author":"L Kuipers","year":"1974","unstructured":"Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Wiley, New York (1974)"},{"key":"8_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78165-5","volume-title":"Monte Carlo and Quasi-Monte Carlo Sampling","author":"C Lemieux","year":"2009","unstructured":"Lemieux, C.: Monte Carlo and Quasi-Monte Carlo Sampling. Springer, New York (2009). \nhttps:\/\/doi.org\/10.1007\/978-0-387-78165-5"},{"key":"8_CR27","series-title":"Compact Textbooks in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03425-6","volume-title":"Introduction to Quasi-Monte Carlo Integration and Applications","author":"G Leobacher","year":"2014","unstructured":"Leobacher, G., Pillichshammer, F.: Introduction to Quasi-Monte Carlo Integration and Applications. CTM. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-03425-6"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Liu, L.: Could enough samples be more important than better designs for computer experiments? In: Proceedings of Annual Symposium on Simulation (ANSS 2005), pp. 107\u2013115. IEEE (2005). \nhttps:\/\/doi.org\/10.1109\/ANSS.2005.17","DOI":"10.1109\/ANSS.2005.17"},{"key":"8_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"J Matou\u0161ek","year":"2009","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy, 2nd edn. Springer, Berlin (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03942-3","edition":"2"},{"key":"8_CR30","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 21, 239\u2013245 (1979). \nhttp:\/\/www.jstor.org\/stable\/1268522"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2133390.2133393","volume":"22","author":"FD Rainville","year":"2012","unstructured":"Rainville, F.D., Gagn\u00e9, C., Teytaud, O., Laurendeau, D.: Evolutionary optimization of low-discrepancy sequences. ACM Trans. Model. Comput. Simul. 22, 9:1\u20139:25 (2012). \nhttps:\/\/doi.org\/10.1145\/2133390.2133393","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Rapin, J., Gallagher, M., Kerschke, P., Preuss, M., Teytaud, O.: Exploring the MLDA benchmark on the nevergrad platform. In: Proceedings of the 21st Annual Conference on Genetic and Evolutionary Computation (GECCO 2019) Companion, pp. 1888\u20131896. ACM (2019). \nhttps:\/\/doi.org\/10.1145\/3319619.3326830","DOI":"10.1145\/3319619.3326830"},{"key":"8_CR33","unstructured":"Rapin, J., Teytaud, O.: Nevergrad - A Gradient-Free Optimization Platform (2018). \nhttps:\/\/GitHub.com\/FacebookResearch\/Nevergrad"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:15:22Z","timestamp":1599063322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}