On Identifiability of Conditional Causal Effects

06/19/2023

∙

by   Yaroslav Kivva, et al.

∙

0

∙

share

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(S|do(V∖ S)), where V denotes the set of all observed variables and S⊆ V. We call this problem conditional generalized identifiability (c-gID in short) and prove the completeness of Pearl's do-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(𝐕) as our algorithm generalizes the algorithms proposed in [Kivva et al., 2022] and [Shpitser and Pearl, 2006b].