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 May 27, 2020 | Submitted
Report Open

ASP-based Discovery of Semi-Markovian Causal Models under Weaker Assumptions

Abstract

In recent years the possibility of relaxing the so-called Faithfulness assumption in automated causal discovery has been investigated. The investigation showed (1) that the Faithfulness assumption can be weakened in various ways that in an important sense preserve its power, and (2) that weakening of Faithfulness may help to speed up methods based on Answer Set Programming. However, this line of work has so far only considered the discovery of causal models without latent variables. In this paper, we study weakenings of Faithfulness for constraint-based discovery of semi-Markovian causal models, which accommodate the possibility of latent variables, and show that both (1) and (2) remain the case in this more realistic setting.

Additional Information

JZ was supported by GRF LU13602818 from the RGC of Hong Kong. FE was supported by NSF grant 1564330.

Attached Files

Submitted - 1906.02385.pdf

Files

1906.02385.pdf
Files (388.2 kB)
Name Size Download all
md5:2bd4040c27daca7874113160cabced57
388.2 kB Preview Download

Additional details

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