arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.03092cs.AIcs.DMcs.LG
收藏

在环有向图中建立马尔可夫等价性

Establishing Markov Equivalence in Cyclic Directed Graphs

Radboud University Nijmegen(奈梅亨拉德堡德大学);University of Amsterdam(阿姆斯特丹大学)

Tom Claassen, Joris M. Mooij

AI总结:

提出基于祖先视角重新表述的环等价定理,建立无需 d-分离测试的环有向图马尔可夫等价性判定程序,显著降低算法复杂度并推动潜在混杂下的环发现研究。

摘要:

我们提出了一种新的、高效的程序,用于在 d-分离准则下建立可能包含或不包含环的有向图之间的马尔可夫等价性。它基于 Thomas Richardson 在 90 年代中期关于环模型的开创性工作中的环等价定理(CET),但现在从祖先视角进行了重新表述。由此产生的特征化导致了一种建立图之间马尔可夫等价性的程序,该程序不再需要 d-分离测试,从而显著降低了算法复杂度。这种概念上的简化特征化可能有助于重新激发在存在潜在混杂因素的情况下进行可靠且完整的环发现的理论研究。此版本包含对定理 1 中规则 (iv) 的更正,以及算法 2 第 2 部分的后续调整。

英文摘要:

We present a new, efficient procedure to establish Markov equivalence between directed graphs that may or may not contain cycles under the \textit{d}-separation criterion. It is based on the Cyclic Equivalence Theorem (CET) in the seminal works on cyclic models by Thomas Richardson in the mid '90s, but now rephrased from an ancestral perspective. The resulting characterization leads to a procedure for establishing Markov equivalence between graphs that no longer requires tests for d-separation, leading to a significantly reduced algorithmic complexity. The conceptually simplified characterization may help to reinvigorate theoretical research towards sound and complete cyclic discovery in the presence of latent confounders. This version includes a correction to rule (iv) in Theorem 1, and the subsequent adjustment in part 2 of Algorithm 2.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