Symbolic regression

Expression tree as it can be used in symbolic regression to represent a function.

Symbolic regression (SR) is a type of regression analysis that searches the space of mathematical expressions to find the model that best fits a given dataset, both in terms of accuracy and simplicity.

No particular model is provided as a starting point for symbolic regression. Instead, initial expressions are formed by randomly combining mathematical building blocks such as mathematical operators, analytic functions, constants, and state variables. Usually, a subset of these primitives will be specified by the person operating it, but that's not a requirement of the technique. The symbolic regression problem for mathematical functions has been tackled with a variety of methods, including recombining equations most commonly using genetic programming,^[1] as well as more recent methods utilizing Bayesian methods^[2] and neural networks.^[3] Another non-classical alternative method to SR is called Universal Functions Originator (UFO), which has a different mechanism, search-space, and building strategy.^[4] Further methods such as Exact Learning attempt to transform the fitting problem into a moments problem in a natural function space, usually built around generalizations of the Meijer-G function.^[5]

By not requiring a priori specification of a model, symbolic regression isn't affected by human bias, or unknown gaps in domain knowledge. It attempts to uncover the intrinsic relationships of the dataset, by letting the patterns in the data itself reveal the appropriate models, rather than imposing a model structure that is deemed mathematically tractable from a human perspective. The fitness function that drives the evolution of the models takes into account not only error metrics (to ensure the models accurately predict the data), but also special complexity measures,^[6] thus ensuring that the resulting models reveal the data's underlying structure in a way that's understandable from a human perspective. This facilitates reasoning and favors the odds of getting insights about the data-generating system, as well as improving generalisability and extrapolation behaviour by preventing overfitting. Accuracy and simplicity may be left as two separate objectives of the regression—in which case the optimum solutions form a Pareto front—or they may be combined into a single objective by means of a model selection principle such as minimum description length.

It has been proven that symbolic regression is an NP-hard problem, in the sense that one cannot always find the best possible mathematical expression to fit to a given dataset in polynomial time.^[7] Nevertheless, if the sought-for equation is not too complex it is possible to solve the symbolic regression problem exactly by generating every possible function (built from some predefined set of operators) and evaluating them on the dataset in question.^[8]

Difference from classical regression

While conventional regression techniques seek to optimize the parameters for a pre-specified model structure, symbolic regression avoids imposing prior assumptions, and instead infers the model from the data. In other words, it attempts to discover both model structures and model parameters.

