Joint Probability Trees
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 1 of its 28 references that are in the map. First posted on arXiv 14 Feb 2023.
Builds on
1 of 28 references.
References · 1
- 2014OpenML: networked science in machine learningcited by 526
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.