Causal structure learning: a combinatorial perspective
From MaRDI portal
Publication:6072331
DOI10.1007/s10208-022-09581-9arXiv2206.01152MaRDI QIDQ6072331
Caroline Uhler, Chandler Squires
Publication date: 13 October 2023
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.01152
Combinatorics in computer science (68R05) Structural characterization of families of graphs (05C75) Probabilistic graphical models (62H22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- External validity: from do-calculus to transportability across populations
- Geometry of the faithfulness assumption in causal inference
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- CAM: causal additive models, high-dimensional order search and penalized regression
- Integer linear programming for the Bayesian network structure learning problem
- The three faces of faithfulness
- Probability distributions with summary graph structure
- The max-min hill-climbing Bayesian network structure learning algorithm
- Causation, prediction, and search
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Improving Markov chain Monte Carlo model search for data mining
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- Counting Markov equivalence classes for DAG models on trees
- Unifying Markov properties for graphical models
- Ancestral graph Markov models.
- Marginalizing and conditioning in graphical models
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Margins of discrete Bayesian networks
- High-dimensional consistency in score-based and hybrid structure learning
- Foundations of structural causal models with cycles and latent variables
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- Two optimal strategies for active learning of causal models from interventional data
- An efficient algorithm for counting Markov equivalent DAGs
- Graphs for Margins of Bayesian Networks
- Learning Optimal Bayesian Networks: A Shortest Path Perspective
- PC algorithm for Gaussian copula graphical models
- Learning Causal Bayesian Network Structures From Experimental Data
- Handbook of Graphical Models
- 10.1162/153244303321897717
- Bayesian Graphical Models for Discrete Data
- Consistency guarantees for greedy permutation-based causal inference algorithms
- Right Singular Vector Projection Graphs: Fast High Dimensional Covariance Matrix Estimation under Latent Confounding
- High-dimensional causal discovery under non-Gaussianity
- Robust Causal Structure Learning with Some Hidden Variables
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- Identifiability of Gaussian structural equation models with equal error variances
- Greedy Causal Discovery Is Geometric
- Nested Markov properties for acyclic directed mixed graphs
This page was built for publication: Causal structure learning: a combinatorial perspective