{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/data-efficient-exploration-optimization-and","title":"Data-Efficient Exploration, Optimization, and Modeling of Diverse Designs through Surrogate-Assisted Illumination","arxiv_id":"1702.03713","date":"2017-02-13","proceeding":null,"authors":["Adam Gaier","Alexander Asteroth","Jean-Baptiste Mouret"],"abstract":"The MAP-Elites algorithm produces a set of high-performing solutions that\nvary according to features defined by the user. This technique has the\npotential to be a powerful tool for design space exploration, but is limited by\nthe need for numerous evaluations. The Surrogate-Assisted Illumination\nalgorithm (SAIL), introduced here, integrates approximative models and\nintelligent sampling of the objective function to minimize the number of\nevaluations required by MAP-Elites.\n  The ability of SAIL to efficiently produce both accurate models and diverse\nhigh performing solutions is illustrated on a 2D airfoil design problem. The\nsearch space is divided into bins, each holding a design with a different\ncombination of features. In each bin SAIL produces a better performing solution\nthan MAP-Elites, and requires several orders of magnitude fewer evaluations.\nThe CMA-ES algorithm was used to produce an optimal design in each bin: with\nthe same number of evaluations required by CMA-ES to find a near-optimal\nsolution in a single bin, SAIL finds solutions of similar quality in every bin.","url_abs":"http://arxiv.org/abs/1702.03713v2","url_pdf":"http://arxiv.org/pdf/1702.03713v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"data-efficient-exploration-optimization-and","repo_url":"https://github.com/agaier/sail_gecco2017","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"data-efficient-exploration-optimization-and","repo_url":"https://github.com/JanKruska/sail","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"data-efficient-exploration-optimization-and","repo_url":"https://github.com/Sascha0912/SAIL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"data-efficient-exploration-optimization-and","repo_url":"https://github.com/agaier/sail","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"efficient-exploration","task_name":"Efficient Exploration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}