API Reference¶
PySRRegressor
has many options for controlling a symbolic regression search.
Let's look at them below.
PySRRegressor Parameters¶
The Algorithm¶
Creating the Search Space¶
-
binary_operators
List of strings for binary operators used in the search. See the operators page for more details.
Default:
["+", "-", "*", "/"]
-
unary_operators
Operators which only take a single scalar as input. For example,
"cos"
or"exp"
.Default:
None
-
expression_spec
The type of expression to search for. By default, this is just
ExpressionSpec()
. You can also useTemplateExpressionSpec(...)
which allows you to specify a custom template for the expressions.Default:
ExpressionSpec()
-
maxsize
Max complexity of an equation.
Default:
30
-
maxdepth
Max depth of an equation. You can use both
maxsize
andmaxdepth
.maxdepth
is by default not used.Default:
None
Setting the Search Size¶
-
niterations
Number of iterations of the algorithm to run. The best equations are printed and migrate between populations at the end of each iteration.
Default:
100
-
populations
Number of populations running.
Default:
31
-
population_size
Number of individuals in each population.
Default:
27
-
ncycles_per_iteration
Number of total mutations to run, per 10 samples of the population, per iteration.
Default:
380
The Objective¶
-
elementwise_loss
String of Julia code specifying an elementwise loss function. Can either be a loss from LossFunctions.jl, or your own loss written as a function. Examples of custom written losses include:
myloss(x, y) = abs(x-y)
for non-weighted, ormyloss(x, y, w) = w*abs(x-y)
for weighted. The included losses include: Regression:LPDistLoss{P}()
,L1DistLoss()
,L2DistLoss()
(mean square),LogitDistLoss()
,HuberLoss(d)
,L1EpsilonInsLoss(ϵ)
,L2EpsilonInsLoss(ϵ)
,PeriodicLoss(c)
,QuantileLoss(τ)
. Classification:ZeroOneLoss()
,PerceptronLoss()
,L1HingeLoss()
,SmoothedL1HingeLoss(γ)
,ModifiedHuberLoss()
,L2MarginLoss()
,ExpLoss()
,SigmoidLoss()
,DWDMarginLoss(q)
.Default:
"L2DistLoss()"
-
loss_function
Alternatively, you can specify the full objective function as a snippet of Julia code, including any sort of custom evaluation (including symbolic manipulations beforehand), and any sort of loss function or regularizations. The default
loss_function
used in SymbolicRegression.jl is roughly equal to:where the example elementwise loss is mean-squared error. You may pass a function with the same arguments as this (note that the name of the function doesn't matter). Here, bothfunction eval_loss(tree, dataset::Dataset{T,L}, options)::L where {T,L} prediction, flag = eval_tree_array(tree, dataset.X, options) if !flag return L(Inf) end return sum((prediction .- dataset.y) .^ 2) / dataset.n end
prediction
anddataset.y
are 1D arrays of lengthdataset.n
. If usingbatching
, then you should add anidx
argument to the function, which isnothing
for non-batched, and a 1D array of indices for batched.Default:
None
-
model_selection
Model selection criterion when selecting a final expression from the list of best expression at each complexity. Can be
'accuracy'
,'best'
, or'score'
.'accuracy'
selects the candidate model with the lowest loss (highest accuracy).'score'
selects the candidate model with the highest score. Score is defined as the negated derivative of the log-loss with respect to complexity - if an expression has a much better loss at a slightly higher complexity, it is preferred.'best'
selects the candidate model with the highest score among expressions with a loss better than at least 1.5x the most accurate model.Default:
'best'
-
dimensional_constraint_penalty
Additive penalty for if dimensional analysis of an expression fails. By default, this is
1000.0
. -
dimensionless_constants_only
Whether to only search for dimensionless constants, if using units.
Default:
False
Working with Complexities¶
-
parsimony
Multiplicative factor for how much to punish complexity.
Default:
0.0
-
constraints
Dictionary of int (unary) or 2-tuples (binary), this enforces maxsize constraints on the individual arguments of operators. E.g.,
'pow': (-1, 1)
says that power laws can have any complexity left argument, but only 1 complexity in the right argument. Use this to force more interpretable solutions.Default:
None
-
nested_constraints
Specifies how many times a combination of operators can be nested. For example,
{"sin": {"cos": 0}}, "cos": {"cos": 2}}
specifies thatcos
may never appear within asin
, butsin
can be nested with itself an unlimited number of times. The second term specifies thatcos
can be nested up to 2 times within acos
, so thatcos(cos(cos(x)))
is allowed (as well as any combination of+
or-
within it), butcos(cos(cos(cos(x))))
is not allowed. When an operator is not specified, it is assumed that it can be nested an unlimited number of times. This requires that there is no operator which is used both in the unary operators and the binary operators (e.g.,-
could be both subtract, and negation). For binary operators, you only need to provide a single number: both arguments are treated the same way, and the max of each argument is constrained.Default:
None
-
complexity_of_operators
If you would like to use a complexity other than 1 for an operator, specify the complexity here. For example,
{"sin": 2, "+": 1}
would give a complexity of 2 for each use of thesin
operator, and a complexity of 1 for each use of the+
operator (which is the default). You may specify real numbers for a complexity, and the total complexity of a tree will be rounded to the nearest integer after computing.Default:
None
-
complexity_of_constants
Complexity of constants.
Default:
1
-
complexity_of_variables
Global complexity of variables. To set different complexities for different variables, pass a list of complexities to the
fit
method with keywordcomplexity_of_variables
. You cannot use both.Default:
1
-
complexity_mapping
Alternatively, you can pass a function (a string of Julia code) that takes the expression as input and returns the complexity. Make sure that this operates on
AbstractExpression
(and unpacks toAbstractExpressionNode
), and returns an integer.Default:
None
-
warmup_maxsize_by
Whether to slowly increase max size from a small number up to the maxsize (if greater than 0). If greater than 0, says the fraction of training time at which the current maxsize will reach the user-passed maxsize.
Default:
0.0
-
use_frequency
Whether to measure the frequency of complexities, and use that instead of parsimony to explore equation space. Will naturally find equations of all complexities.
Default:
True
-
use_frequency_in_tournament
Whether to use the frequency mentioned above in the tournament, rather than just the simulated annealing.
Default:
True
-
adaptive_parsimony_scaling
If the adaptive parsimony strategy (
use_frequency
anduse_frequency_in_tournament
), this is how much to (exponentially) weight the contribution. If you find that the search is only optimizing the most complex expressions while the simpler expressions remain stagnant, you should increase this value.Default:
1040.0
-
should_simplify
Whether to use algebraic simplification in the search. Note that only a few simple rules are implemented.
Default:
True
Mutations¶
-
weight_add_node
Relative likelihood for mutation to add a node.
Default:
2.47
-
weight_insert_node
Relative likelihood for mutation to insert a node.
Default:
0.0112
-
weight_delete_node
Relative likelihood for mutation to delete a node.
Default:
0.870
-
weight_do_nothing
Relative likelihood for mutation to leave the individual.
Default:
0.273
-
weight_mutate_constant
Relative likelihood for mutation to change the constant slightly in a random direction.
Default:
0.0346
-
weight_mutate_operator
Relative likelihood for mutation to swap an operator.
Default:
0.293
-
weight_swap_operands
Relative likehood for swapping operands in binary operators.
Default:
0.198
-
weight_rotate_tree
How often to perform a tree rotation at a random node.
Default:
4.26
-
weight_randomize
Relative likelihood for mutation to completely delete and then randomly generate the equation
Default:
0.000502
-
weight_simplify
Relative likelihood for mutation to simplify constant parts by evaluation
Default:
0.00209
-
weight_optimize
Constant optimization can also be performed as a mutation, in addition to the normal strategy controlled by
optimize_probability
which happens every iteration. Using it as a mutation is useful if you want to use a largencycles_periteration
, and may not optimize very often.Default:
0.0
-
crossover_probability
Absolute probability of crossover-type genetic operation, instead of a mutation.
Default:
0.0259
-
annealing
Whether to use annealing.
Default:
False
-
alpha
Initial temperature for simulated annealing (requires
annealing
to beTrue
).Default:
3.17
-
perturbation_factor
Constants are perturbed by a max factor of (perturbation_factor*T + 1). Either multiplied by this or divided by this.
Default:
0.129
-
probability_negate_constant
Probability of negating a constant in the equation when mutating it.
Default:
0.00743
-
skip_mutation_failures
Whether to skip mutation and crossover failures, rather than simply re-sampling the current member.
Default:
True
Tournament Selection¶
-
tournament_selection_n
Number of expressions to consider in each tournament.
Default:
15
-
tournament_selection_p
Probability of selecting the best expression in each tournament. The probability will decay as p*(1-p)^n for other expressions, sorted by loss.
Default:
0.982
Constant Optimization¶
-
optimizer_algorithm
Optimization scheme to use for optimizing constants. Can currently be
NelderMead
orBFGS
.Default:
"BFGS"
-
optimizer_nrestarts
Number of time to restart the constants optimization process with different initial conditions.
Default:
2
-
optimizer_f_calls_limit
How many function calls to allow during optimization.
Default:
10_000
-
optimize_probability
Probability of optimizing the constants during a single iteration of the evolutionary algorithm.
Default:
0.14
-
optimizer_iterations
Number of iterations that the constants optimizer can take.
Default:
8
-
should_optimize_constants
Whether to numerically optimize constants (Nelder-Mead/Newton) at the end of each iteration.
Default:
True
Migration between Populations¶
-
fraction_replaced
How much of population to replace with migrating equations from other populations.
Default:
0.00036
-
fraction_replaced_hof
How much of population to replace with migrating equations from hall of fame.
Default:
0.0614
-
migration
Whether to migrate.
Default:
True
-
hof_migration
Whether to have the hall of fame migrate.
Default:
True
-
topn
How many top individuals migrate from each population.
Default:
12
Data Preprocessing¶
-
denoise
Whether to use a Gaussian Process to denoise the data before inputting to PySR. Can help PySR fit noisy data.
Default:
False
-
select_k_features
Whether to run feature selection in Python using random forests, before passing to the symbolic regression code. None means no feature selection; an int means select that many features.
Default:
None
Stopping Criteria¶
-
max_evals
Limits the total number of evaluations of expressions to this number.
Default:
None
-
timeout_in_seconds
Make the search return early once this many seconds have passed.
Default:
None
-
early_stop_condition
Stop the search early if this loss is reached. You may also pass a string containing a Julia function which takes a loss and complexity as input, for example:
"f(loss, complexity) = (loss < 0.1) && (complexity < 10)"
.Default:
None
Performance and Parallelization¶
-
parallelism
Parallelism to use for the search. Can be
"serial"
,"multithreading"
, or"multiprocessing"
.Default:
"multithreading"
-
procs
Number of processes to use for parallelism. If
None
, defaults tocpu_count()
.Default:
None
-
cluster_manager
For distributed computing, this sets the job queue system. Set to one of "slurm", "pbs", "lsf", "sge", "qrsh", "scyld", or "htc". If set to one of these, PySR will run in distributed mode, and use
procs
to figure out how many processes to launch.Default:
None
-
heap_size_hint_in_bytes
For multiprocessing, this sets the
--heap-size-hint
parameter for new Julia processes. This can be configured when using multi-node distributed compute, to give a hint to each process about how much memory they can use before aggressive garbage collection. -
batching
Whether to compare population members on small batches during evolution. Still uses full dataset for comparing against hall of fame.
Default:
False
-
batch_size
The amount of data to use if doing batching.
Default:
50
-
precision
What precision to use for the data. By default this is
32
(float32), but you can select64
or16
as well, giving you 64 or 16 bits of floating point precision, respectively. If you pass complex data, the corresponding complex precision will be used (i.e.,64
for complex128,32
for complex64).Default:
32
-
fast_cycle
Batch over population subsamples. This is a slightly different algorithm than regularized evolution, but does cycles 15% faster. May be algorithmically less efficient.
Default:
False
-
turbo
(Experimental) Whether to use LoopVectorization.jl to speed up the search evaluation. Certain operators may not be supported. Does not support 16-bit precision floats.
Default:
False
-
bumper
(Experimental) Whether to use Bumper.jl to speed up the search evaluation. Does not support 16-bit precision floats.
Default:
False
-
autodiff_backend
Which backend to use for automatic differentiation during constant optimization. Currently only
"Zygote"
is supported. The default,None
, uses forward-mode or finite difference.Default:
None
Determinism¶
-
random_state
Pass an int for reproducible results across multiple function calls. See :term:
Glossary <random_state>
.Default:
None
-
deterministic
Make a PySR search give the same result every run. To use this, you must turn off parallelism (with
parallelism="serial"
), and setrandom_state
to a fixed seed.Default:
False
-
warm_start
Tells fit to continue from where the last call to fit finished. If false, each call to fit will be fresh, overwriting previous results.
Default:
False
Monitoring¶
-
verbosity
What verbosity level to use. 0 means minimal print statements.
Default:
1
-
update_verbosity
What verbosity level to use for package updates. Will take value of
verbosity
if not given.Default:
None
-
print_precision
How many significant digits to print for floats.
Default:
5
-
progress
Whether to use a progress bar instead of printing to stdout.
Default:
True
-
logger_spec
Logger specification for the Julia backend. See, for example,
TensorBoardLoggerSpec
.Default:
None
-
input_stream
The stream to read user input from. By default, this is
"stdin"
. If you encounter issues with reading fromstdin
, like a hang, you can simply pass"devnull"
to this argument. You can also reference an arbitrary Julia object in theMain
namespace.Default:
"stdin"
Environment¶
-
temp_equation_file
Whether to put the hall of fame file in the temp directory. Deletion is then controlled with the
delete_tempfiles
parameter.Default:
False
-
tempdir
directory for the temporary files.
Default:
None
-
delete_tempfiles
Whether to delete the temporary files after finishing.
Default:
True
-
update
Whether to automatically update Julia packages when
fit
is called. You should make sure that PySR is up-to-date itself first, as the packaged Julia packages may not necessarily include all updated dependencies.Default:
False
Exporting the Results¶
-
output_directory
The base directory to save output files to. Files will be saved in a subdirectory according to the run ID. Will be set to
outputs/
if not provided.Default:
None
-
run_id
A unique identifier for the run. Will be generated using the current date and time if not provided.
Default:
None
-
output_jax_format
Whether to create a 'jax_format' column in the output, containing jax-callable functions and the default parameters in a jax array.
Default:
False
-
output_torch_format
Whether to create a 'torch_format' column in the output, containing a torch module with trainable parameters.
Default:
False
-
extra_sympy_mappings
Provides mappings between custom
binary_operators
orunary_operators
defined in julia strings, to those same operators defined in sympy. E.G ifunary_operators=["inv(x)=1/x"]
, then for the fitted model to be export to sympy,extra_sympy_mappings
would be{"inv": lambda x: 1/x}
.Default:
None
-
extra_torch_mappings
The same as
extra_jax_mappings
but for model export to pytorch. Note that the dictionary keys should be callable pytorch expressions. For example:extra_torch_mappings={sympy.sin: torch.sin}
.Default:
None
-
extra_jax_mappings
Similar to
extra_sympy_mappings
but for model export to jax. The dictionary maps sympy functions to jax functions. For example:extra_jax_mappings={sympy.sin: "jnp.sin"}
maps thesympy.sin
function to the equivalent jax expressionjnp.sin
.Default:
None
PySRRegressor Functions¶
fit(X, y, *, Xresampled=None, weights=None, variable_names=None, complexity_of_variables=None, X_units=None, y_units=None, category=None)
¶
Search for equations to fit the dataset and store them in self.equations_
.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
X
|
ndarray | DataFrame
|
Training data of shape (n_samples, n_features). |
required |
y
|
ndarray | DataFrame
|
Target values of shape (n_samples,) or (n_samples, n_targets). Will be cast to X's dtype if necessary. |
required |
Xresampled
|
ndarray | DataFrame
|
Resampled training data, of shape (n_resampled, n_features),
to generate a denoised data on. This
will be used as the training data, rather than |
None
|
weights
|
ndarray | DataFrame
|
Weight array of the same shape as |
None
|
variable_names
|
list[str]
|
A list of names for the variables, rather than "x0", "x1", etc.
If |
None
|
X_units
|
list[str]
|
A list of units for each variable in |
None
|
y_units
|
str | list[str]
|
Similar to |
None
|
category
|
list[int]
|
If |
None
|
Returns:
Name | Type | Description |
---|---|---|
self |
object
|
Fitted estimator. |
Source code in pysr/sr.py
2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 |
|
predict(X, index=None, *, category=None)
¶
Predict y from input X using the equation chosen by model_selection
.
You may see what equation is used by printing this object. X should have the same columns as the training data.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
X
|
ndarray | DataFrame
|
Training data of shape |
required |
index
|
int | list[int]
|
If you want to compute the output of an expression using a
particular row of |
None
|
category
|
ndarray | None
|
If |
None
|
Returns:
Name | Type | Description |
---|---|---|
y_predicted |
ndarray of shape (n_samples, nout_)
|
Values predicted by substituting |
Raises:
Type | Description |
---|---|
ValueError
|
Raises if the |
Source code in pysr/sr.py
2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 |
|
from_file(equation_file=None, *, run_directory, binary_operators=None, unary_operators=None, n_features_in=None, feature_names_in=None, selection_mask=None, nout=1, **pysr_kwargs)
classmethod
¶
Create a model from a saved model checkpoint or equation file.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
run_directory
|
str
|
The directory containing outputs from a previous run.
This is of the form |
required |
binary_operators
|
list[str]
|
The same binary operators used when creating the model. Not needed if loading from a pickle file. |
None
|
unary_operators
|
list[str]
|
The same unary operators used when creating the model. Not needed if loading from a pickle file. |
None
|
n_features_in
|
int
|
Number of features passed to the model. Not needed if loading from a pickle file. |
None
|
feature_names_in
|
list[str]
|
Names of the features passed to the model. Not needed if loading from a pickle file. |
None
|
selection_mask
|
NDArray[bool_]
|
If using |
None
|
nout
|
int
|
Number of outputs of the model.
Not needed if loading from a pickle file.
Default is |
1
|
**pysr_kwargs
|
dict
|
Any other keyword arguments to initialize the PySRRegressor object. These will overwrite those stored in the pickle file. Not needed if loading from a pickle file. |
{}
|
Returns:
Name | Type | Description |
---|---|---|
model |
PySRRegressor
|
The model with fitted equations. |
Source code in pysr/sr.py
1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 |
|
sympy(index=None)
¶
Return sympy representation of the equation(s) chosen by model_selection
.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
index
|
int | list[int]
|
If you wish to select a particular equation from
|
None
|
Returns:
Name | Type | Description |
---|---|---|
best_equation |
str, list[str] of length nout_
|
SymPy representation of the best equation. |
Source code in pysr/sr.py
latex(index=None, precision=3)
¶
Return latex representation of the equation(s) chosen by model_selection
.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
index
|
int | list[int]
|
If you wish to select a particular equation from
|
None
|
precision
|
int
|
The number of significant figures shown in the LaTeX
representation.
Default is |
3
|
Returns:
Name | Type | Description |
---|---|---|
best_equation |
str or list[str] of length nout_
|
LaTeX expression of the best equation. |
Source code in pysr/sr.py
pytorch(index=None)
¶
Return pytorch representation of the equation(s) chosen by model_selection
.
Each equation (multiple given if there are multiple outputs) is a PyTorch module
containing the parameters as trainable attributes. You can use the module like
any other PyTorch module: module(X)
, where X
is a tensor with the same
column ordering as trained with.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
index
|
int | list[int]
|
If you wish to select a particular equation from
|
None
|
Returns:
Name | Type | Description |
---|---|---|
best_equation |
Module
|
PyTorch module representing the expression. |
Source code in pysr/sr.py
jax(index=None)
¶
Return jax representation of the equation(s) chosen by model_selection
.
Each equation (multiple given if there are multiple outputs) is a dictionary
containing {"callable": func, "parameters": params}. To call func
, pass
func(X, params). This function is differentiable using jax.grad
.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
index
|
int | list[int]
|
If you wish to select a particular equation from
|
None
|
Returns:
Name | Type | Description |
---|---|---|
best_equation |
dict[str, Any]
|
Dictionary of callable jax function in "callable" key, and jax array of parameters as "parameters" key. |
Source code in pysr/sr.py
latex_table(indices=None, precision=3, columns=['equation', 'complexity', 'loss', 'score'])
¶
Create a LaTeX/booktabs table for all, or some, of the equations.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
indices
|
list[int] | list[list[int]]
|
If you wish to select a particular subset of equations from
|
None
|
precision
|
int
|
The number of significant figures shown in the LaTeX
representations.
Default is |
3
|
columns
|
list[str]
|
Which columns to include in the table.
Default is |
['equation', 'complexity', 'loss', 'score']
|
Returns:
Name | Type | Description |
---|---|---|
latex_table_str |
str
|
A string that will render a table in LaTeX of the equations. |
Source code in pysr/sr.py
refresh(run_directory=None)
¶
Update self.equations_ with any new options passed.
For example, updating extra_sympy_mappings
will require a .refresh()
to update the equations.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
checkpoint_file
|
str or Path
|
Path to checkpoint hall of fame file to be loaded.
The default will use the set |
required |
Source code in pysr/sr.py
Expression Specifications¶
ExpressionSpec
¶
The default expression specification, with no special behavior.
TemplateExpressionSpec(function_symbols, combine, num_features=None)
¶
Spec for templated expressions.
This class allows you to specify how multiple sub-expressions should be combined
in a structured way, with constraints on which variables each sub-expression can use.
Pass this to PySRRegressor with the expression_spec
argument when you are using
the TemplateExpression
expression type.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
function_symbols
|
list[str]
|
List of symbols representing the inner expressions (e.g., ["f", "g"]). These will be used as keys in the template structure. |
required |
combine
|
str
|
Julia function string that defines how the sub-expressions are combined. Takes a NamedTuple of expressions and a tuple of data vectors. For example: "((; f, g), (x1, x2, x3)) -> f(x1, x2) + g(x3)^2" would constrain f to use x1,x2 and g to use x3. |
required |
num_features
|
dict[str, int]
|
Dictionary mapping function symbols to the number of features each can use. For example: {"f": 2, "g": 1} means f takes 2 inputs and g takes 1. If not provided, will be inferred from the combine function. |
None
|
Examples:
# Create template that combines f(x1, x2) and g(x3):
expression_spec = TemplateExpressionSpec(
function_symbols=["f", "g"],
combine="((; f, g), (x1, x2, x3)) -> sin(f(x1, x2)) + g(x3)^2",
)
# Use in PySRRegressor:
model = PySRRegressor(
expression_spec=expression_spec
)
Source code in pysr/expression_specs.py
ParametricExpressionSpec(max_parameters)
¶
Spec for parametric expressions that vary by category.
This class allows you to specify expressions with parameters that vary across different categories in your dataset. The expression structure remains the same, but parameters are optimized separately for each category.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
max_parameters
|
int
|
Maximum number of parameters that can appear in the expression. Each parameter will take on different values for each category in the data. |
required |
Examples:
For example, if we want to allow for a model with up to 2 parameters (each category can have a different value for these parameters), we can use:
model = PySRRegressor(
expression_spec=ParametricExpressionSpec(max_parameters=2),
binary_operators=["+", "*"],
unary_operators=["sin"]
)
model.fit(X, y, category=category)
Source code in pysr/expression_specs.py
AbstractExpressionSpec
¶
Abstract base class describing expression types.
This basically just holds the options for the expression type, as well as explains how to parse and evaluate them.
All expression types must implement:
- julia_expression_type(): The actual expression type, returned as a Julia object.
This will get stored as
expression_type
inSymbolicRegression.Options
. - julia_expression_options(): Method to create the expression options, returned as a Julia object.
These will get stored as
expression_options
inSymbolicRegression.Options
. - create_exports(), which will be used to create the exports of the equations, such as the executable format, the SymPy format, etc.
It may also optionally implement:
- supports_sympy, supports_torch, supports_jax, supports_latex: Whether this expression type supports the corresponding export format.
Logger Specifications¶
TensorBoardLoggerSpec(log_dir='logs/run', log_interval=1, overwrite=False)
dataclass
¶
Specification for TensorBoard logger.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
log_dir
|
str
|
Directory where TensorBoard logs will be saved. If |
'logs/run'
|
log_interval
|
int
|
Interval (in steps) at which logs are written. Default is 10. |
1
|
overwrite
|
bool
|
Whether to overwrite existing logs in the directory. Default is False. |
False
|