On the Genotype Compression and Expansion for Evolutionary Algorithms in the Continuous Domain

05/24/2021
by   Lucija Planinic, et al.
0

This paper investigates the influence of genotype size on evolutionary algorithms' performance. We consider genotype compression (where genotype is smaller than phenotype) and expansion (genotype is larger than phenotype) and define different strategies to reconstruct the original variables of the phenotype from both the compressed and expanded genotypes. We test our approach with several evolutionary algorithms over three sets of optimization problems: COCO benchmark functions, modeling of Physical Unclonable Functions, and neural network weight optimization. Our results show that genotype expansion works significantly better than compression, and in many scenarios, outperforms the original genotype encoding. This could be attributed to the change in the genotype-phenotype mapping introduced with the expansion methods: this modification beneficially transforms the domain landscape and alleviates the search space traversal.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/22/2018

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments

Many real-world optimization problems occur in environments that change ...
04/21/2020

A Novel Graphic Bending Transformation on Benchmark

Classical benchmark problems utilize multiple transformation techniques ...
06/28/2012

Piecewise Linear Topology, Evolutionary Algorithms, and Optimization Problems

Schemata theory, Markov chains, and statistical mechanics have been used...
03/28/2017

Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms

In this paper we systematically study the importance, i.e., the influenc...
03/31/2021

A Framework for Knowledge Integrated Evolutionary Algorithms

One of the main reasons for the success of Evolutionary Algorithms (EAs)...
10/27/2018

Average Convergence Rate of Evolutionary Algorithms II: Continuous Optimization

A good convergence metric must satisfy two requirements: feasible in cal...
04/08/2022

Reproducibility and Baseline Reporting for Dynamic Multi-objective Benchmark Problems

Dynamic multi-objective optimization problems (DMOPs) are widely accepte...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.