mlsanityData to 14 Oct 2026

Conditional Dependence via U-Statistics Pruning

arXiv 2410.15888 ↗First posted 21 Oct 2024stat.ML cs.IT math.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the inversion of ill-conditioned autocorrelation matrices. This paper presents a novel measure of conditional dependence based on the use of incomplete unbiased statistics of degree two, which allows to re-interpret independence as uncorrelatedness on a finite-dimensional feature space. This formulation enables to prune data according to observations of the confounder itself, thus avoiding matrix inversions altogether. The proposed approach is articulated as an extension of the Hilbert-Schmidt independence criterion, which becomes expressible through kernels that operate on 4-tuples of data.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 31 references that are in the map. First posted on arXiv 21 Oct 2024.

Builds on

5 of 31 references.

References · 5

  1. 2020A Measure-Theoretic Approach to Kernel Conditional Mean Embeddingscited by 86
  2. 2017Approximate Kernel-based Conditional Independence Tests for Fast Non-Parametric Causal Discoverycited by 76
  3. 2016Kernel-based Tests for Joint Independencecited by 40
  4. 2017Randomized incomplete U-statistics in high dimensionscited by 12
  5. 2017Interaction Information for Causal Inference: The Case of Directed Trianglecited by 7

Built on by

Not cited yet.