{"series_title":"GECCO’23","status":"public","date_created":"2023-11-14T15:58:57Z","abstract":[{"lang":"eng","text":"Quality diversity (QD) is a branch of evolutionary computation that gained increasing interest in recent years. The Map-Elites QD approach defines a feature space, i.e., a partition of the search space, and stores the best solution for each cell of this space. We study a simple QD algorithm in the context of pseudo-Boolean optimisation on the \"number of ones\" feature space, where the ith cell stores the best solution amongst those with a number of ones in [(i - 1)k, ik - 1]. Here k is a granularity parameter 1 {$\\leq$} k {$\\leq$} n+1. We give a tight bound on the expected time until all cells are covered for arbitrary fitness functions and for all k and analyse the expected optimisation time of QD on OneMax and other problems whose structure aligns favourably with the feature space. On combinatorial problems we show that QD finds a (1 - 1/e)-approximation when maximising any monotone sub-modular function with a single uniform cardinality constraint efficiently. Defining the feature space as the number of connected components of a connected graph, we show that QD finds a minimum spanning tree in expected polynomial time."}],"place":"New York, NY, USA","doi":"10.1145/3583131.3590383","_id":"48872","language":[{"iso":"eng"}],"title":"Runtime Analysis of Quality Diversity Algorithms","publisher":"Association for Computing Machinery","keyword":["quality diversity","runtime analysis"],"extern":"1","type":"conference","page":"1546–1554","date_updated":"2023-12-13T10:48:26Z","author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979","first_name":"Jakob"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"}],"year":"2023","user_id":"102979","citation":{"ieee":"J. Bossek and D. Sudholt, “Runtime Analysis of Quality Diversity Algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2023, pp. 1546–1554, doi: 10.1145/3583131.3590383.","short":"J. Bossek, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2023, pp. 1546–1554.","chicago":"Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity Algorithms.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1546–1554. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023. https://doi.org/10.1145/3583131.3590383.","apa":"Bossek, J., & Sudholt, D. (2023). Runtime Analysis of Quality Diversity Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, 1546–1554. https://doi.org/10.1145/3583131.3590383","bibtex":"@inproceedings{Bossek_Sudholt_2023, place={New York, NY, USA}, series={GECCO’23}, title={Runtime Analysis of Quality Diversity Algorithms}, DOI={10.1145/3583131.3590383}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2023}, pages={1546–1554}, collection={GECCO’23} }","mla":"Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity Algorithms.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2023, pp. 1546–1554, doi:10.1145/3583131.3590383.","ama":"Bossek J, Sudholt D. Runtime Analysis of Quality Diversity Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO’23. Association for Computing Machinery; 2023:1546–1554. doi:10.1145/3583131.3590383"},"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","publication_identifier":{"isbn":["9798400701191"]},"department":[{"_id":"819"}]}