Recovering Linear Causal Models with Latent Variables via Cholesky Factorization of Covariance Matrix
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 59 references that are in the map. First posted on arXiv 1 Nov 2023.
Builds on
23 of 59 references.
References · 23
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 331
- 2013Causal Discovery with Continuous Additive Noise Modelscited by 255
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2013CAM: Causal additive models, high-dimensional order search and penalized regressioncited by 178
- 2013Causal Inference in the Presence of Latent Variables and Selection Biascited by 166
- 2019Masked Gradient-Based Causal Structure Learningcited by 89
- 2018On Causal Discovery with Equal Variance Assumptioncited by 59
- 2019A Graph Autoencoder Approach to Causal Structure Learningcited by 55
- 2021Ordering-Based Causal Discovery with Reinforcement Learningcited by 55
- 2017Learning linear structural equation models in polynomial time and sample complexitycited by 51
11 more
- 2019Learning Linear Non-Gaussian Causal Models in the Presence of Latent Variablescited by 39
- 2019Scaling structural learning with NO-BEARS to infer causal transcriptome networkscited by 39
- 2020A polynomial-time algorithm for learning nonparametric causal graphscited by 30
- 2013ParceLiNGAM: A causal ordering method robust against latent confounderscited by 29
- 2014Concave Penalized Estimation of Sparse Gaussian Bayesian Networkscited by 28
- 2017Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexitycited by 27
- 2021Iterative Causal Discovery in the Possible Presence of Latent Confounders and Selection Biascited by 21
- 2020Efficient and Scalable Structure Learning for Bayesian Networks: Algorithms and Applicationscited by 11
- 2019Optimizing regularized Cholesky score for order-based learning of Bayesian networkscited by 10
- 2020Efficient Permutation Discovery in Causal DAGscited by 5
- 2022Variational Flow Graphical Modelcited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.