On the Number of Conditional Independence Tests in Constraint-based Causal Discovery
Marc Franquesa Mon\'es, Jiaqi Zhang, Caroline Uhler

TL;DR
This paper introduces a new algorithm for causal discovery that reduces the number of conditional independence tests needed, achieving near-optimal complexity and demonstrating efficiency through simulations and real data.
Contribution
The paper presents an algorithm with improved complexity for constraint-based causal discovery, establishing near-optimal bounds and validating its efficiency empirically.
Findings
The proposed algorithm requires fewer tests than existing methods.
It achieves complexity close to the theoretical lower bound.
Empirical results show improved efficiency on real and synthetic data.
Abstract
Learning causal relations from observational data is a fundamental problem with wide-ranging applications across many fields. Constraint-based methods infer the underlying causal structure by performing conditional independence tests. However, existing algorithms such as the prominent PC algorithm need to perform a large number of independence tests, which in the worst case is exponential in the maximum degree of the causal graph. Despite extensive research, it remains unclear if there exist algorithms with better complexity without additional assumptions. Here, we establish an algorithm that achieves a better complexity of tests, where is the number of nodes in the graph and denotes the maximum undirected clique size of the underlying essential graph. Complementing this result, we prove that any constraint-based algorithm must perform at least…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Gene expression and cancer classification · Rough Sets and Fuzzy Logic
