Exhaustive Symbolic Regression Function Sets

  • Deaglan J. Bartlett (Creator)
  • Harry Desmond (Creator)
  • Pedro G. Ferreira (Creator)



ESR (Exhaustive Symbolic Regression) is a symbolic regression algorithm which efficiently and systematically finds all possible equations at fixed complexity (defined to be the number of nodes in its tree representation) given a set of basis functions. This is achieved by identifying the unique equations, so that one minimises the number of equations which one would have to fit to data. Here we provide the functions generated, the unique equations, and the mappings between all equations and unique ones using different sets of basis functions. These are: "core_maths": \(\{x, a, {\rm inv}, +, -, \times, \div, {\rm pow} \}\) "ext_maths": \(\{x, a, {\rm inv}, \sqrt{\cdot}, {\rm square}, \exp, +, -, \times, \div, {\rm pow} \}\) "base_e_maths": \(\{x, a, {\rm inv}, \exp, \log, \exp, +, -, \times, \div, {\rm pow} \}\) where \(x\) is the input variable and \(a\) denotes a constant. One can fit these functions to a data set of interest by using the ESR package.
Date made available10 Apr 2024

Cite this