AIMLJul 14, 2020

Conditional independences and causal relations implied by sets of equations

arXiv:2007.07183v28 citations
AI Analysis

This work addresses limitations in existing causal modelling frameworks like causal Bayesian networks and structural causal models, offering a method for analyzing complex systems in fields such as economics or engineering.

The paper tackles the problem of inferring causal and probabilistic relationships from sets of equations without solving them, using Simon's causal ordering algorithm to construct graphs that encode intervention effects and conditional independences under unique solvability assumptions.

Real-world complex systems are often modelled by sets of equations with endogenous and exogenous variables. What can we say about the causal and probabilistic aspects of variables that appear in these equations without explicitly solving the equations? We make use of Simon's causal ordering algorithm (Simon, 1953) to construct a causal ordering graph and prove that it expresses the effects of soft and perfect interventions on the equations under certain unique solvability assumptions. We further construct a Markov ordering graph and prove that it encodes conditional independences in the distribution implied by the equations with independent random exogenous variables, under a similar unique solvability assumption. We discuss how this approach reveals and addresses some of the limitations of existing causal modelling frameworks, such as causal Bayesian networks and structural causal models.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes