A PC Algorithm for Max-Linear Bayesian Networks
By: Carlos Améndola, Benjamin Hollering, Francesco Nowell
Potential Business Impact:
Finds hidden connections in data with weird patterns.
Max-linear Bayesian networks (MLBNs) are a relatively recent class of structural equation models which arise when the random variables involved have heavy-tailed distributions. Unlike most directed graphical models, MLBNs are typically not faithful to d-separation and thus classical causal discovery algorithms such as the PC algorithm or greedy equivalence search can not be used to accurately recover the true graph structure. In this paper, we begin the study of constraint-based discovery algorithms for MLBNs given an oracle for testing conditional independence in the true, unknown graph. We show that if the oracle is given by the $\ast$-separation criteria in the true graph, then the PC algorithm remains consistent despite the presence of additional CI statements implied by $\ast$-separation. We also introduce a new causal discovery algorithm named "PCstar" which assumes faithfulness to $C^\ast$-separation and is able to orient additional edges which cannot be oriented with only d- or $\ast$-separation.
Similar Papers
Scalable Bayesian Network Structure Learning Using Tsetlin Machine to Constrain the Search Space
Machine Learning (CS)
Finds causes faster for big problems.
Inference for max-linear Bayesian networks with noise
Machine Learning (Stat)
Finds causes of rare, extreme events.
How to Marginalize in Causal Structure Learning?
Machine Learning (CS)
Finds hidden patterns in data faster.