SADA:一个有理论保证的鲁棒因果关系发现框架
SADA: A General Framework to Support Robust Causation Discovery with Theoretical Guarantee
摘要:
无操纵的因果关系发现被认为是各种应用的关键问题。最先进的解决方案仅适用于大量样本可用或问题域足够小的情况。出于对因果结构的局部稀疏性的观察,我们提出了一个通用的分裂和合并框架,命名为SADA,以提高广泛的一类因果关系发现算法的可扩展性。在SADA中,通过在变量的稀疏因果结构上寻找因果割,将变量划分为子集。通过运行主流因果发现算法作为子问题的基本因果求解器,可以通过组合部分结果来重建完整的因果结构。SADA得益于递归除法技术,因为每个小的子问题在相同数量的样本下产生更准确的结果。我们从理论上证明了SADA总是减少规模的问题,而不牺牲精度,在局部因果稀疏性和可靠的条件独立性测试的条件下。我们还提出了充分条件SADA的准确性增强,即使条件独立性测试是脆弱的。在模拟数据集和真实数据集上的大量实验验证了SADA与现有因果关系发现算法的可扩展性和准确性的提高。
英文摘要:
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 number of samples. We theoretically prove that SADA always reduces the scales of problems without sacrifice on accuracy, under the condition of local causal sparsity and reliable conditional independence tests. We also present sufficient condition to accuracy enhancement by SADA, even when the conditional independence tests are vulnerable. Extensive experiments on both simulated and real-world datasets verify the improvements on scalability and accuracy by applying SADA together with existing causation discovery algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。