Causal Discovery for Cross-Sectional Data Based on Super-Structure and Divide-and-Conquer
Wenyu Wang (1), Yaping Wan (1) ((1) University of South China)

TL;DR
This paper introduces a lightweight, scalable causal discovery framework that reduces computational costs by relaxing Super-Structure constraints, enabling effective analysis of large, domain-knowledge-scarce datasets.
Contribution
It proposes a novel divide-and-conquer causal discovery method that relaxes Super-Structure requirements, significantly lowering CI test costs while maintaining accuracy.
Findings
Matches or closely approximates PC and FCI accuracy
Reduces CI test numbers drastically
Validates on synthetic and real-world data
Abstract
This paper tackles a critical bottleneck in Super-Structure-based divide-and-conquer causal discovery: the high computational cost of constructing accurate Super-Structures--particularly when conditional independence (CI) tests are expensive and domain knowledge is unavailable. We propose a novel, lightweight framework that relaxes the strict requirements on Super-Structure construction while preserving the algorithmic benefits of divide-and-conquer. By integrating weakly constrained Super-Structures with efficient graph partitioning and merging strategies, our approach substantially lowers CI test overhead without sacrificing accuracy. We instantiate the framework in a concrete causal discovery algorithm and rigorously evaluate its components on synthetic data. Comprehensive experiments on Gaussian Bayesian networks, including magic-NIAB, ECOLI70, and magic-IRRI, demonstrate that our…
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 · Advanced Causal Inference Techniques · Explainable Artificial Intelligence (XAI)
