iid_ood_mode: if set to "iid", sample uniformly from the support as given by supp; if set to "ood", sample from a larger suppor

Convert a SymPy expression to a prefix one.

Add a new hypothesis to the list.

model_predict is a callable that takes an X of shape (n_datapoints, n_variables) and returns scalar predictions

Convert an infix expression to SymPy.

Prefix to infix conversion.

Remove root constant terms from a non-constant SymPy expression.

Given an equation, returns randomly sampled constants and dummy contants Args: eq: an Equation. cfg: Used for specifying how many and

Parse an expression in prefix mode, and output it in either: - infix mode (returns human readable string) - develop mode

Traverse the tree in post-order fashion and add multiplicative placeholders

Count atom occurrences in an expression.

Single input algorithm as this function is used in multiprocessing

If there are enough hypotheses and that none of the hypotheses being generated can become better than the worst one in the heap, then

called one ecah GPU separately - stage defines if we are at fit or test step

Create a tree with exactly `nb_total_ops` operators.

Parse a SymPy expression given an initial root operator.

Count atom occurrences in an expression.

Evaluate equation `pred_equation` given as a string.

Extract a non-constant sub-tree from an equation.

`max_ops`: maximum number of operators Enumerate the number of possible binary trees that can be generated from empty nodes.

Generate pairs of (function, primitive). Start by generating a random function f, and use SymPy to compute F.

`max_ops`: maximum number of operators Enumerate the number of possible unary-binary trees that can be generated from empty nodes.

Parse all free variables in equations and return them in lexicographic order

Reduce coefficients in an expression. `sqrt(x)*y*sqrt(1/a0)` -> `a0*sqrt(x)*y` `x**(-cos(a0))*y**cos(a0)` -> `x**(-a0)*y**a0`

Remove root constant terms from a non-constant SymPy expression.

Rewrite a SymPy expression.

Sample the position of the next node (unary-binary case). Sample a position in {0, ..., `nb_empty` - 1}, along with an arity.

Simplify an expression.

Simplify expressions with constants and coefficients. `sqrt(10) * a0 * x` -> `a0 * x` `sin(a0 + x + 9/7)` -> `sin(a0 + x)` `a0 + x +

Return the smallest sub-tree in an expression that contains a given symbol.

returns validation dataloader

Infix representation. Convert prefix expressions to a format that SymPy can parse.