Argumentative Causal Discovery

• URL: http://arxiv.org/abs/2405.11250v3
• Date: Sat, 3 Aug 2024 10:54:18 GMT
• Title: Argumentative Causal Discovery
• Authors: Fabrizio Russo, Anna Rapberger, Francesca Toni,
• Abstract summary: Causal discovery amounts to unearthing causal relationships amongst features in data. We deploy assumption-based argumentation (ABA) to learn graphs which reflect causal dependencies in the data. We prove that our method exhibits desirable properties, notably that, under natural conditions, it can retrieve ground-truth causal graphs.
• Score: 13.853426822028975
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Causal discovery amounts to unearthing causal relationships amongst features in data. It is a crucial companion to causal inference, necessary to build scientific knowledge without resorting to expensive or impossible randomised control trials. In this paper, we explore how reasoning with symbolic representations can support causal discovery. Specifically, we deploy assumption-based argumentation (ABA), a well-established and powerful knowledge representation formalism, in combination with causality theories, to learn graphs which reflect causal dependencies in the data. We prove that our method exhibits desirable properties, notably that, under natural conditions, it can retrieve ground-truth causal graphs. We also conduct experiments with an implementation of our method in answer set programming (ASP) on four datasets from standard benchmarks in causal discovery, showing that our method compares well against established baselines.

Related papers

• Hypothesizing Missing Causal Variables with LLMs [55.28678224020973]
  We formulate a novel task where the input is a partial causal graph with missing variables, and the output is a hypothesis about the missing variables to complete the partial graph. We show the strong ability of LLMs to hypothesize the mediation variables between a cause and its effect. We also observe surprising results where some of the open-source models outperform the closed GPT-4 model.
  arXiv  Detail & Related papers  (2024-09-04T10:37:44Z)
• Unsupervised Pairwise Causal Discovery on Heterogeneous Data using Mutual Information Measures [49.1574468325115]
  Causal Discovery is a technique that tackles the challenge by analyzing the statistical properties of the constituent variables. We question the current (possibly misleading) baseline results on the basis that they were obtained through supervised learning. In consequence, we approach this problem in an unsupervised way, using robust Mutual Information measures.
  arXiv  Detail & Related papers  (2024-08-01T09:11:08Z)
• Large Language Models for Constrained-Based Causal Discovery [4.858756226945995]
  Causality is essential for understanding complex systems, such as the economy, the brain, and the climate. This work explores the capabilities of Large Language Models (LLMs) as an alternative to domain experts for causal graph generation.
  arXiv  Detail & Related papers  (2024-06-11T15:45:24Z)
• Self-Compatibility: Evaluating Causal Discovery without Ground Truth [28.72650348646176]
  We propose a novel method for falsifying the output of a causal discovery algorithm in the absence of ground truth. Our key insight is that while statistical learning seeks stability across subsets of data points, causal learning should seek stability across subsets of variables. We prove that detecting incompatibilities can falsify wrongly inferred causal relations due to violation of assumptions or errors from finite sample effects.
  arXiv  Detail & Related papers  (2023-07-18T18:59:42Z)
• A Survey on Causal Discovery: Theory and Practice [2.741266294612776]
  Causal inference is designed to quantify the underlying relationships that connect a cause to its effect. In this paper, we explore recent advancements in a unified manner, provide a consistent overview of existing algorithms, report useful tools and data, present real-world applications.
  arXiv  Detail & Related papers  (2023-05-17T08:18:56Z)
• Identifying Weight-Variant Latent Causal Models [82.14087963690561]
  We find that transitivity acts as a key role in impeding the identifiability of latent causal representations. Under some mild assumptions, we can show that the latent causal representations can be identified up to trivial permutation and scaling. We propose a novel method, termed Structural caUsAl Variational autoEncoder, which directly learns latent causal representations and causal relationships among them.
  arXiv  Detail & Related papers  (2022-08-30T11:12:59Z)
• Counterfactual Fairness with Partially Known Causal Graph [85.15766086381352]
  This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown. We find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided.
  arXiv  Detail & Related papers  (2022-05-27T13:40:50Z)
• 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)
• To do or not to do: finding causal relations in smart homes [2.064612766965483]
  This paper introduces a new way to learn causal models from a mixture of experiments on the environment and observational data. The core of our method is the use of selected interventions, especially our learning takes into account the variables where it is impossible to intervene. We use our method on a smart home simulation, a use case where knowing causal relations pave the way towards explainable systems.
  arXiv  Detail & Related papers  (2021-05-20T22:36:04Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Causal Relational Learning [29.082088734252213]
  We propose a declarative language called CaRL for capturing causal background knowledge and assumptions. CaRL provides a foundation for inferring causality and reasoning about the effect of complex interventions in relational domains.
  arXiv  Detail & Related papers  (2020-04-07T18:33:05Z)

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.