Accelerating the Evolutionary Algorithms by Gaussian Process Regression with $ε$-greedy acquisition function
In this paper, we propose a novel method to estimate the elite individual to accelerate the convergence of optimization. Inspired by the Bayesian Optimization Algorithm (BOA), the Gaussian Process Regression (GPR) is applied to approximate the fitness landscape of original problems based on every generation of optimization. And simple but efficient $\epsilon$-greedy acquisition function is employed to find a promising solution in the surrogate model. Proximity Optimal Principle (POP) states that well-performed solutions have a similar structure, and there is a high probability of better solutions existing around the elite individual. Based on this hypothesis, in each generation of optimization, we replace the worst individual in Evolutionary Algorithms (EAs) with the elite individual to participate in the evolution process. To illustrate the scalability of our proposal, we combine our proposal with the Genetic Algorithm (GA), Differential Evolution (DE), and CMA-ES. Experimental results in CEC2013 benchmark functions show our proposal has a broad prospect to estimate the elite individual and accelerate the convergence of optimization.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian OptimizationEvolutionary AlgorithmsGPRregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Adaptive Surrogate-Based Strategy for Accelerating Convergence Speed when Solving Expensive Unconstrained Multi-Objective Optimisation Problems
Multi-Objective Evolutionary Algorithms (MOEAs) have proven effective at solving Multi-Objective Optimisation Problems (MOOPs). However, their performance can be significantly hindered when applied to computationally int…
Towards an Evolvable Cancer Treatment Simulator
The use of high-fidelity computational simulations promises to enable high-throughput hypothesis testing and optimisation of cancer therapies. However, increasing realism comes at the cost of increasing computational req…
Evolutionary AlgorithmsTwo-sample testingAccelerating evolutionary exploration through language model-based transfer learning
Gene expression programming is an evolutionary optimization algorithm with the potential to generate interpretable and easily implementable equations for regression problems. Despite knowledge gained from previous optimi…
Evolutionary AlgorithmsLanguage ModelingLanguage Modellingregression+2Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size
Genetic algorithm (GA) is typically used to solve nonlinear model predictive control's optimization problem. However, the size of the search space in which the GA searches for the optimal control inputs is crucial for it…
Evolutionary AlgorithmsModel Predictive ControlAccelerating Convergence of Stein Variational Gradient Descent via Deep Unfolding
Stein variational gradient descent (SVGD) is a prominent particle-based variational inference method used for sampling a target distribution. SVGD has attracted interest for application in machine-learning techniques suc…
Bayesian InferenceVariational Inference