.png){kind=icon}
Return
Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2023.2220169.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. Supplementary materials for this article are available online.
Keywords:
Brain connectivity networks
Directed acyclic graph
Generative adversarial networks
Hypothesis testing
Multilayer perceptron neural networks
Journal
J
IF:
3
Papers:
5.2K
Citations:
4.8W
Organization
Cited Papers
ShareSaveCAM: CAUSAL ADDITIVE MODELS, HIGH-DIMENSIONAL ORDER SEARCH AND PENALIZED REGRESSION.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAIShareSaveStabilization of Clayey Soil with Garlic Skin and Rice Husk Ash for Flexible Pavement Construction
PREAI
ShareSaveShareSaveShareSave
View more