.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Brain connectivity networks
Directed acyclic graph
Generative adversarial networks
Hypothesis testing
Multilayer perceptron neural networks
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
Large-scale brain networks and psychopathology: a unifying triple network model大规模脑网络和精神病理学: 统一的三重网络模型
PREAI
分享收藏CAM: CAUSAL ADDITIVE MODELS, HIGH-DIMENSIONAL ORDER SEARCH AND PENALIZED REGRESSION.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏Stabilization of Clayey Soil with Garlic Skin and Rice Husk Ash for Flexible Pavement Construction
PREAI
分享收藏
查看更多内容