菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-07-07
📄 Abstract - Learning Sparsest Linear Causal DAGs with Latent Confounders via Higher-Order Cumulants

Recovering the exact directed acyclic graph (DAG) in linear non-Gaussian acyclic models with latent confounders (LvLiNGAM) remains a challenging problem. Although LvLiNGAM is identifiable only up to an observational equivalence class, each equivalence class is characterized by a unique sparsest DAG. Recovering the sparsest DAG from finite samples, however, remains difficult. Although existing methods are asymptotically consistent, they do not provide an explicit finite-sample procedure for recovering the unique sparsest DAG, nor do they handle models with an arbitrary number of latent confounders. In this paper, we propose a finite-sample method for recovering the sparsest DAG without imposing any restriction on the number of latent confounders. Simulation studies and real-data analyses demonstrate that the proposed method achieves superior finite-sample performance compared with existing approaches.

顶级标签: machine learning theory
详细标签: causal discovery directed acyclic graphs latent confounders non-gaussian models finite-sample method 或 搜索:

利用高阶累积量学习存在潜在混淆变量的最稀疏线性因果有向无环图 / Learning Sparsest Linear Causal DAGs with Latent Confounders via Higher-Order Cumulants


1️⃣ 一句话总结

本文提出了一种有限样本方法,通过高阶累积量从数据中恢复存在任意数量未观测混淆变量的线性非高斯因果有向无环图,并找到其唯一最稀疏的结构,在模拟和真实数据分析中表现优于现有方法。

源自 arXiv: 2607.05984