English

On the Equivalence of Causal Models: A Category-Theoretic Approach

Machine Learning 2022-01-19 v1

Abstract

We develop a category-theoretic criterion for determining the equivalence of causal models having different but homomorphic directed acyclic graphs over discrete variables. Following Jacobs et al. (2019), we define a causal model as a probabilistic interpretation of a causal string diagram, i.e., a functor from the ``syntactic'' category SynG\textsf{Syn}_G of graph GG to the category Stoch\textsf{Stoch} of finite sets and stochastic matrices. The equivalence of causal models is then defined in terms of a natural transformation or isomorphism between two such functors, which we call a Φ\Phi-abstraction and Φ\Phi-equivalence, respectively. It is shown that when one model is a Φ\Phi-abstraction of another, the intervention calculus of the former can be consistently translated into that of the latter. We also identify the condition under which a model accommodates a Φ\Phi-abstraction, when transformations are deterministic.

Keywords

Cite

@article{arxiv.2201.06981,
  title  = {On the Equivalence of Causal Models: A Category-Theoretic Approach},
  author = {Jun Otsuka and Hayato Saigo},
  journal= {arXiv preprint arXiv:2201.06981},
  year   = {2022}
}

Comments

To be presented at the 1st Conference on Causal Learning and Reasoning