Local Search, Semantics, and Genetic Programming: a Global Analysis

05/26/2023
by   Fabio Anselmi, et al.
0

Geometric Semantic Geometric Programming (GSGP) is one of the most prominent Genetic Programming (GP) variants, thanks to its solid theoretical background, the excellent performance achieved, and the execution time significantly smaller than standard syntax-based GP. In recent years, a new mutation operator, Geometric Semantic Mutation with Local Search (GSM-LS), has been proposed to include a local search step in the mutation process based on the idea that performing a linear regression during the mutation can allow for a faster convergence to good-quality solutions. While GSM-LS helps the convergence of the evolutionary search, it is prone to overfitting. Thus, it was suggested to use GSM-LS only for a limited number of generations and, subsequently, to switch back to standard geometric semantic mutation. A more recently defined variant of GSGP (called GSGP-reg) also includes a local search step but shares similar strengths and weaknesses with GSM-LS. Here we explore multiple possibilities to limit the overfitting of GSM-LS and GSGP-reg, ranging from adaptive methods to estimate the risk of overfitting at each mutation to a simple regularized regression. The results show that the method used to limit overfitting is not that important: providing that a technique to control overfitting is used, it is possible to consistently outperform standard GSGP on both training and unseen data. The obtained results allow practitioners to better understand the role of local search in GSGP and demonstrate that simple regularization strategies are effective in controlling overfitting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2018

Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming

Cartesian Genetic Programming is often used with a point mutation as the...
research
05/25/2018

Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming

For theoretical analyses there are two specifics distinguishing GP from ...
research
06/19/2017

Unsure When to Stop? Ask Your Semantic Neighbors

In iterative supervised learning algorithms it is common to reach a poin...
research
01/28/2021

Stagnation Detection with Randomized Local Search

Recently a mechanism called stagnation detection was proposed that autom...
research
09/06/2011

Application of the Modified 2-opt and Jumping Gene Operators in Multi-Objective Genetic Algorithm to solve MOTSP

Evolutionary Multi-Objective Optimization is becoming a hot research are...
research
04/23/2020

Semantically-Oriented Mutation Operator in Cartesian Genetic Programming for Evolutionary Circuit Design

Despite many successful applications, Cartesian Genetic Programming (CGP...
research
12/17/2004

Artificial Neoteny in Evolutionary Image Segmentation

Neoteny, also spelled Paedomorphosis, can be defined in biological terms...

Please sign up or login with your details

Forgot password? Click here to reset