Skip to main content

No project description provided

Project description

Joint Probability Trees (short JPTs) are a formalism for learning of and reasoning about joint probability distributions, which is tractable for practical applications. JPTs support both symbolic and subsymbolic variables in a single hybrid model, and they do not rely on prior knowledge about variable dependencies or families of distributions. JPT representations build on tree structures that partition the problem space into relevant subregions that are elicited from the training data instead of postulating a rigid dependency model prior to learning. Learning and reasoning scale linearly in JPTs, and the tree structure allows white-box reasoning about any posterior probability P(QE), such that interpretable explanations can be provided for any inference result. This documentation introduces the code base of the pyjpt library, which is implemented in Python/Cython, and showcases the practical applicability of JPTs in high-dimensional heterogeneous probability spaces, making it a promising alternative to classic probabilistic

## Documentation The documentation is hosted on readthedocs.org [here](https://joint-probability-trees.readthedocs.io/en/latest/).

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page