跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.04133 · v2

LNML-based Causal Discovery with Latent Confounders: Theory and Experiments

首次提交 2026-07-05 14:19
版本更新 2026-11-03 01:27
雷达观测 2026-11-04 23:41
arXiv ↗PDF ↗

摘要

Causal discovery with nonlinear mechanisms and latent confounders remains challenging. Existing methods often rely on either linear assumptions or causal sufficiency, limiting their applicability. We propose an MDL-based causal discovery framework that accommodates latent confounders and flexible nonlinear mechanisms using the luckiness normalized maximum likelihood (LNML) code-length. To complement code-length-based model selection, we introduce $Δ$-pseudo-collinearity as a criterion for identifying potential latent-confounding candidates. We theoretically show that, in the presence of a latent confounder, the directional code-length gap $Δ$ admits an upper bound that grows at most linearly with the sample size and decreases as the latent causal mechanisms become more similar, providing support for the proposed criterion. Based on this formulation, we develop a greedy algorithm, termed Pseudo-Collinearity Guided Causal Discovery (PCG-CD). Experiments on synthetic and real-world datasets demonstrate the ability of PCG-CD to recover directed causal relationships and identify potential latent-confounding candidates, while revealing limitations in latent-confounder discrimination.

作者备注:Extended version of the ECML PKDD 2026 paper titled "MDL Meets Latent Confounders: LNML-Based Causal Discovery," with additional theoretical results and experiments. The experimental implementation has been corrected, and the results have been updated accordingly

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-03 01:27 · 最新观测版本

LNML-based Causal Discovery with Latent Confounders: Theory and Experiments

Causal discovery with nonlinear mechanisms and latent confounders remains challenging. Existing methods often rely on either linear assumptions or causal sufficiency, limiting their applicability. We propose an MDL-based causal discovery framework that accommodates latent confounders and flexible nonlinear mechanisms using the luckiness normalized maximum likelihood (LNML) code-length. To complement code-length-based model selection, we introduce $Δ$-pseudo-collinearity as a criterion for identifying potential latent-confounding candidates. We theoretically show that, in the presence of a latent confounder, the directional code-length gap $Δ$ admits an upper bound that grows at most linearly with the sample size and decreases as the latent causal mechanisms become more similar, providing support for the proposed criterion. Based on this formulation, we develop a greedy algorithm, termed Pseudo-Collinearity Guided Causal Discovery (PCG-CD). Experiments on synthetic and real-world datasets demonstrate the ability of PCG-CD to recover directed causal relationships and identify potential latent-confounding candidates, while revealing limitations in latent-confounder discrimination.

查看此版本解读 →查看此版本原文 ↗