DeepAI AI Chat
Log In Sign Up

Online Diversity Control in Symbolic Regression via a Fast Hash-based Tree Similarity Measure

by   Bogdan Burlacu, et al.
FH Oberösterreich

Diversity represents an important aspect of genetic programming, being directly correlated with search performance. When considered at the genotype level, diversity often requires expensive tree distance measures which have a negative impact on the algorithm's runtime performance. In this work we introduce a fast, hash-based tree distance measure to massively speed-up the calculation of population diversity during the algorithmic run. We combine this measure with the standard GA and the NSGA-II genetic algorithms to steer the search towards higher diversity. We validate the approach on a collection of benchmark problems for symbolic regression where our method consistently outperforms the standard GA as well as NSGA-II configurations with different secondary objectives.


Hash-Based Tree Similarity and Simplification in Genetic Programming for Symbolic Regression

We introduce in this paper a runtime-efficient tree hashing algorithm fo...

Modified Soft Brood Crossover in Genetic Programming

Premature convergence is one of the important issues while using Genetic...

Evolutionary Landscape and Management of Population Diversity

The search ability of an Evolutionary Algorithm (EA) depends on the vari...

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity

Population diversity is essential for avoiding premature convergence in ...

Linear Combination of Distance Measures for Surrogate Models in Genetic Programming

Surrogate models are a well established approach to reduce the number of...

P-Tree Programming

We propose a novel method for automatic program synthesis. P-Tree Progra...

Ensemble of heterogeneous flexible neural trees using multiobjective genetic programming

Machine learning algorithms are inherently multiobjective in nature, whe...