Identifying Conditional Causal Effects in MPDAGs

• URL: http://arxiv.org/abs/2507.15842v1
• Date: Mon, 21 Jul 2025 17:52:28 GMT
• Title: Identifying Conditional Causal Effects in MPDAGs
• Abstract summary: We consider identifying a conditional causal effect when a graph is known up to a maximally oriented partially directed acyclic graph (MPDAG)<n>An MPDAG represents an equivalence class of graphs that is restricted by background knowledge and where all variables in the causal model are observed.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider identifying a conditional causal effect when a graph is known up to a maximally oriented partially directed acyclic graph (MPDAG). An MPDAG represents an equivalence class of graphs that is restricted by background knowledge and where all variables in the causal model are observed. We provide three results that address identification in this setting: an identification formula when the conditioning set is unaffected by treatment, a generalization of the well-known do calculus to the MPDAG setting, and an algorithm that is complete for identifying these conditional effects.

Related papers

• On Efficient Adjustment for Micro Causal Effects in Summary Causal Graphs [8.334918207379173]
  We introduce a new criterion that identifies a broader class of valid adjustment sets in summary causal graphs.<n>Our contributions offer both theoretical advancement and practical tools for more flexible and efficient causal inference.
  arXiv  Detail & Related papers  (2025-12-20T11:02:44Z)
• Identifying Macro Causal Effects in C-DMGs [0.9208007322096533]
  Causal effect identification using causal graphs is a fundamental challenge in causal inference.<n>This paper focuses on causal effect identification within partially specified causal graphs, with particular emphasis on cluster-directed mixed graphs (C-DMGs)<n>C-DMGs provide a higher-level representation of causal relationships by grouping variables into clusters.<n>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)
• Towards identifiability of micro total effects in summary causal graphs with latent confounding: extension of the front-door criterion [1.0878040851638]
  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.
  arXiv  Detail & Related papers  (2024-06-09T14:43:06Z)
• Causal Effect Identification in LiNGAM Models with Latent Confounders [20.751445296400316]
  We study the generic identifiability of causal effects in linear non-Gaussian acyclic models (LiNGAM) with latent variables. We provide a complete graphical characterization of the identifiable direct or total causal effects among observed variables.
  arXiv  Detail & Related papers  (2024-06-04T07:30:27Z)
• 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)
• GLAD: Content-aware Dynamic Graphs For Log Anomaly Detection [49.9884374409624]
  GLAD is a Graph-based Log Anomaly Detection framework designed to detect anomalies in system logs. We introduce GLAD, a Graph-based Log Anomaly Detection framework designed to detect anomalies in system logs.
  arXiv  Detail & Related papers  (2023-09-12T04:21:30Z)
• 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)
• Typing assumptions improve identification in causal discovery [123.06886784834471]
  Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified. We propose a new set of assumptions that constrain possible causal relationships based on the nature of the variables.
  arXiv  Detail & Related papers  (2021-07-22T14:23:08Z)
• Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels? [89.13567439679709]
  Graph Identification (GI) has long been researched in graph learning and is essential in certain applications. This paper defines a novel problem dubbed Inverse Graph Identification (IGI) We propose a simple yet effective method that makes the node-level message passing process using Graph Attention Network (GAT) under the protocol of GI.
  arXiv  Detail & Related papers  (2020-07-12T12:06:17Z)
• Semiparametric Inference For Causal Effects In Graphical Models With Hidden Variables [13.299431908881425]
  Identification theory for causal effects in causal models associated with hidden variable directed acyclic graphs is well studied. corresponding algorithms are underused due to the complexity of estimating the identifying functionals they output. We bridge the gap between identification and estimation of population-level causal effects involving a single treatment and a single outcome.
  arXiv  Detail & Related papers  (2020-03-27T22:29:04Z)

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.