arXiv Analytics

Sign in

arXiv:2311.00674 [stat.ML]AbstractReferencesReviewsResources

Recovering Linear Causal Models with Latent Variables via Cholesky Factorization of Covariance Matrix

Yunfeng Cai, Xu Li, Minging Sun, Ping Li

Published 2023-11-01Version 1

Discovering the causal relationship via recovering the directed acyclic graph (DAG) structure from the observed data is a well-known challenging combinatorial problem. When there are latent variables, the problem becomes even more difficult. In this paper, we first propose a DAG structure recovering algorithm, which is based on the Cholesky factorization of the covariance matrix of the observed data. The algorithm is fast and easy to implement and has theoretical grantees for exact recovery. On synthetic and real-world datasets, the algorithm is significantly faster than previous methods and achieves the state-of-the-art performance. Furthermore, under the equal error variances assumption, we incorporate an optimization procedure into the Cholesky factorization based algorithm to handle the DAG recovering problem with latent variables. Numerical simulations show that the modified "Cholesky + optimization" algorithm is able to recover the ground truth graph in most cases and outperforms existing algorithms.

Related articles: Most relevant | Search more
arXiv:2004.06481 [stat.ML] (Published 2020-04-14)
The covariance matrix of Green's functions and its application to machine learning
arXiv:1204.2069 [stat.ML] (Published 2012-04-10, updated 2014-02-20)
Asymptotic Accuracy of Distribution-Based Estimation for Latent Variables
arXiv:2407.01686 [stat.ML] (Published 2024-07-01)
Everything that can be learned about a causal structure with latent variables by observational and interventional probing schemes