Learning high-dimensional directed acyclic graphs with latent and selection variables
From MaRDI portal
(Redirected from Publication:450035)
Abstract: We consider the problem of learning causal information between random variables in directed acyclic graphs (DAGs) when allowing arbitrarily many latent and selection variables. The FCI (Fast Causal Inference) algorithm has been explicitly designed to infer conditional independence and causal information in such settings. However, FCI is computationally infeasible for large graphs. We therefore propose the new RFCI algorithm, which is much faster than FCI. In some situations the output of RFCI is slightly less informative, in particular with respect to conditional independence information. However, we prove that any causal information in the output of RFCI is correct in the asymptotic limit. We also define a class of graphs on which the outputs of FCI and RFCI are identical. We prove consistency of FCI and RFCI in sparse high-dimensional settings, and demonstrate in simulations that the estimation performances of the algorithms are very similar. All software is implemented in the R-package pcalg.
Recommendations
Cites work
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- 10.1162/153244302760200696
- A characterization of Markov equivalence classes for acyclic digraphs
- Ancestral graph Markov models.
- Causal inference in statistics: an overview
- Causal reasoning with ancestral graphs
- Causation, prediction, and search
- Conditional independence for statistical operations
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimating high-dimensional intervention effects from observational data
- High-dimensional graphs and variable selection with the Lasso
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Markov equivalence for ancestral graphs
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
Cited in
(39)- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Learning genetic and environmental graphical models from family data
- Computation of maximum likelihood estimates in cyclic structural equation models
- Causal learning via manifold regularization
- Learning causal structure from mixed data with missing values using Gaussian copula models
- Learning minimal latent directed information polytrees
- scientific article; zbMATH DE number 1523328 (Why is no real title available?)
- scientific article; zbMATH DE number 1471369 (Why is no real title available?)
- Learning Bayesian network structures using weakest mutual-information-first strategy
- Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
- Marginal integration for nonparametric causal inference
- Structural intervention distance for evaluating causal graphs
- An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- Causal Structural Learning via Local Graphs
- Discovery and Inference of a Causal Network with Hidden Confounding
- Causal structure learning: a combinatorial perspective
- scientific article; zbMATH DE number 7626781 (Why is no real title available?)
- Improved baselines for causal structure learning on interventional data
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- A uniformly consistent estimator of causal effects under the \(k\)-triangle-faithfulness assumption
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- Empirical likelihood for linear structural equation models with dependent errors
- Uniform random generation of large acyclic digraphs
- A generalized back-door criterion
- Nonparametric estimation of a latent variable model
- Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
- A survey on causal discovery: theory and practice
- Robust Causal Structure Learning with Some Hidden Variables
- CAM: causal additive models, high-dimensional order search and penalized regression
- Nonlinear Causal Discovery with Confounders
- Order-independent constraint-based causal structure learning
- Towards a fast and efficient algorithm for learning Bayesian network
- High-dimensional learning of linear causal networks via inverse covariance estimation
- Learning causal graphs with latent confounders in weak faithfulness violations
- Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
- Log-mean linear parameterization for discrete graphical models of marginal independence and the analysis of dichotomizations
- Estimating bounds on causal effects in high-dimensional and possibly confounded systems
This page was built for publication: Learning high-dimensional directed acyclic graphs with latent and selection variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450035)
