Causal Structural Learning via Local Graphs

DOI10.1137/20M1362796zbMATH Open1520.62009arXiv2107.03597OpenAlexW4381941003MaRDI QIDQ6104311FDOQ6104311

Authors: Wenyu Chen, Mathias Drton, Ali Shojaie 

Publication date: 28 June 2023

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Abstract: We consider the problem of learning causal structures in sparse high-dimensional settings that may be subject to the presence of (potentially many) unmeasured confounders, as well as selection bias. Based on the structure found in common families of large random networks and examining the representation of local structures in linear structural equation models (SEM), we propose a new local notion of sparsity for consistent structure learning in the presence of latent and selection variables, and develop a new version of the Fast Causal Inference (FCI) algorithm with reduced computational and sample complexity, which we refer to as local FCI (lFCI). The new notion of sparsity allows the presence of highly connected hub nodes, which are common in real-world networks, but problematic for existing methods. Our numerical experiments indicate that the lFCI algorithm achieves state-of-the-art performance across many classes of large random networks, and its performance is superior to that of existing methods for networks containing hub nodes.

Full work available at URL: https://arxiv.org/abs/2107.03597

Recommendations

• Local causal network learning for finding pairs of total and direct effects
• Local structure learning in graphical models
• Causal structure learning: a combinatorial perspective
• Local causal structure learning for streaming features
• Causal Graphical Models with Latent Variables: Learning and Inference
• Causal Graphical Models with Latent Variables: Learning and Inference
• scientific article; zbMATH DE number 1222293
• Causal inference from graphical models
• Stationary-sparse causality network learning

zbMATH Keywords

causal inferencegraphical modelsalgorithmhigh-dimensionallatent variablestructural learning

Mathematics Subject Classification ID

Multivariate analysis (62H99) Applications of statistics to biology and medical sciences; meta analysis (62P10) Learning and adaptive systems in artificial intelligence (68T05) Parametric inference (62F99)

Cites Work

• Order-independent constraint-based causal structure learning
• Causation, prediction, and search
• Sparse inverse covariance estimation with the graphical lasso
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• The max-min hill-climbing Bayesian network structure learning algorithm
• High-dimensional structure estimation in Ising models: local separation criterion
• Ancestral graph Markov models.
• High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
• Handbook of Graphical Models
• Trek separation for Gaussian graphical models
• Estimation of high-dimensional graphical models using regularized score matching
• A critical point for random graphs with a given degree sequence
• Collective dynamics of `small-world' networks
• Estimating the error variance in a high-dimensional linear model
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Random graphs.
• Complex graphs and networks
• Markov equivalence for ancestral graphs
• Ising models on locally tree-like graphs
• Short cycles in random regular graphs
• Ising models on power-law random graphs
• High-dimensional Gaussian graphical model selection: walk summability and local separation criterion
• Binary Models for Marginal Independence
• Fast and adaptive sparse precision matrix estimation in high dimensions
• Positivity for Gaussian graphical models
• PC algorithm for nonparanormal graphical models
• On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
• Title not available (Why is that?)
• The reduced PC-algorithm: improved causal structure learning in large random networks

Cited In (10)

• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part II: Analysis and extensions
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Title not available (Why is that?)
• Using Markov blankets for causal structure learning
• Causal Structural Learning on MPHIA Individual Dataset
• Learning Neighborhoods of High Confidence in Constraint-Based Causal Discovery
• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
• Learning causal graphs with latent confounders in weak faithfulness violations
• Local causal structure learning for streaming features
• Fast causal orientation learning in directed acyclic graphs

This page was built for publication: Causal Structural Learning via Local Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104311)