Causal Expectation-Maximisation
- URL: http://arxiv.org/abs/2011.02912v3
- Date: Mon, 22 Nov 2021 11:16:46 GMT
- Title: Causal Expectation-Maximisation
- Authors: Marco Zaffalon and Alessandro Antonucci and Rafael Caba\~nas
- Abstract summary: We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs.
We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables.
We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
- Score: 70.45873402967297
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Structural causal models are the basic modelling unit in Pearl's causal
theory; in principle they allow us to solve counterfactuals, which are at the
top rung of the ladder of causation. But they often contain latent variables
that limit their application to special settings. This appears to be a
consequence of the fact, proven in this paper, that causal inference is NP-hard
even in models characterised by polytree-shaped graphs. To deal with such a
hardness, we introduce the causal EM algorithm. Its primary aim is to
reconstruct the uncertainty about the latent variables from data about
categorical manifest variables. Counterfactual inference is then addressed via
standard algorithms for Bayesian networks. The result is a general method to
approximately compute counterfactuals, be they identifiable or not (in which
case we deliver bounds). We show empirically, as well as by deriving credible
intervals, that the approximation we provide becomes accurate in a fair number
of EM runs. These results lead us finally to argue that there appears to be an
unnoticed limitation to the trending idea that counterfactual bounds can often
be computed without knowledge of the structural equations.
Related papers
- Causal Discovery of Linear Non-Gaussian Causal Models with Unobserved Confounding [1.6932009464531739]
We consider linear non-Gaussian structural equation models that involve latent confounding.
In this setting, the causal structure is identifiable, but, in general, it is not possible to identify the specific causal effects.
arXiv Detail & Related papers (2024-08-09T07:24:12Z) - Effective Bayesian Causal Inference via Structural Marginalisation and Autoregressive Orders [16.682775063684907]
We decompose the structure learning problem into inferring causal order and a parent set for each variable given a causal order.
Our method yields state-of-the-art in structure learning on simulated non-linear additive noise benchmarks with scale-free and Erdos-Renyi graph structures.
arXiv Detail & Related papers (2024-02-22T18:39:24Z) - Efficient Computation of Counterfactual Bounds [44.4263314637532]
We compute exact counterfactual bounds via algorithms for credal nets on a subclass of structural causal models.
We evaluate their accuracy by providing credible intervals on the quality of the approximation.
arXiv Detail & Related papers (2023-07-17T07:59:47Z) - Partial Counterfactual Identification of Continuous Outcomes with a
Curvature Sensitivity Model [30.77874108094485]
We propose a novel sensitivity model called Curvature Sensitivity Model.
This allows us to obtain informative bounds by bounding the curvature of level sets of the functions.
We then propose an implementation of our Curvature Sensitivity Model in the form of a novel deep generative model.
arXiv Detail & Related papers (2023-06-02T10:30:37Z) - Active Bayesian Causal Inference [72.70593653185078]
We propose Active Bayesian Causal Inference (ABCI), a fully-Bayesian active learning framework for integrated causal discovery and reasoning.
ABCI jointly infers a posterior over causal models and queries of interest.
We show that our approach is more data-efficient than several baselines that only focus on learning the full causal graph.
arXiv Detail & Related papers (2022-06-04T22:38:57Z) - The Causal Marginal Polytope for Bounding Treatment Effects [9.196779204457059]
We propose a novel way to identify causal effects without constructing a global causal model.
We enforce compatibility between marginals of a causal model and data, without constructing a global causal model.
We call this collection of locally consistent marginals the causal marginal polytope.
arXiv Detail & Related papers (2022-02-28T15:08:22Z) - Systematic Evaluation of Causal Discovery in Visual Model Based
Reinforcement Learning [76.00395335702572]
A central goal for AI and causality is the joint discovery of abstract representations and causal structure.
Existing environments for studying causal induction are poorly suited for this objective because they have complicated task-specific causal graphs.
In this work, our goal is to facilitate research in learning representations of high-level variables as well as causal structures among them.
arXiv Detail & Related papers (2021-07-02T05:44:56Z) - Variational Causal Networks: Approximate Bayesian Inference over Causal
Structures [132.74509389517203]
We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs.
In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
arXiv Detail & Related papers (2021-06-14T17:52:49Z) - Disentangling Observed Causal Effects from Latent Confounders using
Method of Moments [67.27068846108047]
We provide guarantees on identifiability and learnability under mild assumptions.
We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
arXiv Detail & Related papers (2021-01-17T07:48:45Z) - Structural Causal Models Are (Solvable by) Credal Networks [70.45873402967297]
Causal inferences can be obtained by standard algorithms for the updating of credal nets.
This contribution should be regarded as a systematic approach to represent structural causal models by credal networks.
Experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.
arXiv Detail & Related papers (2020-08-02T11:19:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.