English

On Identifiability of Conditional Causal Effects

Artificial Intelligence 2023-06-22 v1 Statistics Theory Statistics Theory

Abstract

We address the problem of identifiability of an arbitrary conditional causal effect given both the causal graph and a set of any observational and/or interventional distributions of the form Q[S]:=P(Sdo(VS))Q[S]:=P(S|do(V\setminus S)), where VV denotes the set of all observed variables and SVS\subseteq V. We call this problem conditional generalized identifiability (c-gID in short) and prove the completeness of Pearl's dodo-calculus for the c-gID problem by providing sound and complete algorithm for the c-gID problem. This work revisited the c-gID problem in Lee et al. [2020], Correa et al. [2021] by adding explicitly the positivity assumption which is crucial for identifiability. It extends the results of [Lee et al., 2019, Kivva et al., 2022] on general identifiability (gID) which studied the problem for unconditional causal effects and Shpitser and Pearl [2006b] on identifiability of conditional causal effects given merely the observational distribution P(V)P(\mathbf{V}) as our algorithm generalizes the algorithms proposed in [Kivva et al., 2022] and [Shpitser and Pearl, 2006b].

Cite

@article{arxiv.2306.11755,
  title  = {On Identifiability of Conditional Causal Effects},
  author = {Yaroslav Kivva and Jalal Etesami and Negar Kiyavash},
  journal= {arXiv preprint arXiv:2306.11755},
  year   = {2023}
}
R2 v1 2026-06-28T11:09:58.875Z