paper-with-me

Papers

Joint Probability Trees

2023-02-14 · Daniel Nyga, Mareike Picklum, Tom Schierenbeck, Michael Beetz

We introduce Joint Probability Trees (JPT), a novel approach that makes learning of and reasoning about joint probability distributions 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(Q|E)$, such that interpretable explanations can be provided for any inference result. Our experiments showcase the practical applicability of JPTs in high-dimensional heterogeneous probability spaces with millions of training samples, making it a promising alternative to classic probabilistic graphical models.

📄 PDF Abstract BibTeX arXiv:2302.07167

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A New Pruning Method for Solving Decision Trees and Game Trees

2013-02-20 · Prakash P. Shenoy

The main goal of this paper is to describe a new pruning method for solving decision trees and game trees. The pruning method for decision trees suggests a slight variant of decision trees that we call scenario trees. In…

Integrating Transformations in Probabilistic Circuits

2023-10-06 · Tom Schierenbeck, Vladimir Vutov, Thorsten Dickhaus, Michael Beetz

This study addresses the predictive limitation of probabilistic circuits and introduces transformations as a remedy to overcome it. We demonstrate this limitation in robotic scenarios. We motivate that independent compon…

Contrast Trees and Distribution Boosting

2019-12-08 · Jerome H. Friedman

Often machine learning methods are applied and results reported in cases where there is little to no information concerning accuracy of the output. Simply because a computer program returns a result does not insure its v…

BIG-bench Machine Learning

Probability Calibration Trees

2018-07-31 · Tim Leathart, Eibe Frank, Geoffrey Holmes, Bernhard Pfahringer

Obtaining accurate and well calibrated probability estimates from classifiers is useful in many applications, for example, when minimising the expected cost of classifications. Existing methods of calibrating probability…

regression

On joint subtree distributions under two evolutionary models

2015-08-13

In population and evolutionary biology, hypotheses about micro-evolutionary and macro-evolutionary processes are commonly tested by comparing the shape indices of empirical evolutionary trees with those predicted by neut…

Vocal Bursts Valence Prediction