Bayesian Symbolic Regression

by   Ying Jin, et al.

Interpretability is crucial for machine learning in many scenarios such as quantitative finance, banking, healthcare, etc. Symbolic regression (SR) is a classic interpretable machine learning method by bridging X and Y using mathematical expressions composed of some basic functions. However, the search space of all possible expressions grows exponentially with the length of the expression, making it infeasible for enumeration. Genetic programming (GP) has been traditionally and commonly used in SR to search for the optimal solution, but it suffers from several limitations, e.g. the difficulty in incorporating prior knowledge; overly-complicated output expression and reduced interpretability etc. To address these issues, we propose a new method to fit SR under a Bayesian framework. Firstly, Bayesian model can naturally incorporate prior knowledge (e.g., preference of basis functions, operators and raw features) to improve the efficiency of fitting SR. Secondly, to improve interpretability of expressions in SR, we aim to capture concise but informative signals. To this end, we assume the expected signal has an additive structure, i.e., a linear combination of several concise expressions, whose complexity is controlled by a well-designed prior distribution. In our setup, each expression is characterized by a symbolic tree, and the proposed SR model could be solved by sampling symbolic trees from the posterior distribution using an efficient Markov chain Monte Carlo (MCMC) algorithm. Finally, compared with GP, the proposed BSR(Bayesian Symbolic Regression) method saves computer memory with no need to keep an updated 'genome pool'. Numerical experiments show that, compared with GP, the solutions of BSR are closer to the ground truth and the expressions are more concise. Meanwhile we find the solution of BSR is robust to hyper-parameter specifications such as the number of trees.



There are no comments yet.


page 1

page 2

page 3

page 4


Model-based Genetic Programming with GOMEA for Symbolic Regression of Small Expressions

The Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) has been sho...

GP-RVM: Genetic Programing-based Symbolic Regression Using Relevance Vector Machine

This paper proposes a hybrid basis function construction method (GP-RVM)...

A Model-based Genetic Programming Approach for Symbolic Regression of Small Expressions

The Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) is a model-b...

A Greedy Search Tree Heuristic for Symbolic Regression

Symbolic Regression tries to find a mathematical expression that describ...

Cluster Analysis of a Symbolic Regression Search Space

In this chapter we take a closer look at the distribution of symbolic re...

Stochastic tree ensembles for regularized nonlinear regression

This paper develops a novel stochastic tree ensemble method for nonlinea...

Estimation of Gas Turbine Shaft Torque and Fuel Flow of a CODLAG Propulsion System Using Genetic Programming Algorithm

In this paper, the publicly available dataset of condition based mainten...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.