Cookies?
Library Header Image
LSE Research Online LSE Library Services

Testing directed acyclic graph via structural, supervised and generative adversarial learning

Shi, Chengchun, Zhou, Yunzhe and Li, Lexin (2023) Testing directed acyclic graph via structural, supervised and generative adversarial learning. Journal of the American Statistical Association. ISSN 0162-1459

[img] Text (Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Networks) - Accepted Version
Repository staff only until 12 July 2024.

Download (1MB) | Request a copy

Identification Number: 10.1080/01621459.2023.2220169

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. Supplementary materials for this article are available online.

Item Type: Article
Official URL: https://www.tandfonline.com/toc/uasa20
Additional Information: © 2023 American Statistical Association
Divisions: Statistics
Subjects: H Social Sciences > HA Statistics
Date Deposited: 19 Jun 2023 15:42
Last Modified: 16 Jun 2024 20:24
URI: http://eprints.lse.ac.uk/id/eprint/119446

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics