English

A New Measure of Conditional Dependence

Machine Learning 2017-06-05 v2 Machine Learning

Abstract

Measuring conditional dependencies among the variables of a network is of great interest to many disciplines. This paper studies some shortcomings of the existing dependency measures in detecting direct causal influences or their lack of ability for group selection to capture strong dependencies and accordingly introduces a new statistical dependency measure to overcome them. This measure is inspired by Dobrushin's coefficients and based on the fact that there is no dependency between XX and YY given another variable ZZ, if and only if the conditional distribution of YY given X=xX=x and Z=zZ=z does not change when XX takes another realization xx' while ZZ takes the same realization zz. We show the advantages of this measure over the related measures in the literature. Moreover, we establish the connection between our measure and the integral probability metric (IPM) that helps to develop estimators of the measure with lower complexity compared to other relevant information theoretic based measures. Finally, we show the performance of this measure through numerical simulations.

Keywords

Cite

@article{arxiv.1704.00607,
  title  = {A New Measure of Conditional Dependence},
  author = {Jalal Etesami and Kun Zhang and Negar Kiyavash},
  journal= {arXiv preprint arXiv:1704.00607},
  year   = {2017}
}
R2 v1 2026-06-22T19:05:52.760Z