SADA: A General Framework to Support Robust Causation Discovery with Theoretical Guarantee
Ruichu Cai, Zhenjie Zhang, Zhifeng Hao

TL;DR
SADA is a scalable, theoretically guaranteed framework that improves causation discovery by partitioning variables and combining results, effective even with limited samples and in large domains.
Contribution
The paper introduces SADA, a general split-and-merge framework that enhances scalability and accuracy of causation discovery algorithms under local sparsity assumptions.
Findings
SADA reduces problem scale without losing accuracy.
SADA improves causation discovery accuracy with limited samples.
Experimental results confirm scalability and accuracy benefits.
Abstract
Causation discovery without manipulation is considered a crucial problem to a variety of applications. The state-of-the-art solutions are applicable only when large numbers of samples are available or the problem domain is sufficiently small. Motivated by the observations of the local sparsity properties on causal structures, we propose a general Split-and-Merge framework, named SADA, to enhance the scalability of a wide class of causation discovery algorithms. In SADA, the variables are partitioned into subsets, by finding causal cut on the sparse causal structure over the variables. By running mainstream causation discovery algorithms as basic causal solvers on the subproblems, complete causal structure can be reconstructed by combining the partial results. SADA benefits from the recursive division technique, since each small subproblem generates more accurate result under the same…
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 · Rough Sets and Fuzzy Logic · Logic, Reasoning, and Knowledge
