Hierarchical Topological Ordering with Conditional Independence Test for Limited Time Series
Not on the map. Why?
Abstract (arXiv)
Learning directed acyclic graphs (DAGs) to identify causal relations underlying observational data is crucial but also poses significant challenges. Recently, topology-based methods have emerged as a two-step approach to discovering DAGs by first learning the topological ordering of variables and then eliminating redundant edges, while ensuring that the graph remains acyclic. However, one limitation is that these methods would generate numerous spurious edges that require subsequent pruning. To overcome this limitation, in this paper, we propose an improvement to topology-based methods by introducing limited time series data, consisting of only two cross-sectional records that need not be adjacent in time and are subject to flexible timing. By incorporating conditional instrumental variables as exogenous interventions, we aim to identify descendant nodes for each variable. Following this line, we propose a hierarchical topological ordering algorithm with conditional independence test (HT-CIT), which enables the efficient learning of sparse DAGs with a smaller search space compared to other popular approaches. The HT-CIT algorithm greatly reduces the number of edges that need to be pruned. Empirical results from synthetic and real-world datasets demonstrate the superiority of the proposed HT-CIT algorithm.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 50 references that are in the map. First posted on arXiv 16 Aug 2023.
Builds on
24 of 50 references.
References · 24
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
- 2013Causal Discovery with Continuous Additive Noise Modelscited by 252
- 2017Detecting causal associations in large nonlinear time series datasetscited by 240
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 186
- 2013CAM: Causal additive models, high-dimensional order search and penalized regressioncited by 175
- 2019Causal Discovery from Heterogeneous/Nonstationary Data with Independent Changescited by 166
- 2019Causal Discovery with Reinforcement Learningcited by 145
- 2019Learning Neural Causal Models from Unknown Interventionscited by 113
- 2022Score matching enables causal discovery of nonlinear additive noise modelscited by 108
12 more
- 2020Amortized Causal Discovery: Learning to Infer Causal Graphs from Time-Series Datacited by 99
- 2013High-dimensional learning of linear causal networks via inverse covariance estimationcited by 86
- 2017Permutation-based Causal Inference Algorithms with Interventionscited by 78
- 2018Characterizing and Learning Equivalence Classes of Causal DAGs under Interventionscited by 76
- 2017Conditional independence testing based on a nearest-neighbor estimator of conditional mutual informationcited by 70
- 2022Diffusion Models for Causal Discovery via Topological Orderingcited by 64
- 2017Learning linear structural equation models in polynomial time and sample complexitycited by 49
- 2023Causal Discovery with Score Matching on Additive Models with Arbitrary Noisecited by 41
- 2019Conditional Independence Testing using Generative Adversarial Networkscited by 36
- 2020Neural Additive Vector Autoregression Models for Causal Discovery in Time Seriescited by 28
- 2017Bayesian Network Learning via Topological Ordercited by 14
- 2021FRITL: A Hybrid Method for Causal Discovery in the Presence of Latent Confounderscited by 6
Built on by
Citing papers per year: 2024: 1.
1 paper.