Identifiability of latent causal graphical models without pure children

Seunghyun Lee, Yuqi Gu
5/23/2025
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

This paper considers a challenging problem of identifying a causal graphical model under the presence of latent variables. While various identifiability conditions have been proposed in the literature, they often require multiple pure children per latent variable or restrictions on the latent causal graph. Furthermore, it is common for all observed variables to exhibit the same modality. Consequently, the existing identifiability conditions are often too stringent for complex real-world data. We consider a general nonparametric measurement model with arbitrary observed variable types and binary latent variables, and propose a double triangular graphical condition that guarantees identifiability of the entire causal graphical model. The proposed condition significantly relaxes the popular pure children condition. We also establish necessary conditions for identifiability and provide valuable insights into fundamental limits of identifiability. Simulation studies verify that latent structures satisfying our conditions can be accurately estimated from data.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lee2025identifiability,
  title  = {Identifiability of latent causal graphical models without pure children},
  author = {Seunghyun Lee and Yuqi Gu},
  year   = {2025},
  eprint = {2505.18410},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.18410v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.18410.svg)](https://codeofpaper.com/paper/2505.18410)

Discussion