On Efficient Adjustment for Micro Causal Effects in Summary Causal Graphs

• URL: http://arxiv.org/abs/2512.18315v2
• Date: Tue, 23 Dec 2025 10:30:05 GMT
• Title: On Efficient Adjustment for Micro Causal Effects in Summary Causal Graphs
• Abstract summary: 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.
• Score: 8.334918207379173
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Observational studies in fields such as epidemiology often rely on covariate adjustment to estimate causal effects. Classical graphical criteria, like the back-door criterion and the generalized adjustment criterion, are powerful tools for identifying valid adjustment sets in directed acyclic graphs (DAGs). However, these criteria are not directly applicable to summary causal graphs (SCGs), which are abstractions of DAGs commonly used in dynamic systems. In SCGs, each node typically represents an entire time series and may involve cycles, making classical criteria inapplicable for identifying causal effects. Recent work established complete conditions for determining whether the micro causal effect of a treatment or an exposure $X_{t-γ}$ on an outcome $Y_t$ is identifiable via covariate adjustment in SCGs, under the assumption of no hidden confounding. However, these identifiability conditions have two main limitations. First, they are complex, relying on cumbersome definitions and requiring the enumeration of multiple paths in the SCG, which can be computationally expensive. Second, when these conditions are satisfied, they only provide two valid adjustment sets, limiting flexibility in practical applications. In this paper, we propose an equivalent but simpler formulation of those identifiability conditions and introduce a new criterion that identifies a broader class of valid adjustment sets in SCGs. Additionally, we characterize the quasi-optimal adjustment set among these, i.e., the one that minimizes the asymptotic variance of the causal effect estimator. Our contributions offer both theoretical advancement and practical tools for more flexible and efficient causal inference in abstracted causal graphs.

Related papers

• COMPACT: Spectral Adjustment Scores from a Complete and Irreducible Causal Criterion [1.8275108630751837]
  Propensity scores can simplify adjustment by reducing high-dimensional covariates to a scalar with binary treatment.<n>Under faithfulness, we identify the largest set of unconditional and conditional dependence relations whose truth is invariant to whether treatment causes the outcome, leaving treatment-effect estimation to the downstream analysis.<n>We show that sufficiently informative proxies can recover this span without direct observation of the adjustment variables, characterize the resulting estimation and causal errors, and establish validity for the complete procedure.
  arXiv  Detail & Related papers  (2026-08-10T23:22:20Z)
• Scalable Contrastive Causal Discovery under Unknown Soft Interventions [3.165716101116899]
  We propose a scalable causal discovery model for paired observational and interventional settings with shared underlying causal structure and unknown soft interventions.<n> Experiments on synthetic data demonstrate improved causal structure recovery, generalization to unseen graphs with held-out causal mechanisms, and scalability to larger graphs.
  arXiv  Detail & Related papers  (2026-03-03T18:16:16Z)
• Correcting False Alarms from Unseen: Adapting Graph Anomaly Detectors at Test Time [60.341117019125214]
  We propose a lightweight and plug-and-play Test-time adaptation framework for correcting Unseen Normal pattErns in graph anomaly detection (GAD)<n>To address semantic confusion, a graph aligner is employed to align the shifted data to the original one at the graph attribute level.<n>Extensive experiments on 10 real-world datasets demonstrate that TUNE significantly enhances the generalizability of pre-trained GAD models to both synthetic and real unseen normal patterns.
  arXiv  Detail & Related papers  (2025-11-10T12:10:05Z)
• Identifying Conditional Causal Effects in MPDAGs [0.0]
  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.
  arXiv  Detail & Related papers  (2025-07-21T17:52:28Z)
• Less Greedy Equivalence Search [52.818153111470394]
  Greedy Equivalence Search (GES) is a score-based algorithm for causal discovery from observational data.<n>We develop Less Greedy Equivalence Search (LGES), a variant of GES that retains its theoretical guarantees while partially addressing these limitations.
  arXiv  Detail & Related papers  (2025-06-27T15:39:48Z)
• Local Markov Equivalence and Local Causal Discovery for Identifying Controlled Direct Effects [0.9208007322096533]
  We present a novel algorithm for identifying controlled direct effects (CDEs)<n>Our algorithms require less conditional independence tests and operate under weaker assumptions while maintaining theoretical guarantees.<n>We illustrate the effectiveness of our approach through simulation studies.
  arXiv  Detail & Related papers  (2025-05-05T16:47:29Z)
• Markov Equivalence and Consistency in Differentiable Structure Learning [38.25218464260965]
  Existing approaches to differentiable structure learning of directed acyclic graphs (DAGs) rely on strong identifiability assumptions.<n>We explain and remedy these issues by studying the behavior of differentiable acyclicity-constrained programs under general likelihoods.
  arXiv  Detail & Related papers  (2024-10-08T16:08:24Z)
• Single-Pass Contrastive Learning Can Work for Both Homophilic and Heterophilic Graph [60.28340453547902]
  Graph contrastive learning (GCL) techniques typically require two forward passes for a single instance to construct the contrastive loss. Existing GCL approaches fail to provide strong performance guarantees. We implement the Single-Pass Graph Contrastive Learning method (SP-GCL) Empirically, the features learned by the SP-GCL can match or outperform existing strong baselines with significantly less computational overhead.
  arXiv  Detail & Related papers  (2022-11-20T07:18:56Z)
• Hierarchical Semi-Supervised Contrastive Learning for Contamination-Resistant Anomaly Detection [81.07346419422605]
  Anomaly detection aims at identifying deviant samples from the normal data distribution. Contrastive learning has provided a successful way to sample representation that enables effective discrimination on anomalies. We propose a novel hierarchical semi-supervised contrastive learning framework, for contamination-resistant anomaly detection.
  arXiv  Detail & Related papers  (2022-07-24T18:49:26Z)
• 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)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Deconfounding Scores: Feature Representations for Causal Effect Estimation with Weak Overlap [140.98628848491146]
  We introduce deconfounding scores, which induce better overlap without biasing the target of estimation. We show that deconfounding scores satisfy a zero-covariance condition that is identifiable in observed data. In particular, we show that this technique could be an attractive alternative to standard regularizations.
  arXiv  Detail & Related papers  (2021-04-12T18:50:11Z)

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.