Estimating Approximation Errors of Elitist Evolutionary Algorithms

09/03/2019
by   Cong Wang, et al.
Wuhan University of Technology
0

When EAs are unlikely to locate precise global optimal solutions with satisfactory performances, it is important to substitute the hitting time/running time analysis with another available theoretical routine. In order to bring theories and applications closer, this paper is dedicated to perform an analysis on approximation error of EAs. First, we proposed a general result on upper bound and lower bound of approximation errors. Then, several case studies are performed to present the routine of error analysis, and consequently, validate its applicability on cases generating transition matrices of various shapes. Meanwhile, the theoretical results also show the close connections between approximation errors and eigenvalues of transition matrices. The analysis validates applicability of error analysis, demonstrates significance of estimation results, and then, exhibits its potential to be applied for theoretical analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/26/2018

A Theoretical Framework of Approximation Error Analysis of Evolutionary Algorithms

In the empirical study of evolutionary algorithms, the solution quality ...
06/10/2016

A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions

Evolutionary algorithms (EAs) are population-based general-purpose optim...
10/03/2022

Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems

Theoretical studies on evolutionary algorithms have developed vigorously...
06/02/2019

Sample-Optimal Low-Rank Approximation of Distance Matrices

A distance matrix A ∈ R^n × m represents all pairwise distances, A_ij=d(...
09/29/2021

Influence of the Binomial Crossover on Performance of Evolutionary Algorithms

In differential Evolution (DE) algorithms, a crossover operation filteri...
06/21/2019

Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools

The expected running time of the classical (1+1) EA on the OneMax benchm...

Please sign up or login with your details

Forgot password? Click here to reset