Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2013 | Accepted Version
Book Section - Chapter Open

Discovering cyclic causal models with latent variables: a general SAT-based procedure

Abstract

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.

Additional Information

© 2013 AUAI Press. This research was supported by the Academy of Finland under grants 218147 and 255625 (POH), 132812 and 251170 (MJ), by HIIT (AH) and by the James S. McDonnell Foundation (FE).

Attached Files

Accepted Version - 1309.6836.pdf

Files

1309.6836.pdf
Files (421.9 kB)
Name Size Download all
md5:bcf90afa8bcbb1bb70f42fd27081b471
421.9 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
July 5, 2024