A Surrogate-Assisted Variable Grouping Algorithm for General Large Scale Global Optimization Problems
Problem decomposition plays a vital role when applying cooperative coevolution (CC) to large scale global optimization problems. However, most learning-based decomposition algorithms either only apply to additively separable problems or face the issue of false separability detections. Directing against these limitations, this study proposes a novel decomposition algorithm called surrogate-assisted variable grouping (SVG). SVG first designs a general-separability-oriented detection criterion according to whether the optimum of a variable changes with other variables. This criterion is consistent with the separability definition and thus endows SVG with broad applicability and high accuracy. To reduce the fitness evaluation requirement, SVG seeks the optimum of a variable with the help of a surrogate model rather than the original expensive high-dimensional model. Moreover, it converts the variable grouping process into a dynamic-binary-tree search one, which facilitates reutilizing historical separability detection information and thus reducing detection times. To evaluate the performance of SVG, a suite of benchmark functions with up to 2000 dimensions, including additively and non-additively separable ones, were designed. Experimental results on these functions indicate that, compared with six state-of-the-art decomposition algorithms, SVG possesses broader applicability and competitive efficiency. Furthermore, it can significantly enhance the optimization performance of CC.
Code (0)
등록된 구현이 없습니다.
Tasks
global-optimizationProblem DecompositionSimilar Papers 제목 키워드 기반
Surrogate Assisted Evolutionary Algorithm for Medium Scale Expensive Multi-Objective Optimisation Problems
Building a surrogate model of an objective function has shown to be effective to assist evolutionary algorithms (EAs) to solve real-world complex optimisation problems which involve either computationally expensive numer…
Evolutionary AlgorithmsA RankNet-Inspired Surrogate-Assisted Hybrid Metaheuristic for Expensive Coverage Optimization
Coverage optimization generally involves deploying a set of facilities to best satisfy the demands of specified points, with broad applications in fields such as location science and sensor networks. Recent applications …
Evolutionary AlgorithmsWhen stakes are high: balancing accuracy and transparency with Model-Agnostic Interpretable Data-driven suRRogates
Highly regulated industries, like banking and insurance, ask for transparent decision-making algorithms. At the same time, competitive markets are pushing for the use of complex black box models. We therefore present a p…
Decision MakingFeature EngineeringVariable SelectionConcept Tree: High-Level Representation of Variables for More Interpretable Surrogate Decision Trees
Interpretable surrogates of black-box predictors trained on high-dimensional tabular datasets can struggle to generate comprehensible explanations in the presence of correlated variables. We propose a model-agnostic inte…
Data-efficient Neuroevolution with Kernel-Based Surrogate Models
Surrogate-assistance approaches have long been used in computationally expensive domains to improve the data-efficiency of optimization algorithms. Neuroevolution, however, has so far resisted the application of these te…
Diversity