基于适应度的连锁学习与最大团条件连锁建模在RV-GOMEA灰盒优化中的应用
Fitness-based Linkage Learning and Maximum-Clique Conditional Linkage Modelling for Gray-box Optimization with RV-GOMEA
AI总结:
本文将基于适应度的连锁学习与条件连锁建模结合至RV-GOMEA中,提出最大团重叠依赖建模方法,在12个问题上验证了新变体性能最优且学习开销可忽略。
摘要:
对于许多现实世界的优化问题,可以进行部分评估,这意味着改变少数变量对解的适应度的影响可以非常高效地计算。已有研究表明,这种部分评估可以被Real-Valued GOMEA (RV-GOMEA) 极好地利用,该算法使用连锁模型来捕捉问题变量之间的依赖关系。最近,条件连锁模型被引入RV-GOMEA,将其最先进的性能扩展到了具有重叠依赖关系的问题。然而,该工作假设依赖结构是先验已知的。基于适应度的连锁学习技术此前已被用于在优化过程中检测依赖关系,但仅限于非条件连锁模型。在本工作中,我们将基于适应度的连锁学习和条件连锁建模结合在RV-GOMEA中。此外,我们提出了一种在条件连锁模型中建模重叠依赖关系的新方法,以最大化完全相互依赖的变量组的联合采样。我们将由此得到的新型RV-GOMEA变体与其他RV-GOMEA变体以及VkD-CMA在12个具有不同程度重叠依赖关系的问题上进行了比较。我们发现,新的RV-GOMEA不仅在大多数问题上表现最佳,而且在优化过程中学习条件连锁模型的开销通常可以忽略不计。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。