arxivcs.LG2026-07-07
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…