Probabilistic Grammars for Equation Discovery
Preprint
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Combinatorial search for selecting the structure of models of dynamical systems with equation discoveryEngineering Applications of Artificial Intelligence, 2020
- Multiple response optimization: Analysis of genetic programming for symbolic regression and assessment of desirability functionsKnowledge-Based Systems, 2019
- Discovering governing equations from data by sparse identification of nonlinear dynamical systemsProceedings of the National Academy of Sciences of the United States of America, 2016
- A Concise Introduction to Languages and Machines2008
- Inductive process modelingMachine Learning, 2007
- A bibliographical study of grammatical inferencePattern Recognition, 2005
- Grammar-guided genetic programming and dimensional consistency: application to non-parametric identification in mechanicsApplied Soft Computing, 2001
- Efficient Global Optimization of Expensive Black-Box FunctionsJournal of Global Optimization, 1998
- Discovery of first-principle equations based on scale-type-based and data-driven reasoningKnowledge-Based Systems, 1998
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 1997