Aleatoric and epistemic uncertainty in machine learning: An introduction to concepts and methods

E Hüllermeier, W Waegeman - Machine learning, 2021 - Springer
The notion of uncertainty is of major importance in machine learning and constitutes a key
element of machine learning methodology. In line with the statistical tradition, uncertainty …

[PDF][PDF] Probabilistic circuits: A unifying framework for tractable probabilistic models

Y Choi, A Vergari… - UCLA. URL: http://starai …, 2020 - yoojungchoi.github.io
Probabilistic models are at the very core of modern machine learning (ML) and artificial
intelligence (AI). Indeed, probability theory provides a principled and almost universally …

Sum-product networks: A survey

R Sánchez-Cauce, I París… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
A sum-product network (SPN) is a probabilistic model, based on a rooted acyclic directed
graph, in which terminal nodes represent probability distributions and non-terminal nodes …

Building Expressive and Tractable Probabilistic Generative Models: A Review

S Sidheekh, S Natarajan - arXiv preprint arXiv:2402.00759, 2024 - arxiv.org
We present a comprehensive survey of the advancements and techniques in the field of
tractable probabilistic generative modeling, primarily focusing on Probabilistic Circuits …

Depth functions for partial orders with a descriptive analysis of machine learning algorithms

H Blocher, G Schollmeyer, C Jansen… - International …, 2023 - proceedings.mlr.press
We propose a framework for descriptively analyzing sets of partial orders based on the
concept of depth functions. Despite intensive studies of depth functions in linear and metric …

[HTML][HTML] Comparing machine learning algorithms by union-free generic depth

H Blocher, G Schollmeyer, M Nalenz… - International Journal of …, 2024 - Elsevier
We propose a framework for descriptively analyzing sets of partial orders based on the
concept of depth functions. Despite intensive studies in linear and metric spaces, there is …

[HTML][HTML] Robustifying sum-product networks

DD Mauá, D Conaty, FG Cozman… - International Journal of …, 2018 - Elsevier
Sum-product networks are a relatively new and increasingly popular family of probabilistic
graphical models that allow for marginal inference with polynomial effort. They have been …

[HTML][HTML] Beyond tree-shaped credal probabilistic circuits

DRM Hernández, T Centen, T Krak… - International Journal of …, 2024 - Elsevier
Probabilistic circuits are a class of probabilistic generative models that allow us to compute
different types of probabilistic queries in polynomial time. Unlike many of the mainstream …

[HTML][HTML] Tractable inference in credal sentential decision diagrams

L Mattei, A Antonucci, DD Mauá, A Facchini… - International Journal of …, 2020 - Elsevier
Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive
gates are annotated by probability values. They allow for a compact representation of joint …

Sum-product networks: A survey

I París, R Sánchez-Cauce, FJ Díez - arXiv preprint arXiv:2004.01167, 2020 - arxiv.org
A sum-product network (SPN) is a probabilistic model, based on a rooted acyclic directed
graph, in which terminal nodes represent univariate probability distributions and non …