Identifying Macro Conditional Independencies and Macro Total Effects in Summary Causal Graphs with Latent Confounding

• URL: http://arxiv.org/abs/2407.07934v4
• Date: Fri, 20 Dec 2024 10:14:54 GMT
• Title: Identifying Macro Conditional Independencies and Macro Total Effects in Summary Causal Graphs with Latent Confounding
• Authors: Simon Ferreira, Charles K. Assaad,
• Abstract summary: Partially specified causal graphs (SCGs) provide a simplified representation of causal relations between time series when working spacio-temporal data.<n>Unlike fully specified causal graphs, SCGs can contain cycles, which complicate their analysis and interpretation.<n>In this paper, we first clearly distinguish between macro conditional independencies and micro conditional independencies and between macro total effects and micro total effects.
• Score: 0.9208007322096533
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Understanding causal relations in dynamic systems is essential in epidemiology. While causal inference methods have been extensively studied, they often rely on fully specified causal graphs, which may not always be available in complex dynamic systems. Partially specified causal graphs, and in particular summary causal graphs (SCGs), provide a simplified representation of causal relations between time series when working spacio-temporal data, omitting temporal information and focusing on causal structures between clusters of of temporal variables. Unlike fully specified causal graphs, SCGs can contain cycles, which complicate their analysis and interpretation. In addition, their cluster-based nature introduces new challenges concerning the types of queries of interest: macro queries, which involve relationships between clusters represented as vertices in the graph, and micro queries, which pertain to relationships between variables that are not directly visible through the vertices of the graph. In this paper, we first clearly distinguish between macro conditional independencies and micro conditional independencies and between macro total effects and micro total effects. Then, we demonstrate the soundness and completeness of the d-separation to identify macro conditional independencies in SCGs. Furthermore, we establish that the do-calculus is sound and complete for identifying macro total effects in SCGs. Finally, we give a graphical characterization for the non-identifiability of macro total effects in SCGs.

Related papers

• Identifying Macro Causal Effects in C-DMGs [0.9208007322096533]
  Causal effect identification using causal graphs is a fundamental challenge in causal inference. This paper focuses on causal effect identification within partially specified causal graphs, with particular emphasis on cluster-directed mixed graphs (C-DMGs) C-DMGs provide a higher-level representation of causal relationships by grouping variables into clusters. Unlike fully specified causal graphs, C-DMGs can contain cycles, which complicate their analysis and interpretation.
  arXiv  Detail & Related papers  (2025-04-02T09:48:27Z)
• DeCaFlow: A Deconfounding Causal Generative Model [58.411886466157185]
  Causal generative models (CGMs) have recently emerged as capable approaches to simulate the causal mechanisms generating our observations. We introduce DeCaFlow, a CGM that accounts for hidden confounders in a single amortized training process using only observational data and the causal graph. For the first time to our knowledge, we show that a confounded counterfactual query is identifiable, and thus solvable by DeCaFlow.
  arXiv  Detail & Related papers  (2025-03-19T11:14:16Z)
• Learning to Model Graph Structural Information on MLPs via Graph Structure Self-Contrasting [50.181824673039436]
  We propose a Graph Structure Self-Contrasting (GSSC) framework that learns graph structural information without message passing. The proposed framework is based purely on Multi-Layer Perceptrons (MLPs), where the structural information is only implicitly incorporated as prior knowledge. It first applies structural sparsification to remove potentially uninformative or noisy edges in the neighborhood, and then performs structural self-contrasting in the sparsified neighborhood to learn robust node representations.
  arXiv  Detail & Related papers  (2024-09-09T12:56:02Z)
• Toward identifiability of total effects in summary causal graphs with latent confounders: an extension of the front-door criterion [1.0878040851638]
  This paper addresses the challenge of identifying total effects using a summary causal graph in dynamic systems. It presents sufficient graphical conditions for identifying total effects from observational data, even in the presence of hidden confounding.
  arXiv  Detail & Related papers  (2024-06-09T14:43:06Z)
• 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)
• Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning [56.45977379288308]
  Masked autoencoder (MAE) learns to reconstruct masked graph edges or node features. Contrastive Learning (CL) maximizes the similarity between augmented views of the same graph. We propose graph contrastive masked autoencoder (GCMAE) framework to unify MAE and CL.
  arXiv  Detail & Related papers  (2023-10-24T05:06:06Z)
• 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)
• Deep Temporal Graph Clustering [77.02070768950145]
  We propose a general framework for deep Temporal Graph Clustering (GC) GC introduces deep clustering techniques to suit the interaction sequence-based batch-processing pattern of temporal graphs. Our framework can effectively improve the performance of existing temporal graph learning methods.
  arXiv  Detail & Related papers  (2023-05-18T06:17:50Z)
• 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)
• BCDAG: An R package for Bayesian structure and Causal learning of Gaussian DAGs [77.34726150561087]
  We introduce the R package for causal discovery and causal effect estimation from observational data. Our implementation scales efficiently with the number of observations and, whenever the DAGs are sufficiently sparse, the number of variables in the dataset. We then illustrate the main functions and algorithms on both real and simulated datasets.
  arXiv  Detail & Related papers  (2022-01-28T09:30:32Z)
• Clustering and Structural Robustness in Causal Diagrams [1.9766522384767222]
  Clustering of variables is a natural way to reduce the size of the causal diagram. We define a specific type of cluster, called transit cluster, that is guaranteed to preserve the identifiability properties of causal effects. We show that this kind of structural robustness is closely related to transit clusters.
  arXiv  Detail & Related papers  (2021-11-08T13:56:22Z)
• DisenKGAT: Knowledge Graph Embedding with Disentangled Graph Attention Network [48.38954651216983]
  We propose a novel Disentangled Knowledge Graph Attention Network (DisenKGAT) for Knowledge graphs. DisenKGAT uses both micro-disentanglement and macro-disentanglement to exploit representations behind Knowledge graphs. Our work has strong robustness and flexibility to adapt to various score functions.
  arXiv  Detail & Related papers  (2021-08-22T04:10:35Z)

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.