Causal structure learning: a combinatorial perspective

DOI10.1007/S10208-022-09581-9arXiv2206.01152MaRDI QIDQ6072331FDOQ6072331

Authors: Chandler Squires, Caroline Uhler 

Publication date: 13 October 2023

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: In this review, we discuss approaches for learning causal structure from data, also called causal discovery. In particular, we focus on approaches for learning directed acyclic graphs (DAGs) and various generalizations which allow for some variables to be unobserved in the available data. We devote special attention to two fundamental combinatorial aspects of causal structure learning. First, we discuss the structure of the search space over causal graphs. Second, we discuss the structure of equivalence classes over causal graphs, i.e., sets of graphs which represent what can be learned from observational data alone, and how these equivalence classes can be refined by adding interventional data.

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

zbMATH Keywords

causal inferencecausal structure discoveryMarkov equivalence

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Combinatorics in computer science (68R05) Structural characterization of families of graphs (05C75)

Cites Work

• Causation, prediction, and search
• Title not available (Why is that?)
• Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
• Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
• The Hardness of Conditional Independence Testing and the Generalised Covariance Measure
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• Improving Markov chain Monte Carlo model search for data mining
• Exact Bayesian structure discovery in Bayesian networks
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• Bayesian Graphical Models for Discrete Data
• The max-min hill-climbing Bayesian network structure learning algorithm
• Causality. Models, reasoning, and inference
• Elements of causal inference. Foundations and learning algorithms
• Ancestral graph Markov models.
• Learning Causal Bayesian Network Structures From Experimental Data
• Handbook of Graphical Models
• Title not available (Why is that?)
• Probability distributions with summary graph structure
• Learning optimal Bayesian networks: a shortest path perspective
• Integer linear programming for the Bayesian network structure learning problem
• Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
• External validity: from do-calculus to transportability across populations
• Title not available (Why is that?)
• Geometry of the faithfulness assumption in causal inference
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Identifiability of Gaussian structural equation models with equal error variances
• Marginalizing and conditioning in graphical models
• A linear non-Gaussian acyclic model for causal discovery
• 10.1162/153244303321897717
• Active learning of causal networks with intervention experiments and optimal designs
• PC algorithm for nonparanormal graphical models
• DirectLiNGAM: a direct method for learning a linear non-Gaussian structural equation model
• CAM: causal additive models, high-dimensional order search and penalized regression
• The three faces of faithfulness
• Title not available (Why is that?)
• Structure discovery in Bayesian networks by sampling partial orders
• High-dimensional causal discovery under non-Gaussianity
• Two optimal strategies for active learning of causal models from interventional data
• On scoring maximal ancestral graphs with the max-min hill climbing algorithm
• Unifying Markov properties for graphical models
• Margins of discrete Bayesian networks
• Nested Markov properties for acyclic directed mixed graphs
• Counting Markov equivalence classes for DAG models on trees
• Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
• Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
• High-dimensional consistency in score-based and hybrid structure learning
• Graphs for margins of Bayesian networks
• Title not available (Why is that?)
• Foundations of structural causal models with cycles and latent variables
• Experiment selection for causal discovery
• Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
• Consistency guarantees for greedy permutation-based causal inference algorithms
• Right Singular Vector Projection Graphs: Fast High Dimensional Covariance Matrix Estimation under Latent Confounding
• Title not available (Why is that?)
• Robust Causal Structure Learning with Some Hidden Variables
• An efficient algorithm for counting Markov equivalent DAGs
• Greedy Causal Discovery Is Geometric

Cited In (10)

• Learning directed acyclic graphs by determination of candidate causes for discrete variables
• A formal approach to using data distributions for building causal polytree structures
• Causal learning with Occam's razor
• Causal Structural Learning via Local Graphs
• Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization
• Are there algorithms that discover causal structure?
• Learning Neighborhoods of High Confidence in Constraint-Based Causal Discovery
• Robust Causal Structure Learning with Some Hidden Variables
• Fast causal orientation learning in directed acyclic graphs
• Streaming feature-based causal structure learning algorithm with symmetrical uncertainty

This page was built for publication: Causal structure learning: a combinatorial perspective

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