Causal discovery has become a vital tool for scientists and practitioners wanting to discover causal relationships from observational data. While most previous approaches to causal discovery have implicitly assumed that no expert domain knowledge is available, practitioners can often provide such domain knowledge from prior experience. Recent work has incorporated domain knowledge into constraint-based causal discovery. The majority of such constraint-based methods, however, assume causal faithfulness, which has been shown to be frequently violated in practice. Consequently, there has been renewed attention towards exact-search score-based causal discovery methods, which do not assume causal faithfulness, such as A*-based methods. However, there has been no consideration of these methods in the context of domain knowledge. In this work, we focus on efficiently integrating several types of domain knowledge into A*-based causal discovery. In doing so, we discuss and explain how domain knowledge can reduce the graph search space and then provide an analysis of the potential computational gains. We support these findings with experiments on synthetic and real data, showing that even small amounts of domain knowledge can dramatically speed up A*-based causal discovery and improve its performance and practicality.
翻译:虽然以前大多数因果发现方法都暗含地假定没有专家领域知识,但从业者往往能够提供这种领域知识。最近的工作已将域知识纳入基于限制的因果发现中。然而,大多数这种基于限制的方法假定因果关系,这在实践中经常被违反。因此,人们再次关注基于精确调查的分数因果发现方法,这些方法并不假定基于A*的方法等因果关系。然而,在域知识方面,没有考虑到这些方法。在这项工作中,我们注重将几种类型的域知识有效地纳入基于A*的因果发现中。我们这样做是为了讨论和解释域知识如何减少图形搜索空间,然后分析潜在的计算收益。我们用合成和真实数据的实验来支持这些结果,表明即使少量的域知识也能大大加快基于A*的因果发现,并改进其性能和实用性。