Algorithmic Identification of Essential Exogenous Nodes for Causal Sufficiency in Brain Networks
Not on the map. Why?
Abstract (arXiv)
In the investigation of any causal mechanisms, such as the brain's causal networks, the assumption of causal sufficiency plays a critical role. Notably, neglecting this assumption can result in significant errors, a fact that is often disregarded in the causal analysis of brain networks. In this study, we propose an algorithmic identification approach for determining essential exogenous nodes that satisfy the critical need for causal sufficiency to adhere to it in such inquiries. Our approach consists of three main steps: First, by capturing the essence of the Peter-Clark (PC) algorithm, we conduct independence tests for pairs of regions within a network, as well as for the same pairs conditioned on nodes from other networks. Next, we distinguish candidate confounders by analyzing the differences between the conditional and unconditional results, using the Kolmogorov-Smirnov test. Subsequently, we utilize Non-Factorized identifiable Variational Autoencoders (NF-iVAE) along with the Correlation Coefficient index (CCI) metric to identify the confounding variables within these candidate nodes. Applying our method to the Human Connectome Projects (HCP) movie-watching task data, we demonstrate that while interactions exist between dorsal and ventral regions, only dorsal regions serve as confounders for the visual networks, and vice versa. These findings align consistently with those resulting from the neuroscientific perspective. Finally, we show the reliability of our results by testing 30 independent runs for NF-iVAE initialization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 36 references that are in the map. First posted on arXiv 8 Mar 2024.
Builds on
12 of 36 references.
References · 12
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 494
- 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 186
- 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 135
- 2020High-recall causal discovery for autocorrelated time series with latent confounderscited by 82
- 2023Fast Scalable and Accurate Discovery of DAGs Using the Best Order Score Search and Grow-Shrink Treescited by 38
- 2018Constraint-based Causal Discovery for Non-Linear Structural Causal Models with Cycles and Latent Confounderscited by 35
- 2015The Variational Gaussian Processcited by 29
- 2021Causal Sufficiency and Actual Causationcited by 29
- 2020Causal Discovery with Unobserved Confounding and non-Gaussian Datacited by 24
- 2023Brain Effective Connectome based on fMRI and DTI Data: Bayesian Causal Learning and Assessmentcited by 4
- 2023Discovering Dynamic Effective Connectome of Brain with Bayesian Dynamic DAG Learningcited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.