We present a new method for linear and nonlinear, lagged and contemporaneous constraint-based causal discovery from observational time series in the presence of latent confounders. We show that existing causal discovery methods such as FCI and variants suffer from low recall in the autocorrelated time series case and identify low effect size of conditional independence tests as the main reason. Information-theoretical arguments show that effect size can often be increased if causal parents are included in the conditioning sets. To identify parents early on, we suggest an iterative procedure that utilizes novel orientation rules to determine ancestral relationships already during the edge removal phase. We prove that the method is order-independent, and sound and complete in the oracle case. Extensive simulation studies for different numbers of variables, time lags, sample sizes, and further cases demonstrate that our method indeed achieves much higher recall than existing methods for the case of autocorrelated continuous variables while keeping false positives at the desired level. This performance gain grows with stronger autocorrelation. At https://github.com/jakobrunge/tigramite we provide Python code for all methods involved in the simulation studies.
翻译:我们提出一种新的方法,在潜伏混淆者在场的情况下,从观察时间序列中发现线性和非线性、滞后和同时的制约性因果性发现;我们表明,在与自动相关的时间序列中,现有因果性发现方法,如FCI和变异物等,在与自动相关的时间序列中被低调召回,并查明有条件独立测试的低影响大小是主要原因;信息理论论据表明,如果将因果性父母包括在调节装置中,其影响大小往往会增加;为了及早确定父母,我们建议采用迭代程序,利用新式定向规则来确定在边缘清除阶段已经存在的祖传关系;我们证明,在甲骨文中,该方法是不受秩序约束的,健全和完整的。对不同数量的变量、时间滞后、样本大小和进一步案例进行广泛的模拟研究表明,我们的方法确实比与因果性相关持续变量有关的现有方法的记忆要高得多,同时将假阳性保持在理想的水平上。我们建议,这种性能随着更强大的自动反应而增长。我们证明,在OZ/Gigh.com/jakorunge/tigramite中,我们为模拟研究中涉及的所有方法都提供Pythoncolgon。