Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning
From MaRDI portal
Cites work
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- \(p\)-values for high-dimensional regression
- A Limited Memory Algorithm for Bound Constrained Optimization
- Basic properties of strong mixing conditions. A survey and some open questions
- CAM: causal additive models, high-dimensional order search and penalized regression
- Causality. Models, reasoning, and inference
- Constrained likelihood for reconstructing a directed acyclic Gaussian graph
- Deep neural networks for estimation and inference
- Double/debiased machine learning for treatment and structural parameters
- Estimating beta-mixing coefficients via histograms
- Gaussian approximation of suprema of empirical processes
- scientific article; zbMATH DE number 6378135 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- scientific article; zbMATH DE number 7626800 (Why is no real title available?)
- Inference in high-dimensional graphical models
- Joint estimation of multiple graphical models from high dimensional time series
- Large-sample learning of Bayesian networks is NP-hard
- Likelihood ratio tests for a large directed acyclic graph
- 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
- On nonparametric conditional independence tests for continuous variables
- Scikit-learn: machine learning in Python
- The Hardness of Conditional Independence Testing and the Generalised Covariance Measure
- The use of subseries values for estimating the variance of a general statistic from a stationary sequence
This page was built for publication: Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631683)