Reference / Defaults
Defaults¶
This page lists the thresholds and run-time defaults that the code sets as named
constants; each function’s parameter defaults are in its signature on the
API pages. The tables are generated from the code. Every engine
takes rng=None, which draws fresh entropy from the operating system: pass a seed for
reproducible draws. Names that start with an underscore are internal: they are listed to
explain behaviour, not as settings to change.
Automatic engine choice¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
An extension of a Gibbs run aims for this many times |
|
|
|
One extension of a Gibbs run adds at most this many times the draws so far. |
|
|
|
One extension of a Gibbs run adds at least this many times the draws so far. |
|
|
|
Proposals of the first pass that can stop a Laplace trial early. |
|
|
|
Draws of the first pass that can stop a Laplace trial early. |
|
|
|
A Laplace trial stops when its first pass projects an importance ESS below this share of |
Results and diagnostics¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
Quantiles whose indicators define the tail ESS. |
|
|
|
Pareto k-hat at or above which importance sampling is unreliable, reached from about 2,000 weights; with n weights the limit is min(1 - 1/log10(n), K_HAT_MAX). |
|
|
|
Pareto smoothing needs at least this many importance weights. |
|
|
|
The generalised Pareto is fitted to the ceil(min(a n, b sqrt(n))) largest of n weights, for (a, b) these. |
|
|
|
Population draws the per-object methods use by default. |
|
|
|
Largest split R-hat that |
|
|
|
Smallest bulk and tail ESS per chain that |
|
|
|
Chains shorter than this many draws get no R-hat or ESS. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Most values a density function returns per call when values are drawn (2**24 floats are 128 MB). |
Engines¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
Iterations of the first fast phase of Stan-style warm-up. |
|
|
|
Iterations of the first slow window of Stan-style warm-up; each next one is twice as long. |
|
|
|
Iterations of the last fast phase of Stan-style warm-up. |
|
|
|
Most regularised EM steps of the start of Gibbs and of MAP’s EM and L-BFGS paths when |
|
|
|
Importance proposals per draw when |
|
|
|
Eigenvalues of a Hessian that is not positive definite are raised to this times the largest (at least one). |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Up to this many dimensions, warm-up starts the metric from the curvature at the mode. |
|
|
|
Logistic priors stay non-centred when the median spread of the modes’ log-scales given the field exceeds this. |
|
|
|
Warm-up iteration of the partial centring of logistic priors, or the first slow window’s start if that is earlier. |
|
|
|
|
|
|
|
A MAP run that can no longer improve its objective in floating point is converged when its optimality gap is below this many times |
|
|
|
Regularised EM steps of mix-SQP’s start when |
Priors¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
Floor of drawn fractions and rates, so that their logarithms stay finite. |
|
|
|
Smoothness |
|
|
|
Most basis functions of |
Inputs¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
Objects per block of the chunked likelihood kernels. |
|
|
|
An object whose normalised evidence is below this is impossible. |
|
|
|
Likelihoods are stored sparse below this share of non-zero entries. |
|
|
|
Most function values a quadrature evaluates in one call. |
|
|
|
Quadrature cells per order-1 component and axis when |
|
|
|
An object with more than this share of its likelihood outside the bins is mostly outside. |
|
|
|
A warning is raised when more than this share of the objects are mostly outside the bins. |
|
|
|
|
|
|
|
A warning is raised when more than this share of posterior rows sum to one only under the other |
|
|
|
Relative tolerance within which a posterior row counts as summing to one. |
|
|
|
With |
Selection¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
A selection that changes by more than this factor between neighbouring bins raises a warning. |
|
|
|
Smallest detection probability a draw of an inferred selection takes. |
Validation¶
Name |
Value |
Module |
What it controls |
|---|---|---|---|
|
|
|
Most bins of an SBC rank histogram when |
|
|
|
Fewest simulations per bin of an SBC rank histogram when |