Disentangling Mixtures of Unknown Causal Interventions

• URL: http://arxiv.org/abs/2210.03242v1
• Date: Sat, 1 Oct 2022 08:08:18 GMT
• Title: Disentangling Mixtures of Unknown Causal Interventions
• Authors: Abhinav Kumar, Gaurav Sinha
• Abstract summary: We study the problem of identifying all components present in a mixture of interventions on a given causal Bayesian Network. Our proof gives an efficient algorithm to recover these targets from the exponentially large search space of possible targets.
• Score: 3.214838781410822
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In many real-world scenarios, such as gene knockout experiments, targeted interventions are often accompanied by unknown interventions at off-target sites. Moreover, different units can get randomly exposed to different unknown interventions, thereby creating a mixture of interventions. Identifying different components of this mixture can be very valuable in some applications. Motivated by such situations, in this work, we study the problem of identifying all components present in a mixture of interventions on a given causal Bayesian Network. We construct an example to show that, in general, the components are not identifiable from the mixture distribution. Next, assuming that the given network satisfies a positivity condition, we show that, if the set of mixture components satisfy a mild exclusion assumption, then they can be uniquely identified. Our proof gives an efficient algorithm to recover these targets from the exponentially large search space of possible targets. In the more realistic scenario, where distributions are given via finitely many samples, we conduct a simulation study to analyze the performance of an algorithm derived from our identifiability proof.

Related papers

• Identifiable Shared Component Analysis of Unpaired Multimodal Mixtures [10.563519176608667]
  A core task in multi-modal learning is to integrate information from multiple feature spaces (e.g., text and audio), offering modality-invariant essential representations of data. Recent research showed that, classical tools such as it canonical correlation analysis (CCA) provably identify the shared components up to minor ambiguities. This work takes a step further, investigating shared component identifiability from multi-modal linear mixtures where cross-modality samples are unaligned.
  arXiv  Detail & Related papers  (2024-09-28T17:43:17Z)
• Learning Unknown Intervention Targets in Structural Causal Models from Heterogeneous Data [27.38242139321935]
  We study the problem of identifying the unknown intervention targets in structural causal models. In the presence of latent confounders, the intervention targets among the observed variables cannot be determined uniquely. Our approach improves upon the state of the art as the returned candidate set is always a subset of the true intervention targets.
  arXiv  Detail & Related papers  (2023-12-11T03:31:54Z)
• Learning Linear Causal Representations from Interventions under General Nonlinear Mixing [52.66151568785088]
  We prove strong identifiability results given unknown single-node interventions without access to the intervention targets. This is the first instance of causal identifiability from non-paired interventions for deep neural network embeddings.
  arXiv  Detail & Related papers  (2023-06-04T02:32:12Z)
• 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)
• BaCaDI: Bayesian Causal Discovery with Unknown Interventions [118.93754590721173]
  BaCaDI operates in the continuous space of latent probabilistic representations of both causal structures and interventions. In experiments on synthetic causal discovery tasks and simulated gene-expression data, BaCaDI outperforms related methods in identifying causal structures and intervention targets.
  arXiv  Detail & Related papers  (2022-06-03T16:25:48Z)
• Equivariance Allows Handling Multiple Nuisance Variables When Analyzing Pooled Neuroimaging Datasets [53.34152466646884]
  In this paper, we show how bringing recent results on equivariant representation learning instantiated on structured spaces together with simple use of classical results on causal inference provides an effective practical solution. We demonstrate how our model allows dealing with more than one nuisance variable under some assumptions and can enable analysis of pooled scientific datasets in scenarios that would otherwise entail removing a large portion of the samples.
  arXiv  Detail & Related papers  (2022-03-29T04:54:06Z)
• Differentiable Causal Discovery Under Latent Interventions [3.867363075280544]
  Recent work has shown promising results in causal discovery by leveraging interventional data with gradient-based methods, even when the intervened variables are unknown. We envision a scenario with an extensive dataset sampled from multiple intervention distributions and one observation distribution, but where we do not know which distribution originated each sample and how the intervention affected the system. We propose a method based on neural networks and variational inference that addresses this scenario by framing it as learning a shared causal graph among an infinite mixture.
  arXiv  Detail & Related papers  (2022-03-04T14:21:28Z)
• Acquisition-invariant brain MRI segmentation with informative uncertainties [3.46329153611365]
  Post-hoc multi-site correction methods exist but have strong assumptions that often do not hold in real-world scenarios. This body of work showcases such an algorithm, that can become robust to the physics of acquisition in the context of segmentation tasks. We demonstrate that our method not only generalises to complete holdout datasets, preserving segmentation quality, but does so while also accounting for site-specific sequence choices.
  arXiv  Detail & Related papers  (2021-11-07T13:58:04Z)
• Learning to Separate Clusters of Adversarial Representations for Robust Adversarial Detection [50.03939695025513]
  We propose a new probabilistic adversarial detector motivated by a recently introduced non-robust feature. In this paper, we consider the non-robust features as a common property of adversarial examples, and we deduce it is possible to find a cluster in representation space corresponding to the property. This idea leads us to probability estimate distribution of adversarial representations in a separate cluster, and leverage the distribution for a likelihood based adversarial detector.
  arXiv  Detail & Related papers  (2020-12-07T07:21:18Z)
• Almost-Matching-Exactly for Treatment Effect Estimation under Network Interference [73.23326654892963]
  We propose a matching method that recovers direct treatment effects from randomized experiments where units are connected in an observed network. Our method matches units almost exactly on counts of unique subgraphs within their neighborhood graphs.
  arXiv  Detail & Related papers  (2020-03-02T15:21:20Z)

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.