Аннотация
Probability trees are one of the simplest models of causal generative
processes. They possess clean semantics and -- unlike causal Bayesian networks
-- they can represent context-specific causal dependencies, which are necessary
for e.g. causal induction. Yet, they have received little attention from the AI
and ML community. Here we present concrete algorithms for causal reasoning in
discrete probability trees that cover the entire causal hierarchy (association,
intervention, and counterfactuals), and operate on arbitrary propositional and
causal events. Our work expands the domain of causal reasoning to a very
general class of discrete stochastic processes.
Пользователи данного ресурса
Пожалуйста,
войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)