Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure

By Antti Hyttinen, Patrik O. Hoyer, Frederick Eberhardt, Matti Järvisalo. 2013

97 citations recorded by the source corpus.

We present a very general approach to learning the structure of causal models based on d-separation constraints, obtained from any given set of overlapping passive observational or experimental data sets. The procedure allows for both directed cycles (feedback loops) and the presence of latent variables. Our approach is based on a logical representation of causal pathways, which permits the integration of quite general background knowledge, and inference is performed using a Boolean satisfiability (SAT) solver. The procedure is complete in that it exhausts the available information on whether any given edge can be determined to be present or absent, and returns "unknown" otherwise. Many existing constraint-based causal discovery algorithms can be seen as special cases, tailored to circumstances in which one or more restricting assumptions apply. Simulations illustrate the effect of these assumptions on discovery and how the present algorithm scales.

Subfields: Artificial Intelligence, Software

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Antti Hyttinen
  2. Ioannis Tsamardinos
  3. Sofia Triantafillou
  4. Matti Järvisalo
  5. Frederick Eberhardt
  6. Joris M. Mooij
  7. Peter Buhlmann
  8. Bernhard Schölkopf

In Software

  1. Sofia Triantafillou
  2. Ioannis Tsamardinos
  3. Matti Järvisalo
  4. Frederick Eberhardt
  5. Antti Hyttinen

Citations in the corpus