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

07/22/2021
by   Bogdan Burlacu, et al.
0

We introduce in this paper a runtime-efficient tree hashing algorithm for the identification of isomorphic subtrees, with two important applications in genetic programming for symbolic regression: fast, online calculation of population diversity and algebraic simplification of symbolic expression trees. Based on this hashing approach, we propose a simple diversity-preservation mechanism with promising results on a collection of symbolic regression benchmark problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2019

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

Diversity represents an important aspect of genetic programming, being d...
research
07/12/2017

P-Tree Programming

We propose a novel method for automatic program synthesis. P-Tree Progra...
research
09/14/2022

Prediction Intervals and Confidence Regions for Symbolic Regression Models based on Likelihood Profiles

Symbolic regression is a nonlinear regression method which is commonly p...
research
04/22/2022

End-to-end symbolic regression with transformers

Symbolic regression, the task of predicting the mathematical expression ...
research
05/16/2017

Ensemble of heterogeneous flexible neural trees using multiobjective genetic programming

Machine learning algorithms are inherently multiobjective in nature, whe...
research
03/13/2018

Glyph: Symbolic Regression Tools

We present Glyph - a Python package for genetic programming based symbol...

Please sign up or login with your details

Forgot password? Click here to reset