Table of Contents
Fetching ...

Internal Incoherency Scores for Constraint-based Causal Discovery Algorithms

Sofia Faltenbacher, Jonas Wahl, Rebecca Herman, Jakob Runge

TL;DR

This paper tackles the challenge that constraint-based causal discovery methods rely on strong mechanistic and statistical assumptions that are often untested in real data. It introduces internal coherency scores that quantify how well a PC-like method’s output aligns with the observed CI tests without requiring ground-truth graphs, and proves these scores detect all errors that are theoretically detectable from a single run. The authors categorize error sources into faithfulness, structural, CI-test, and finite-sample violations, and describe how orientation conflicts and ambiguities manifest as incoherencies that the scores can quantify. Through toy models, simulations, and a real-world Auto MPG dataset, they demonstrate that coherency scores provide actionable diagnostics for model plausibility and robustness, advocating their integration into standard causal-discovery workflows for better reliability and method selection.

Abstract

Causal discovery aims to infer causal graphs from observational or experimental data. Methods such as the popular PC algorithm are based on conditional independence testing and utilize enabling assumptions, such as the faithfulness assumption, for their inferences. In practice, these assumptions, as well as the functional assumptions inherited from the chosen conditional independence test, are typically taken as a given and not further tested for their validity on the data. In this work, we propose internal coherency scores that allow testing for assumption violations and finite sample errors, whenever detectable without requiring ground truth or further statistical tests. We provide a complete classification of erroneous results, including a distinction between detectable and undetectable errors, and prove that the detectable erroneous results can be measured by our scores. We illustrate our coherency scores on the PC algorithm with simulated and real-world datasets, and envision that testing for internal coherency can become a standard tool in applying constraint-based methods, much like a suite of tests is used to validate the assumptions of classical regression analysis.

Internal Incoherency Scores for Constraint-based Causal Discovery Algorithms

TL;DR

This paper tackles the challenge that constraint-based causal discovery methods rely on strong mechanistic and statistical assumptions that are often untested in real data. It introduces internal coherency scores that quantify how well a PC-like method’s output aligns with the observed CI tests without requiring ground-truth graphs, and proves these scores detect all errors that are theoretically detectable from a single run. The authors categorize error sources into faithfulness, structural, CI-test, and finite-sample violations, and describe how orientation conflicts and ambiguities manifest as incoherencies that the scores can quantify. Through toy models, simulations, and a real-world Auto MPG dataset, they demonstrate that coherency scores provide actionable diagnostics for model plausibility and robustness, advocating their integration into standard causal-discovery workflows for better reliability and method selection.

Abstract

Causal discovery aims to infer causal graphs from observational or experimental data. Methods such as the popular PC algorithm are based on conditional independence testing and utilize enabling assumptions, such as the faithfulness assumption, for their inferences. In practice, these assumptions, as well as the functional assumptions inherited from the chosen conditional independence test, are typically taken as a given and not further tested for their validity on the data. In this work, we propose internal coherency scores that allow testing for assumption violations and finite sample errors, whenever detectable without requiring ground truth or further statistical tests. We provide a complete classification of erroneous results, including a distinction between detectable and undetectable errors, and prove that the detectable erroneous results can be measured by our scores. We illustrate our coherency scores on the PC algorithm with simulated and real-world datasets, and envision that testing for internal coherency can become a standard tool in applying constraint-based methods, much like a suite of tests is used to validate the assumptions of classical regression analysis.

Paper Structure

This paper contains 16 sections, 3 theorems, 20 equations, 10 figures, 14 tables.

Key Result

Proposition 1

Erroneous results of a method ${\mathcal{M}}$ are orientation-conflict-free and coherent with the CI test results ${\mathcal{T}}^{ind} \cup {\mathcal{T}}^{dep}$ (G3) if and only if there is a distribution that can represent the conditional independencies ${\mathcal{T}}^{ind}$ and it is Markovian and

Figures (10)

  • Figure 1: Without conflict resolution, only the dotted edges are marked as orientation conflicts, while also the seemingly orientable edges are no longer reliable.
  • Figure 2: Faithfulness violation leading to an incoherent erroneous result.
  • Figure 3: Comparison of the true causal graph and an undetectable erroneous graph structure.
  • Figure 4: Small sample analysis for classical toy model
  • Figure 5: Comparison of output graphs of PC on auto mpg data after ambiguity resolution.
  • ...and 5 more figures

Theorems & Definitions (19)

  • Definition 1
  • Example 1
  • Example 2
  • Example 3
  • Definition 2
  • Proposition 1: Distributional Characterization of Internally-Detectable Erroneous Results
  • Corollary 1.1: Resolved Conflicts and Ambiguities Imply Incoherencies
  • Remark 1
  • Proposition 2: Graphical Characterization of Internally-Detectable Erroneous Results
  • Definition 3
  • ...and 9 more