Exhaustive symbolic regression

Deaglan Bartlett*, Harry Desmond*, Pedro Ferreira

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Downloads (Pure)

Abstract

Symbolic Regression (SR) algorithms attempt to learn analytic expressions which fit data accurately and in a highly interpretable manner. Conventional SR suffers from two fundamental issues which we address here. First, these methods search the space stochastically (typically using genetic programming) and hence do not necessarily find the best function. Second, the criteria used to select the equation optimally balancing accuracy with simplicity have been variable and subjective. To address these issues we introduce Exhaustive Symbolic Regression (ESR), which systematically and efficiently considers all possible equations—made with a given basis set of operators and up to a specified maximum complexity— and is therefore guaranteed to find the true optimum (if parameters are perfectly optimised) and a complete function ranking subject to these constraints. We implement the minimum description length principle as a rigorous method for combining these preferences into a single objective. To illustrate the power of ESR we apply it to a catalogue of cosmic chronometers and the Pantheon+ sample of supernovae to learn the Hubble rate as a function of redshift, finding 40 functions (out of 5.2 million trial functions) that fit the data more economically than the Friedmann equation. These low-redshift data therefore do not uniquely prefer the expansion history of the standard model of cosmology. We make our code and full equation sets publicly available.
Original languageEnglish
JournalIEEE Transactions on Evolutionary Computation
Early online date26 May 2023
DOIs
Publication statusEarly online - 26 May 2023

Keywords

  • TC_highlight
  • Symbolic regression
  • data analysis
  • minimum description length
  • model selection
  • cosmology
  • UKRI
  • STFC
  • ST/K000373/1
  • ST/P002293/1
  • ST/R002371/1
  • ST/S002502/1
  • ST/K0003259/1
  • ST/R000832/1

Cite this