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

DOI10.1080/01621459.2023.2220169MaRDI QIDQ6631683

Yunzhe Zhou, Chengchun Shi, Lexin Li

Publication date: 1 November 2024

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hardness of Conditional Independence Testing and the Generalised Covariance Measure
• \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
• Gaussian approximation of suprema of empirical processes
• CAM: causal additive models, high-dimensional order search and penalized regression
• Estimating beta-mixing coefficients via histograms
• Basic properties of strong mixing conditions. A survey and some open questions
• The use of subseries values for estimating the variance of a general statistic from a stationary sequence
• Minimax estimation of a functional on a structured high-dimensional model
• On deep learning as a remedy for the curse of dimensionality in nonparametric regression
• p-Values for High-Dimensional Regression
• A Limited Memory Algorithm for Bound Constrained Optimization
• Deep Neural Networks for Estimation and Inference
• Double/debiased machine learning for treatment and structural parameters
• Likelihood Ratio Tests for a Large Directed Acyclic Graph
• Inference in high-dimensional graphical models
• Joint Estimation of Multiple Graphical Models from High Dimensional Time Series
• Constrained likelihood for reconstructing a directed acyclic Gaussian graph
• On nonparametric conditional independence tests for continuous variables

This page was built for publication: Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning