Anytime Element sampler.
Anytime sampling algorithms that compute MPE.
Anytime Metropolis-Hastings sampler.
Anytime Metropolis-Hastings annealer.
Anytime sampling algorithms that compute probability of evidence.
Anytime sampling algorithms that compute conditional probability of query elements.
Anytime sampling algorithms.
A base trait for sampling algorithms that compute conditional probabilities of queries, and that use the projection of all the samples of a target variable to calculate the distribution of that variable or the expectation of a function on that variable.
Samplers that use samples without weights.
A proposal scheme that chooses between different proposal schemes, each with a probability.
A proposal scheme that chooses between different proposal schemes, each with a probability.
A variable list of pairs of probabilities and proposal schemes.
An abstract class to generates samples from the marginal distribution of an element.
A proposal scheme that consists of proposing a single element.
A proposal scheme that consists of proposing a single element.
The element to propose
Importance samplers.
A class that implements sampling via likelihood weighting on a set of elements.
Metropolis-Hastings samplers.
Metropolis-Hastings based Annealer.
One-time Element sampler.
One-time sampling algorithms that compute probability of evidence.
One-time Metropolis-Hastings sampler.
One-time Metropolis-Hastings annealer.
One-time sampling algorithms that compute probability of evidence.
One-time sampling algorithms that compute conditional probability of query elements.
One-time sampling algorithms.
Algorithm that computes probability of evidence using forward sampling.
Algorithm that computes probability of evidence using forward sampling. The evidence is specified as NamedEvidence. Only the probability of this evidence is computed. Conditions and constraints that are already on elements are considered part of the definition of the model.
Sampling algorithms that compute conditional probabilities of queries on elements, and that use the projection of all the samples of a target variable to calculate the distribution of that variable or the expectation of a function on that variable.
Class that describes proposal schemes used in Metropolis-Hastings algorithms.
A trait for sampling algorithms.
The schedule class determines the annealing schedule in the annealer.
Proposes switching the randomness of two elements and optionally continues with another proposal scheme.
Proposes switching the randomness of two elements and optionally continues with another proposal scheme.
The two elements whose randomness is switched.
The optional proposal scheme.
A proposal scheme that proposes a first element and optionally continues with another proposal scheme based on the value of the first element.
A proposal scheme that proposes a first element and optionally continues with another proposal scheme based on the value of the first element.
The first element to propose.
An optional proposal scheme that is invoked conditioned on the value of the first element.
A proposal scheme that proposes a first element and optionally continues with another proposal scheme.
A proposal scheme that proposes a first element and optionally continues with another proposal scheme.
The first element to propose.
An optional proposal scheme that is invoked after the first element is proposed.
Samplers that use weighted samples.
Exception thrown when attempting to create a proposal scheme with no steps.
A forward sampler that generates a state by generating values for elements, making sure to generate all the arguments of an element before the element.
A base trait for sampling algorithms that compute conditional probabilities of queries, and that use the projection of all the samples of a target variable to calculate the distribution of that variable or the expectation of a function on that variable. Generic type U is either
Element
orReference
.