Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization.
Saved in:
| Title: | Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization. |
|---|---|
| Authors: | Santoni, Maria Laura1 (AUTHOR) maria-laura.santoni@lip6.fr, Raponi, Elena2 (AUTHOR) e.raponi@liacs.leidenuniv.nl, Neumann, Aneta3 (AUTHOR) aneta.neumann@adelaide.edu.au, Neumann, Frank3 (AUTHOR) frank.neumann@adelaide.edu.au, Preuss, Mike2 (AUTHOR) m.preuss@liacs.leidenuniv.nl, Doerr, Carola1 (AUTHOR) carola.doerr@lip6.fr |
| Source: | Evolutionary Computation. Summer 2026, Vol. 34 Issue 2, p213-233. 21p. |
| Subjects: | Subset selection, Heuristic, Metaheuristic algorithms, Statistical sampling, Mathematical optimization, Excellence |
| Abstract: | In real-world applications, users often favor structurally diverse design choices over one high-quality solution. It is therefore important to consider more solutions that decision makers can compare and further explore based on additional criteria. Alongside the existing approaches of evolutionary diversity optimization, quality diversity, and multimodal optimization, this paper presents a fresh perspective on this challenge by considering the problem of identifying a fixed number of solutions with a pairwise distance above a specified threshold while maximizing their average quality. We obtain first insight into these objectives by performing a subset selection on the search trajectories of different well-established search heuristics, whether they have been specifically designed with diversity in mind or not. We emphasize that the main goal of our work is not to present a new algorithm but to understand the capability of off-the-shelf algorithms to quantify the trade-off between the minimum pairwise distance within batches of solutions and their average quality. We also analyze how this trade-off depends on the properties of the underlying optimization problem. A possibly surprising outcome of our empirical study is the observation that naive uniform random sampling establishes a very strong baseline for our problem, hardly ever outperformed by the search trajectories of the considered heuristics. We interpret these results as a motivation to develop algorithms tailored to produce diverse solutions of high average quality. [ABSTRACT FROM AUTHOR] |
| Copyright of Evolutionary Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
