On Different Notions of Redundancy in Conditional-Independence-Based Discovery of Graphical Models

Philipp M. Faller, Dominik Janzing
2/12/2025
cs.LGstat.ML

No official code found. Best implementation: PhilippFaller/RedundancyInGraphDiscovery (0 stars, last commit 2025-10-10).

Abstract

Conditional-independence-based discovery uses statistical tests to identify a graphical model that represents the independence structure of variables in a dataset. These tests, however, can be unreliable, and algorithms are sensitive to errors and violated assumptions. Often, there are tests that were not used in the construction of the graph. In this work, we show that these redundant tests have the potential to detect or sometimes correct errors in the learned model. But we further show that not all tests contain this additional information and that such redundant tests have to be applied with care. Precisely, we argue that the conditional (in)dependence statements that hold for every probability distribution are unlikely to detect and correct errors - in contrast to those that follow only from graphical assumptions.

View on arXivView PDF

Code Implementations(1)

Source code for the experiments in the paper "On Different Notions of Redundancy in Conditional-Independence-Based Discovery of Graphical Models"

00PythonFeb 12, 20251 years ago

Similar Papers

Cite this paper

@article{faller2025different,
  title  = {On Different Notions of Redundancy in Conditional-Independence-Based Discovery of Graphical Models},
  author = {Philipp M. Faller and Dominik Janzing},
  year   = {2025},
  eprint = {2502.08531},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.08531v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.08531.svg)](https://codeofpaper.com/paper/2502.08531)

Discussion