Identifiability of latent causal graphical models without pure children
By: Seunghyun Lee, Yuqi Gu
Potential Business Impact:
Finds hidden causes even with mixed data.
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.
Similar Papers
Nonparametric Factor Analysis and Beyond
Machine Learning (CS)
Finds hidden causes even with messy data.
Identifiable Multi-View Causal Discovery Without Non-Gaussianity
Machine Learning (CS)
Finds how brain parts cause each other's actions.
Causal Identification in Time Series Models
Machine Learning (CS)
Finds hidden causes in changing data.