Error Analysis of Elitist Randomized Search Heuristics

3 Sep 2019 Cong Wang Yu Chen Jun He Chengwang Xie

When globally optimal solutions of complicated optimization problems cannot be located by evolutionary algorithms (EAs) in polynomial expected running time, the hitting time/running time analysis is not flexible enough to accommodate the requirement of theoretical study, because sometimes we have no idea on what approximation ratio is available in polynomial expected running time. Thus, it is necessary to propose an alternative routine for the theoretical analysis of EAs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Tasks


Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
Random Search
Hyperparameter Search