arXiv (Cornell University) · 2019 · 10 citations · 18 references
Public HealthComputer ScienceCausal InferenceKnowledge RepresentationMachine LearningCausal DiscoveryCausal Graphical ModelsDirected Acyclic GraphsGraph-based LearningLatent Variable ModelsNetwork InferenceCausal Graph LearningCausal OrderingCausal StructureDirected Acyclic Graph LearningGreedy HeuristicsLatent ConfoundingMarkov EquivalenceScore-based Causal Discovery
We consider the task of learning a causal graph in the presence of latent confounders given i.i.d.~samples from the model. While current algorithms for causal structure discovery in the presence of latent confounders are constraint-based, we here propose a score-based approach. We prove that under assumptions weaker than faithfulness, any sparsest independence map (IMAP) of the distribution belongs to the Markov equivalence class of the true model. This motivates the \emph{Sparsest Poset} formulation - that posets can be mapped to minimal IMAPs of the true model such that the sparsest of these IMAPs is Markov equivalent to the true model. Motivated by this result, we propose a greedy algorithm over the space of posets for causal structure discovery in the presence of latent confounders and compare its performance to the current state-of-the-art algorithms FCI and FCI+ on synthetic data.
18
Using Bayesian Networks to Analyze Expression Data
Nir Friedman, Michal Linial, Iftach Nachman et al. · Journal of Computational Biology · 2000 · 3.3K citations
Thomas S. Richardson, Peter Spirtes · The Annals of Statistics · 2002 · 576 citations
Applied Physics Letters · 2000 · 441 citations · Full text