A Hybrid Causal Search Algorithm for Latent Variable Models
Juan Miguel Ogarrio, Peter Spirtes, Joe Ramsey, Juan Miguel Ogarrio, Peter Spirtes, Joe Ramsey
Abstract
Existing score-based causal model search algorithms such as GES (and a speeded up version, FGS) are asymptotically correct, fast, and reliable, but make the unrealistic assumption that the true causal graph does not contain any unmeasured confounders. There are several constraint-based causal search algorithms (e.g RFCI, FCI, or FCI+) that are asymptotically correct without assuming that there are no unmeasured confounders, but often perform poorly on small samples. We describe a combined score and constraint-based algorithm, GFCI, that we prove is asymptotically correct. On synthetic data, GFCI is only slightly slower than RFCI but more accurate than FCI, RFCI and FCI+.
Figures
![Figure 1](https://www.ncbi.nlm.nih.gov/pmc/articles/instance/5325717/bin/nihms845582f1.jpg)
![Figure 2](https://www.ncbi.nlm.nih.gov/pmc/articles/instance/5325717/bin/nihms845582f2.jpg)
![Figure 3](https://www.ncbi.nlm.nih.gov/pmc/articles/instance/5325717/bin/nihms845582f3.jpg)
![Figure 4](https://www.ncbi.nlm.nih.gov/pmc/articles/instance/5325717/bin/nihms845582f4.jpg)
![Figure 5](https://www.ncbi.nlm.nih.gov/pmc/articles/instance/5325717/bin/nihms845582f5.jpg)
Source: PubMed