Towards identifiability of micro total effects in summary causal graphs with latent confounding: extension of the front-door criterion

• URL: http://arxiv.org/abs/2406.05805v2
• Date: Mon, 19 May 2025 17:40:09 GMT
• Title: Towards identifiability of micro total effects in summary causal graphs with latent confounding: extension of the front-door criterion
• Authors: Charles K. Assaad,
• Abstract summary: Researchers often rely on causal graphs to determine whether these effects can be identified from observational data.<n>This paper addresses the challenge of identifying total effects using a specific and well-known partially specified graph in dynamic systems.
• Score: 1.0878040851638
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Conducting experiments to estimate total effects can be challenging due to cost, ethical concerns, or practical limitations. As an alternative, researchers often rely on causal graphs to determine whether these effects can be identified from observational data. Identifying total effects in fully specified causal graphs has received considerable attention, with Pearl's front-door criterion enabling the identification of total effects in the presence of latent confounding even when no variable set is sufficient for adjustment. However, specifying a complete causal graph is challenging in many domains. Extending these identifiability results to partially specified graphs is crucial, particularly in dynamic systems where causal relationships evolve over time. This paper addresses the challenge of identifying total effects using a specific and well-known partially specified graph in dynamic systems called a summary causal graph, which does not specify the temporal lag between causal relations and can contain cycles. In particular, this paper presents sufficient graphical conditions for identifying total effects from observational data, even in the presence of cycles and latent confounding, and when no variable set is sufficient for adjustment.

Related papers

• Identifiability by common backdoor in summary causal graphs of time series [2.737398629157413]
  The identifiability problem for interventions aims at assessing whether the total effect of some given interventions can be written with a do-free formula, and thus be computed from observational data only.<n>We study this problem, considering multiple interventions and multiple effects, in the context of time series when only abstractions of the true causal graph in the form of summary causal graphs are available.<n>We focus in this study on identifiability by a common backdoor set, and establish, for time series with and without consistency throughout time, conditions under which such a set exists.
  arXiv  Detail & Related papers  (2025-06-17T17:37:27Z)
• Complete Characterization for Adjustment in Summary Causal Graphs of Time Series [2.1711205684359243]
  identifiability problem for interventions aims at assessing whether the total causal effect can be written with a do-free formula, and thus be estimated from observational data only.<n>We study this problem, considering multiple interventions, in the context of time series when only an abstraction of the true causal graph, in the form of a summary causal graph, is available.<n>We propose in particular both necessary and sufficient conditions for the adjustment criterion, which we show is complete in this setting, and provide a pseudo-linear algorithm to decide whether the query is identifiable or not.
  arXiv  Detail & Related papers  (2025-06-17T14:00:31Z)
• Graph-based Complexity for Causal Effect by Empirical Plug-in [56.14597641617531]
  This paper focuses on the computational complexity of computing empirical plug-in estimates for causal effect queries. We show that computation can be done efficiently, potentially in time linear in the data size, depending on the estimand's hypergraph.
  arXiv  Detail & Related papers  (2024-11-15T07:42:01Z)
• Identifying Macro Conditional Independencies and Macro Total Effects in Summary Causal Graphs with Latent Confounding [0.9208007322096533]
  Partially specified causal graphs (SCGs) provide a simplified representation of causal relations between time series when working spacio-temporal data. Unlike fully specified causal graphs, SCGs can contain cycles, which complicate their analysis and interpretation. In this paper, we first clearly distinguish between macro conditional independencies and micro conditional independencies and between macro total effects and micro total effects.
  arXiv  Detail & Related papers  (2024-07-10T16:03:04Z)
• On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
  Temporally causal representation learning aims to identify the latent causal process from time series observations. Most methods require the assumption that the latent causal processes do not have instantaneous relations. We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
  arXiv  Detail & Related papers  (2024-05-24T08:08:05Z)
• Towards Self-Interpretable Graph-Level Anomaly Detection [73.1152604947837]
  Graph-level anomaly detection (GLAD) aims to identify graphs that exhibit notable dissimilarity compared to the majority in a collection. We propose a Self-Interpretable Graph aNomaly dETection model ( SIGNET) that detects anomalous graphs as well as generates informative explanations simultaneously.
  arXiv  Detail & Related papers  (2023-10-25T10:10:07Z)
• Identifiability of total effects from abstractions of time series causal graphs [2.5515299924109858]
  We study the problem of identifiability of the total effect of an intervention from observational time series. We consider two abstractions: the extended summary causal graph and the summary causal graph.
  arXiv  Detail & Related papers  (2023-10-23T08:31:26Z)
• Identifiability of Direct Effects from Summary Causal Graphs [1.0878040851638]
  This paper characterizes all cases for which the direct effect is graphically identifiable from a summary causal graph. It gives two sound finite adjustment sets that can be used to estimate the direct effect whenever it is identifiable.
  arXiv  Detail & Related papers  (2023-06-29T14:05:35Z)
• 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)
• On Learning Necessary and Sufficient Causal Graphs [29.339455706346193]
  In practice, only a small subset of variables in the graph are relevant to the outcomes of interest. We propose learning a class of necessary and sufficient causal graphs (NSCG) that exclusively comprises causally relevant variables for an outcome of interest. We develop a necessary and sufficient causal structural learning (NSCSL) algorithm, by establishing theoretical properties and relationships between probabilities of causation and natural causal effects of features.
  arXiv  Detail & Related papers  (2023-01-29T08:19:15Z)
• Effect Identification in Cluster Causal Diagrams [51.42809552422494]
  We introduce a new type of graphical model called cluster causal diagrams (for short, C-DAGs) C-DAGs allow for the partial specification of relationships among variables based on limited prior knowledge. We develop the foundations and machinery for valid causal inferences over C-DAGs.
  arXiv  Detail & Related papers  (2022-02-22T21:27:31Z)
• 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)

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.