paper-with-me

Papers

Fitness-based Linkage Learning and Maximum-Clique Conditional Linkage Modelling for Gray-box Optimization with RV-GOMEA

2024-02-16 · Georgios Andreadis, Tanja Alderliesten, Peter A. N. Bosman

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 GOMEA (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.

📄 PDF Abstract BibTeX arXiv:2402.10757

Code (1)

gandreadis/conditional-rv-gomea 공식 구현

Similar Papers 제목 키워드 기반

Analysis of Evolutionary Algorithms on Fitness Function with Time-linkage Property

2020-04-26 · Weijie Zheng, Huanhuan Chen, Xin Yao

In real-world applications, many optimization problems have the time-linkage property, that is, the objective function value relies on the current solution as well as the historical solutions. Although the rigorous theor…

Evolutionary Algorithms

Benchmarking Minimax Linkage

2019-06-07 · Xiao Hui Tai, Kayla Frisoli

Minimax linkage was first introduced by Ao et al. [3] in 2004, as an alternative to standard linkage methods used in hierarchical clustering. Minimax linkage relies on distances to a prototype for each cluster; this prot…

BenchmarkingClustering

Introns and Templates Matter: Rethinking Linkage in GP-GOMEA

2026-02-02 · Johannes Koch, Tanja Alderliesten, Peter A. N. Bosman arxiv

GP-GOMEA is among the state-of-the-art for symbolic regression, especially when it comes to finding small and potentially interpretable solutions. A key mechanism employed in any GOMEA variant is the exploitation of link…

Revisiting the probabilistic method of record linkage

2019-11-05 · Abel Dasylva, Arthur Goussanou, David Ajavon, Hanan Abousaleh

In theory, the probabilistic linkage method provides two distinct advantages over non-probabilistic methods, including minimal rates of linkage error and accurate measures of these rates for data users. However, implemen…

Blocking

Evolution with recombination as a Metropolis-Hastings sampling procedure

2022-11-09 · Jenny M. Poulton, Lee Altenberg, Chris Watkins

This work presents a population genetic model of evolution, which includes haploid selection, mutation, recombination, and drift. The mutation-selection equilibrium can be expressed exactly in closed form for arbitrary f…