Obtaining Causal Information by Merging Datasets with MAXENT

• URL: http://arxiv.org/abs/2107.07640v1
• Date: Thu, 15 Jul 2021 23:16:36 GMT
• Title: Obtaining Causal Information by Merging Datasets with MAXENT
• Authors: Sergio Hernan Garrido Mejia, Elke Kirschbaum, Dominik Janzing
• Abstract summary: We discuss how causal knowledge can be obtained without having observed all variables jointly. We derive bounds on the interventional distribution and the average causal effect of a treatment on a target variable in the presence of confounders.
• Score: 12.64433334351049
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The investigation of the question "which treatment has a causal effect on a target variable?" is of particular relevance in a large number of scientific disciplines. This challenging task becomes even more difficult if not all treatment variables were or even cannot be observed jointly with the target variable. Another similarly important and challenging task is to quantify the causal influence of a treatment on a target in the presence of confounders. In this paper, we discuss how causal knowledge can be obtained without having observed all variables jointly, but by merging the statistical information from different datasets. We first show how the maximum entropy principle can be used to identify edges among random variables when assuming causal sufficiency and an extended version of faithfulness. Additionally, we derive bounds on the interventional distribution and the average causal effect of a treatment on a target variable in the presence of confounders. In both cases we assume that only subsets of the variables have been observed jointly.

Related papers

• Unsupervised Pairwise Causal Discovery on Heterogeneous Data using Mutual Information Measures [49.1574468325115]
  Causal Discovery is a technique that tackles the challenge by analyzing the statistical properties of the constituent variables. We question the current (possibly misleading) baseline results on the basis that they were obtained through supervised learning. In consequence, we approach this problem in an unsupervised way, using robust Mutual Information measures.
  arXiv  Detail & Related papers  (2024-08-01T09:11:08Z)
• Causal Inference with Latent Variables: Recent Advances and Future Prospectives [43.04559575298597]
  Causal inference (CI) aims to infer intrinsic causal relations among variables of interest. The lack of observation of important variables severely compromises the reliability of CI methods. Various consequences can be incurred if these latent variables are carelessly handled.
  arXiv  Detail & Related papers  (2024-06-20T03:15:53Z)
• Tightening Bounds on Probabilities of Causation By Merging Datasets [0.0]
  Probabilities of Causation (PoC) play a fundamental role in decision-making in law, health care and public policy. Existing work to further tighten these bounds by leveraging extra information either provides numerical bounds, symbolic bounds for fixed dimensionality, or requires access to multiple datasets that contain the same treatment and outcome variables. Here, we provide symbolic bounds on the PoC for a challenging scenario.
  arXiv  Detail & Related papers  (2023-10-12T15:19:15Z)
• Structural restrictions in local causal discovery: identifying direct causes of a target variable [0.9208007322096533]
  Learning a set of direct causes of a target variable from an observational joint distribution is a fundamental problem in science. Here, we are only interested in identifying the direct causes of one target variable, not the full DAG. This allows us to relax the identifiability assumptions and develop possibly faster and more robust algorithms.
  arXiv  Detail & Related papers  (2023-07-29T18:31:35Z)
• A Causal Framework for Decomposing Spurious Variations [68.12191782657437]
  We develop tools for decomposing spurious variations in Markovian and Semi-Markovian models. We prove the first results that allow a non-parametric decomposition of spurious effects. The described approach has several applications, ranging from explainable and fair AI to questions in epidemiology and medicine.
  arXiv  Detail & Related papers  (2023-06-08T09:40:28Z)
• Nonparametric Identifiability of Causal Representations from Unknown Interventions [63.1354734978244]
  We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables. Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
  arXiv  Detail & Related papers  (2023-06-01T10:51:58Z)
• Bounding probabilities of causation through the causal marginal problem [12.542533707005092]
  Probabilities of causation play a fundamental role in decision making in law, health care and public policy. In many clinical trials and public policy evaluation cases, there exist independent datasets that examine the effect of a different treatment each on the same outcome variable. Here, we outline how to significantly tighten existing bounds on the probabilities of causation, by imposing counterfactual consistency between SCMs constructed from such independent datasets.
  arXiv  Detail & Related papers  (2023-04-04T12:16:38Z)
• BayesIMP: Uncertainty Quantification for Causal Data Fusion [52.184885680729224]
  We study the causal data fusion problem, where datasets pertaining to multiple causal graphs are combined to estimate the average treatment effect of a target variable. We introduce a framework which combines ideas from probabilistic integration and kernel mean embeddings to represent interventional distributions in the reproducing kernel Hilbert space.
  arXiv  Detail & Related papers  (2021-06-07T10:14:18Z)
• Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding [101.35070661471124]
  We show that unobserved confounding leaves a characteristic footprint in the observed data distribution that allows for disentangling spurious and causal effects. We propose an adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems.
  arXiv  Detail & Related papers  (2021-03-28T11:07:59Z)
• 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)

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.