This approach has the disadvantage of having a much larger space to search, because not only the search space in symbolic regression is infinite, but there are an infinite number of models which will perfectly fit a finite data set (provided that the model complexity isn't artificially limited). This means that it will possibly take a symbolic regression algorithm longer to find an appropriate model and parametrization, than traditional regression techniques. This can be attenuated by limiting the set of building blocks provided to the algorithm, based on existing knowledge of the system that produced the data; but in the end, using symbolic regression is a decision that has to be balanced with how much is known about the underlying system.

Nevertheless, this characteristic of symbolic regression also has advantages: because the evolutionary algorithm requires diversity in order to effectively explore the search space, the result is likely to be a selection of high-scoring models (and their corresponding set of parameters). Examining this collection could provide better insight into the underlying process, and allows the user to identify an approximation that better fits their needs in terms of accuracy and simplicity.

Benchmarking

SRBench

In 2021, SRBench^[9] was proposed as a large benchmark for symbolic regression. In its inception, SRBench featured 14 symbolic regression methods, 7 other ML methods, and 252 datasets from PMLB. The benchmark intends to be a living project: it encourages the submission of improvements, new datasets, and new methods, to keep track of the state of the art in SR.

SRBench Competition 2022

In 2022, SRBench announced the competition Interpretable Symbolic Regression for Data Science, which was held at the GECCO conference in Boston, MA. The competition pitted nine leading symbolic regression algorithms against each other on a novel set of data problems and considered different evaluation criteria. The competition was organized in two tracks, a synthetic track and a real-world data track.^[10]

Synthetic Track

In the synthetic track, methods were compared according to five properties: re-discovery of exact expressions; feature selection; resistance to local optima; extrapolation; and sensitivity to noise. Rankings of the methods were:

1. QLattice
2. PySR (Python Symbolic Regression)
3. uDSR (Deep Symbolic Optimization)

Real-world Track

In the real-world track, methods were trained to build interpretable predictive models for 14-day forecast counts of COVID-19 cases, hospitalizations, and deaths in New York State. These models were reviewed by a subject expert and assigned trust ratings and evaluated for accuracy and simplicity. The ranking of the methods was:

1. uDSR (Deep Symbolic Optimization)
2. QLattice
3. geneticengine (Genetic Engine)

Non-Standard Methods

Most symbolic regression algorithms prevent combinatorial explosion by implementing evolutionary algorithms that iteratively improve the best-fit expression over many generations. Recently, researchers have proposed algorithms utilizing other tactics in AI.

Silviu-Marian Udrescu and Max Tegmark developed the "AI Feynman" algorithm,^[11][12] which attempts symbolic regression by training a neural network to represent the mystery function, then runs tests against the neural network to attempt to break up the problem into smaller parts. For example, if [math]\displaystyle{ f(x_1, ..., x_i, x_{i+1}, ..., x_n) = g(x_1,..., x_i) + h(x_{i+1},..., x_n) }[/math], tests against the neural network can recognize the separation and proceed to solve for [math]\displaystyle{ g }[/math] and [math]\displaystyle{ h }[/math] separately and with different variables as inputs. This is an example of divide and conquer, which reduces the size of the problem to be more manageable. AI Feynman also transforms the inputs and outputs of the mystery function in order to produce a new function which can be solved with other techniques, and performs dimensional analysis to reduce the number of independent variables involved. The algorithm was able to "discover" 100 equations from The Feynman Lectures on Physics, while a leading software using evolutionary algorithms, Eureqa, solved only 71. AI Feynman, in contrast to classic symbolic regression methods, requires a very large dataset in order to first train the neural network and is naturally biased towards equations that are common in elementary physics.

Software

End-user software

• QLattice is a quantum-inspired simulation and machine learning technology that helps search through an infinite list of potential mathematical models to solve a problem.^[13][14]
• Evolutionary Forest is a Genetic Programming-based automated feature construction algorithm for symbolic regression.^[15][16]
• uDSR is a deep learning framework for symbolic optimization tasks^[17]
• dCGP, differentiable Cartesian Genetic Programming in python (free, open source) ^[18][19]
• HeuristicLab, a software environment for heuristic and evolutionary algorithms, including symbolic regression (free, open source)
• GeneXProTools, - an implementation of Gene expression programming technique for various problems including symbolic regression (commercial)
• Multi Expression Programming X, an implementation of Multi expression programming for symbolic regression and classification (free, open source)
• Eureqa, evolutionary symbolic regression software (commercial), and software library
• TuringBot, symbolic regression software based on simulated annealing (commercial)
• PySR,^[20] symbolic regression environment written in Python and Julia, using regularized evolution, simulated annealing, and gradient-free optimization (free, open source)^[21]
• GP-GOMEA, fast (C++ back-end) evolutionary symbolic regression with Python scikit-learn-compatible interface, achieved one of the best trade-offs between accuracy and simplicity of discovered models on SRBench in 2021 (free, open source)

See also

• Closed-form expression § Conversion from numerical forms
• Genetic programming
• Gene expression programming
• Kolmogorov complexity
• Linear genetic programming
• Mathematical optimization
• Multi expression programming
• Regression analysis
• Reverse mathematics
• Discovery system (AI research)^[3]

References

Further reading

• Mark J. Willis; Hugo G. Hiden; Ben McKay; Gary A. Montague; Peter Marenbach (1997). "Genetic programming: An introduction and survey of applications". IEE. pp. 314–319. http://www.cs.bham.ac.uk/~wbl/biblio/cache/cache/.hidden_13-jun_1525733794/http___www.staff.ncl.ac.uk_d.p.searson_docs_galesia97surveyofGP.pdf. 
• Wouter Minnebo; Sean Stijven (2011). "Chapter 4: Symbolic Regression" (PDF). Empowering Knowledge Computing with Variable Selection (M.Sc. thesis). University of Antwerp.
• John R. Koza; Martin A. Keane; James P. Rice (1993). "Performance improvement of machine learning via automatic discovery of facilitating functions as applied to a problem of symbolic system identification". San Francisco: IEEE. pp. 191–198. http://www.genetic-programming.com/jkpdf/icnn1993impulse.pdf. 

External links

• Ivan Zelinka (2004). "Symbolic regression — an overview". http://www.mafy.lut.fi/EcmiNL/older/ecmi35/node70.html. 
• Hansueli Gerber (1998). "Simple Symbolic Regression Using Genetic Programming". http://alphard.ethz.ch/gerber/approx/default.html.  (Java applet) — approximates a function by evolving combinations of simple arithmetic operators, using algorithms developed by John Koza.
• Katya Vladislavleva. "Symbolic Regression: Function Discovery & More". http://www.symbolicregression.com. 

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Symbolic regression. Read more