Probabilistic Grammars for Equation Discovery
arXiv:2012.00428 · doi:10.1016/j.knosys.2021.107077
Abstract
Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, such as context-free grammars, have been used to limit the search spaces in equation discovery by providing hard constraints that specify which equations to consider and which not. In this paper, we propose the use of probabilistic context-free grammars in equation discovery. Such grammars encode soft constraints, specifying a prior probability distribution on the space of possible equations. We show that probabilistic grammars can be used to elegantly and flexibly formulate the parsimony principle, that favors simpler equations, through probabilities attached to the rules in the grammars. We demonstrate that the use of probabilistic, rather than deterministic grammars, in the context of a Monte-Carlo algorithm for grammar-based equation discovery, leads to more efficient equation discovery. Finally, by specifying prior probability distributions over equation spaces, the foundations are laid for Bayesian approaches to equation discovery.
arXiv commentSubmitted to Knowledge-Based Systems, Elsevier. 28 pages + 13 pages appendix. 7 figures
References in corpus (6)
- Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
- Model selection for dynamical systems via sparse regression and information criteria
- A Bayesian machine scientist to aid in the solution of challenging scientific problems
- Toward an AI Physicist for Unsupervised Learning
- AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity
- Meta-Model Framework for Surrogate-Based Parameter Estimation in Dynamical Systems
Cited by in corpus (6)
- Deep symbolic regression for physics guided by units constraints: toward the automated discovery of physical laws
- SymbolicGPT: A Generative Transformer Model for Symbolic Regression
- Efficient Generator of Mathematical Expressions for Symbolic Regression
- Priors for symbolic regression
- Approximating the universal thermal climate index using sparse regression with orthogonal polynomials
- Grammar-based Ordinary Differential Equation Discovery