SAT-Based Causal Discovery under Weaker Assumptions
SAT-Based Causal Discovery under Weaker Assumptions
复制标题
较弱假设下基于 SAT 的因果发现
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
W. Mayer
中科院分区：
文献类型：
--
作者：
Zhalama;Jiji Zhang;F. Eberhardt;W. Mayer
利用最近开发的基于布尔可满足性（SAT）求解器的因果发现方法的灵活性，我们编码了各种削弱忠实性假设的假设。编码产生了许多基于 SAT 的算法，其渐近正确性依赖于比标准假设更弱的条件。在同一平台上实施一整套假设使我们能够系统地探索削弱忠实性假设对因果发现的影响。模拟结果表明，一个重要的效果是，采用较弱的假设可以大大缓解约束冲突的问题，并大大缩短求解时间。因此，基于 SAT 的因果发现在较弱的假设下可能更具可扩展性。
Using the flexibility of recently developed methods for causal discovery based on Boolean satisfiability (SAT) solvers, we encode a variety of assumptions that weaken the Faithfulness assumption. The encoding results in a number of SAT-based algorithms whose asymptotic correctness relies on weaker conditions than are standardly assumed. This implementation of a whole set of assumptions in the same platform enables us to systematically explore the effect of weakening the Faithfulness assumption on causal discovery. An important effect, suggested by simulation results, is that adopting weaker assumptions greatly alleviates the problem of conflicting constraints and substantially shortens solving time. As a result, SAT-based causal discovery is potentially more scalable under weaker assumptions.