Structural Intervention Distance for Evaluating Causal Graphs

DOI10.1162/NECO_a_00708zbMath1414.05094arXiv1306.1043OpenAlexW2116993992WikidataQ50974236 ScholiaQ50974236MaRDI QIDQ5380224

Jonas Peters, Peter Bühlmann

Publication date: 4 June 2019

Published in: Neural Computation (Search for Journal in Brave)

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

zbMATH Keywords

directed acyclic graphCausal inference

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

Causal discovery in heavy-tailed models, Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization, On scoring maximal ancestral graphs with the max-min hill climbing algorithm, Structural learning and estimation of joint causal effects among network-dependent variables, Kernel-Based Tests for Joint Independence, A survey on causal discovery: theory and practice

Uses Software

• pcalg
• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• CAM: causal additive models, high-dimensional order search and penalized regression
• The max-min hill-climbing Bayesian network structure learning algorithm
• Matrix multiplication via arithmetic progressions
• Causation, prediction, and search
• A characterization of Markov equivalence classes for acyclic digraphs
• Ancestral graph Markov models.
• Estimating the effect of joint interventions from observational data in sparse high-dimensional settings
• 10.1162/153244303321897717
• Identifiability of Gaussian structural equation models with equal error variances