Your Assumed DAG is Wrong and Here's How To Deal With It

• URL: http://arxiv.org/abs/2502.17030v2
• Date: Mon, 10 Mar 2025 09:00:28 GMT
• Title: Your Assumed DAG is Wrong and Here's How To Deal With It
• Authors: Kirtan Padh, Zhufeng Li, Cecilia Casolo, Niki Kilbertus,
• Abstract summary: We propose an efficient, gradient-based optimization method that provides bounds for causal queries over a collection of causal graphs.<n>Our approach aims at providing an easy-to-use and widely applicable rebuttal to the valid critique of What if your assumed DAG is wrong?'
• Score: 4.262342157729123
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Assuming a directed acyclic graph (DAG) that represents prior knowledge of causal relationships between variables is a common starting point for cause-effect estimation. Existing literature typically invokes hypothetical domain expert knowledge or causal discovery algorithms to justify this assumption. In practice, neither may propose a single DAG with high confidence. Domain experts are hesitant to rule out dependencies with certainty or have ongoing disputes about relationships; causal discovery often relies on untestable assumptions itself or only provides an equivalence class of DAGs and is commonly sensitive to hyperparameter and threshold choices. We propose an efficient, gradient-based optimization method that provides bounds for causal queries over a collection of causal graphs -- compatible with imperfect prior knowledge -- that may still be too large for exhaustive enumeration. Our bounds achieve good coverage and sharpness for causal queries such as average treatment effects in linear and non-linear synthetic settings as well as on real-world data. Our approach aims at providing an easy-to-use and widely applicable rebuttal to the valid critique of `What if your assumed DAG is wrong?'.

Related papers

• Causal DAG Summarization (Full Version) [12.231672388216653]
  Causal inference aids researchers in discovering cause-and-effect relationships, leading to scientific insights. Current methods for general-purpose graph summarization are inadequate for causal DAG summarization. This paper proposes a causal graph summarization objective that balances graph simplification for better understanding while retaining essential causal information for reliable inference.
  arXiv  Detail & Related papers  (2025-04-21T08:01:32Z)
• Analytic DAG Constraints for Differentiable DAG Learning [83.93320658222717]
  We develop a theory to establish a connection between analytic functions and DAG constraints. We show that analytic functions from the set $f(x) = c_0 + sum_i=1inftyc_ixi | forall i > 0, c_i > 0; r = lim_irightarrow inftyc_i/c_i+1 > 0$ can be employed to formulate effective DAG constraints.
  arXiv  Detail & Related papers  (2025-03-24T23:51:35Z)
• Learning to Defer for Causal Discovery with Imperfect Experts [59.071731337922664]
  We propose L2D-CD, a method for gauging the correctness of expert recommendations and optimally combining them with data-driven causal discovery results.<n>We evaluate L2D-CD on the canonical T"ubingen pairs dataset and demonstrate its superior performance compared to both the causal discovery method and the expert used in isolation.
  arXiv  Detail & Related papers  (2025-02-18T18:55:53Z)
• Discovery of Maximally Consistent Causal Orders with Large Language Models [0.8192907805418583]
  Causal discovery is essential for understanding complex systems.<n>Traditional methods often rely on strong, untestable assumptions.<n>We propose a novel method to derive a class of acyclic tournaments.
  arXiv  Detail & Related papers  (2024-12-18T16:37:51Z)
• Federated Causal Discovery from Heterogeneous Data [70.31070224690399]
  We propose a novel FCD method attempting to accommodate arbitrary causal models and heterogeneous data. These approaches involve constructing summary statistics as a proxy of the raw data to protect data privacy. We conduct extensive experiments on synthetic and real datasets to show the efficacy of our method.
  arXiv  Detail & Related papers  (2024-02-20T18:53:53Z)
• Toward Falsifying Causal Graphs Using a Permutation-Based Test [11.826804773695033]
  Existing metrics provide an $textitabsolute$ number of inconsistencies between the graph and the observed data.<n>We propose a novel consistency metric by constructing a baseline through node permutations.<n>By comparing the number of inconsistencies with those on the baseline, we derive an interpretable metric.
  arXiv  Detail & Related papers  (2023-05-16T16:02:18Z)
• Causal discovery under a confounder blanket [9.196779204457059]
  Inferring causal relationships from observational data is rarely straightforward, but the problem is especially difficult in high dimensions. We relax these assumptions and focus on an important but more specialized problem, namely recovering a directed acyclic subgraph. We derive a complete algorithm for identifying causal relationships under these conditions and implement testing procedures.
  arXiv  Detail & Related papers  (2022-05-11T18:10:45Z)
• 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)
• Partial Identification with Noisy Covariates: A Robust Optimization Approach [94.10051154390237]
  Causal inference from observational datasets often relies on measuring and adjusting for covariates. We show that this robust optimization approach can extend a wide range of causal adjustment methods to perform partial identification. Across synthetic and real datasets, we find that this approach provides ATE bounds with a higher coverage probability than existing methods.
  arXiv  Detail & Related papers  (2022-02-22T04:24:26Z)
• 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)
• Causal Discovery in Knowledge Graphs by Exploiting Asymmetric Properties of Non-Gaussian Distributions [3.1981440103815717]
  We define a hybrid approach that allows us to discover cause-effect relationships in Knowledge Graphs. The proposed approach is based around the finding of the instantaneous causal structure of a non-experimental matrix using a non-Gaussian model. We use two different pre-existing algorithms, one for the causal discovery and the other for decomposing the Knowledge Graph.
  arXiv  Detail & Related papers  (2021-06-02T09:33:05Z)
• FRITL: A Hybrid Method for Causal Discovery in the Presence of Latent Confounders [46.31784571870808]
  We show that under some mild assumptions, the model is uniquely identified by a hybrid method. Our method leverages the advantages of constraint-based methods and independent noise-based methods to handle both confounded and unconfounded situations.
  arXiv  Detail & Related papers  (2021-03-26T03:12:14Z)

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.