2024-07-14
Fitness-based linkage learning and maximum-clique conditional linkage modelling for gray-box optimization with RV-GOMEA
Publication
Publication
For many real-world optimization problems it is possible to perform partial evaluations, meaning that the impact of changing a few variables on a solution's fitness can be computed very efficiently. It has been shown that such partial evaluations can be excellently leveraged by the Real-Valued Gene-pool Optimal Mixing Evolutionary Algorithm (RV-GOMEA) that uses a linkage model to capture dependencies between problem variables. Recently, conditional linkage models were introduced for RV-GOMEA, expanding its state-of-the-art performance even to problems with overlapping dependencies. However, that work assumed that the dependency structure is known a priori. Fitness-based linkage learning techniques have previously been used to detect dependencies during optimization, but only for non-conditional linkage models. In this work, we combine fitness-based linkage learning and conditional linkage modelling in RV-GOMEA. In addition, we propose a new way to model overlapping dependencies in conditional linkage models to maximize the joint sampling of fully interdependent groups of variables. We compare the resulting novel variant of RV-GOMEA to other variants of RV-GOMEA and VkD-CMA on 12 problems with varying degree of overlapping dependencies. We find that the new RV-GOMEA not only performs best on most problems, also the overhead of learning the conditional linkage models during optimization is often negligible.
Additional Metadata | |
---|---|
, , | |
doi.org/10.1145/3638529.3654103 | |
GECCO 2024 - Proceedings of the 2024 Genetic and Evolutionary Computation Conference | |
Genetic and Evolutionary Computation Conference, GECCO '24 | |
Andreadis, G., Alderliesten, T., & Bosman, P. (2024). Fitness-based linkage learning and maximum-clique conditional linkage modelling for gray-box optimization with RV-GOMEA. In GECCO 2024 - Proceedings of the 2024 Genetic and Evolutionary Computation Conference (pp. 647–655). doi:10.1145/3638529.3654103 |