Probabilistic Grammars for Equation Discovery
- URL: http://arxiv.org/abs/2012.00428v2
- Date: Mon, 22 Mar 2021 10:53:27 GMT
- Title: Probabilistic Grammars for Equation Discovery
- Authors: Jure Brence and Ljup\v{c}o Todorovski and Sa\v{s}o D\v{z}eroski
- Abstract summary: We propose the use of probabilistic context-free grammars in equation discovery.
Probability grammars can be used to elegantly and flexibly formulate the parsimony principle.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Symmetry-Informed Governing Equation Discovery [29.16110821783827]
We propose to leverage symmetry in automated equation discovery to compress the equation search space and improve the accuracy and simplicity of the learned equations.
Our approach demonstrates better robustness against noise and recovers governing equations with significantly higher probability than baselines without symmetry.
arXiv Detail & Related papers (2024-05-27T01:58:23Z) - Towards true discovery of the differential equations [57.089645396998506]
Differential equation discovery is a machine learning subfield used to develop interpretable models.
This paper explores the prerequisites and tools for independent equation discovery without expert input.
arXiv Detail & Related papers (2023-08-09T12:03:12Z) - Comparison of Single- and Multi- Objective Optimization Quality for
Evolutionary Equation Discovery [77.34726150561087]
Evolutionary differential equation discovery proved to be a tool to obtain equations with less a priori assumptions.
The proposed comparison approach is shown on classical model examples -- Burgers equation, wave equation, and Korteweg - de Vries equation.
arXiv Detail & Related papers (2023-06-29T15:37:19Z) - Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning [12.369006238950092]
Symbolic Regression allows for the discovery of scientific equations from data.
There is a mismatch between context-free grammars required to express the set of syntactically correct equations, and a tree structure of the latter.
Our contributions are to (i) compactly express experts' prior beliefs about which equations are more likely to be expected by probabilistic Regular Tree Expressions (pRTE) and (ii) adapt Bayesian inference to make such priors efficiently available for symbolic regression encoded as finite state machines.
arXiv Detail & Related papers (2023-06-14T13:43:44Z) - User-defined Event Sampling and Uncertainty Quantification in Diffusion
Models for Physical Dynamical Systems [49.75149094527068]
We show that diffusion models can be adapted to make predictions and provide uncertainty quantification for chaotic dynamical systems.
We develop a probabilistic approximation scheme for the conditional score function which converges to the true distribution as the noise level decreases.
We are able to sample conditionally on nonlinear userdefined events at inference time, and matches data statistics even when sampling from the tails of the distribution.
arXiv Detail & Related papers (2023-06-13T03:42:03Z) - P(Expression|Grammar): Probability of deriving an algebraic expression
with a probabilistic context-free grammar [0.0]
We show that the problem of calculating the probability of deriving a given expression with a given grammar is undecidable in general.
We then present specific grammars for generating linear, rational, and hyperbolic expressions.
For those grammars, we design algorithms for calculating the exact probability and efficient approximation with arbitrary precision.
arXiv Detail & Related papers (2022-12-01T18:36:54Z) - Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations.
We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation.
We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
arXiv Detail & Related papers (2022-10-15T17:32:49Z) - Learning of Structurally Unambiguous Probabilistic Grammars [7.347989843033034]
We restrict attention to structurally unambiguous weighted context-free grammars (SUWCFG)
We show that SUWCFG can be represented using co-linear multiplicity tree automata (CMTA), and provide a learning algorithm that learns CMTAs.
We demonstrate the usefulness of our algorithm in learning PCFGs over genomic data.
arXiv Detail & Related papers (2020-11-15T08:07:04Z) - Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values.
We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions.
For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
arXiv Detail & Related papers (2020-08-19T16:04:34Z) - The data-driven physical-based equations discovery using evolutionary
approach [77.34726150561087]
We describe the algorithm for the mathematical equations discovery from the given observations data.
The algorithm combines genetic programming with the sparse regression.
It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
arXiv Detail & Related papers (2020-04-03T17:21:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.