Front-door Adjustment Beyond Markov Equivalence with Limited Graph
Knowledge
- URL: http://arxiv.org/abs/2306.11008v1
- Date: Mon, 19 Jun 2023 15:16:56 GMT
- Title: Front-door Adjustment Beyond Markov Equivalence with Limited Graph
Knowledge
- Authors: Abhin Shah, Karthikeyan Shanmugam, Murat Kocaoglu
- Abstract summary: We provide testable conditional independence statements to compute the causal effect using front-door-like adjustment.
We show that our method is applicable in scenarios where knowing the Markov equivalence class is not sufficient for causal effect estimation.
- Score: 36.210656212459554
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Causal effect estimation from data typically requires assumptions about the
cause-effect relations either explicitly in the form of a causal graph
structure within the Pearlian framework, or implicitly in terms of
(conditional) independence statements between counterfactual variables within
the potential outcomes framework. When the treatment variable and the outcome
variable are confounded, front-door adjustment is an important special case
where, given the graph, causal effect of the treatment on the target can be
estimated using post-treatment variables. However, the exact formula for
front-door adjustment depends on the structure of the graph, which is difficult
to learn in practice. In this work, we provide testable conditional
independence statements to compute the causal effect using front-door-like
adjustment without knowing the graph under limited structural side information.
We show that our method is applicable in scenarios where knowing the Markov
equivalence class is not sufficient for causal effect estimation. We
demonstrate the effectiveness of our method on a class of random graphs as well
as real causal fairness benchmarks.
Related papers
- Identifiability Guarantees for Causal Disentanglement from Purely Observational Data [10.482728002416348]
Causal disentanglement aims to learn about latent causal factors behind data.
Recent advances establish identifiability results assuming that interventions on (single) latent factors are available.
We provide a precise characterization of latent factors that can be identified in nonlinear causal models.
arXiv Detail & Related papers (2024-10-31T04:18:29Z) - Interventional Fairness on Partially Known Causal Graphs: A Constrained
Optimization Approach [44.48385991344273]
We propose a framework for achieving causal fairness based on the notion of interventions when the true causal graph is partially known.
The proposed approach involves modeling fair prediction using a class of causal DAGs that can be learned from observational data combined with domain knowledge.
Results on both simulated and real-world datasets demonstrate the effectiveness of this method.
arXiv Detail & Related papers (2024-01-19T11:20:31Z) - Towards Bounding Causal Effects under Markov Equivalence [13.050023008348388]
We consider the derivation of bounds on causal effects given only observational data.
We provide a systematic algorithm to derive bounds on causal effects that exploit the invariant properties of the equivalence class.
arXiv Detail & Related papers (2023-11-13T11:49:55Z) - A continuous Structural Intervention Distance to compare Causal Graphs [5.477914707166288]
The distance is based on embedding intervention distributions over each pair of nodes.
We show theoretical results which we validate with numerical experiments on synthetic data.
arXiv Detail & Related papers (2023-07-31T07:20:26Z) - 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) - Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing.
We study the case where probability distributions are not known a priori but need to be estimated from data.
arXiv Detail & Related papers (2022-08-29T16:16:22Z) - Counterfactual Fairness with Partially Known Causal Graph [85.15766086381352]
This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown.
We find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided.
arXiv Detail & Related papers (2022-05-27T13:40:50Z) - 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) - Causal Expectation-Maximisation [70.45873402967297]
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.
arXiv Detail & Related papers (2020-11-04T10:25:13Z) - Estimating Causal Effects with the Neural Autoregressive Density
Estimator [6.59529078336196]
We use neural autoregressive density estimators to estimate causal effects within the Pearl's do-calculus framework.
We show that the approach can retrieve causal effects from non-linear systems without explicitly modeling the interactions between the variables.
arXiv Detail & Related papers (2020-08-17T13:12:38Z)
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.