A greedy search tree heuristic for symbolic regression

DOI10.1016/J.INS.2018.02.040MaRDI QIDQ2198020zbMATH OpenOpenAlexFDO

Authors Fabrício Olivetti de França

Publication date 8 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.01807

zbMATH Keywords

greedy heuristicregression analysissymbolic regression

Mathematics Subject Classification ID

General nonlinear regression (62J02) Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Abstract: Symbolic Regression tries to find a mathematical expression that describes the relationship of a set of explanatory variables to a measured variable. The main objective is to find a model that minimizes the error and, optionally, that also minimizes the expression size. A smaller expression can be seen as an interpretable model considered a reliable decision model. This is often performed with Genetic Programming which represents their solution as expression trees. The shortcoming of this algorithm lies on this representation that defines a rugged search space and contains expressions of any size and difficulty. These pose as a challenge to find the optimal solution under computational constraints. This paper introduces a new data structure, called Interaction-Transformation (IT), that constrains the search space in order to exclude a region of larger and more complicated expressions. In order to test this data structure, it was also introduced an heuristic called SymTree. The obtained results show evidence that SymTree are capable of obtaining the optimal solution whenever the target function is within the search space of the IT data structure and competitive results when it is not. Overall, the algorithm found a good compromise between accuracy and simplicity for all the generated models.

Recommendations

• A global MINLP approach to symbolic regression
• Enhancing gene expression programming based on space partition and jump for symbolic regression
• Symbolic regression for approximating graph geodetic number
• scientific article; zbMATH DE number 1962041
• scientific article; zbMATH DE number 2087186

Cites work

• Approximation by superpositions of a sigmoidal function
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 2034572 (Why is no real title available?)
• scientific article; zbMATH DE number 1785983 (Why is no real title available?)
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• Regularization and Variable Selection Via the Elastic Net
• Scikit-learn: machine learning in Python

Cited in

(12)

• A global MINLP approach to symbolic regression
• Enhancing gene expression programming based on space partition and jump for symbolic regression
• <b>CONSTRUCTION OF REGRESSION TREES ON INTERVAL-VALUED SYMBOLIC VARIABLES </b>
• Large-scale, time-constrained symbolic regression-classification
• Feature extraction from optimization samples via ensemble based symbolic regression
• scientific article; zbMATH DE number 1962041 (Why is no real title available?)
• scientific article; zbMATH DE number 2087186 (Why is no real title available?)
• Symbolic regression for approximating graph geodetic number
• scientific article; zbMATH DE number 5877344 (Why is no real title available?)
• Discovering interpretable elastoplasticity models via the neural polynomial method enabled symbolic regressions
• Divide and Conquer: A Quick Scheme for Symbolic Regression
• Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Describes a project that uses

Uses Software

• Scikit

This page was built for publication: A greedy search tree heuristic for symbolic regression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198020)