Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning

Abstract

In this article, we propose a new hypothesis testing method for directed acyclic graph (DAG). While there is a rich class of DAG estimation methods, there is a relative paucity of DAG inference solutions. Moreover, the existing methods often impose some specific model structures such as linear models or additive models, and assume independent data observations. Our proposed test instead allows the associations among the random variables to be nonlinear and the data to be time-dependent. We build the test based on some highly flexible neural networks learners. We establish the asymptotic guarantees of the test, while allowing either the number of subjects or the number of time points for each subject to diverge to infinity. We demonstrate the efficacy of the test through simulations and a brain connectivity network analysis.

References in corpus (8)

• Scikit-learn: Machine Learning in Python
• A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications
• DAGs with NO TEARS: Continuous Optimization for Structure Learning
• DAG-GNN: DAG Structure Learning with Graph Neural Networks
• ${\ell }_0$-penalized maximum likelihood for sparse directed acyclic graphs
• Causal Discovery with Reinforcement Learning
• How Well Generative Adversarial Networks Learn Distributions
• Estimating beta-mixing coefficients via histograms