
























The PC algorithm infers causal relations using conditional independence tests that require a pre-specified Type I $α$ level. PC is however unsupervised, so we cannot tune $α$ using traditional cross-validation. We therefore propose AutoPC, a fast procedure that optimizes $α$ directly for a user chosen metric. We in particular force PC to double check its output by executing a second run on the recovered graph. We choose the final output as the one which maximizes stability between the two runs. AutoPC consistently outperforms the state of the art across multiple metrics.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。