1 citations · 2 across the 6 of their papers we have counts for
3 papers · 1 filter
Tractable Bounding of Counterfactual Queries by Knowledge Compilation
David Huber, Yizuo Chen, Alessandro Antonucci +2
We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an i…
Efficient Computation of Counterfactual Bounds
Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas +2
We assume to be given structural equations over discrete variables inducing a directed acyclic graph, namely, a structural causal model, together with data about its internal nodes…
Learning to Bound Counterfactual Inference from Observational, Biased and Randomised Data
Marco Zaffalon, Alessandro Antonucci, David Huber +1
We address the problem of integrating data from multiple, possibly biased, observational and interventional studies, to eventually compute counterfactuals in structural causal mode…