English

C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation

Machine Learning 2020-07-24 v2 Information Theory math.IT Machine Learning

Abstract

Estimation of information theoretic quantities such as mutual information and its conditional variant has drawn interest in recent times owing to their multifaceted applications. Newly proposed neural estimators for these quantities have overcome severe drawbacks of classical kkNN-based estimators in high dimensions. In this work, we focus on conditional mutual information (CMI) estimation by utilizing its formulation as a minmax optimization problem. Such a formulation leads to a joint training procedure similar to that of generative adversarial networks. We find that our proposed estimator provides better estimates than the existing approaches on a variety of simulated data sets comprising linear and non-linear relations between variables. As an application of CMI estimation, we deploy our estimator for conditional independence (CI) testing on real data and obtain better results than state-of-the-art CI testers.

Keywords

Cite

@article{arxiv.2005.08226,
  title  = {C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation},
  author = {Arnab Kumar Mondal and Arnab Bhattacharya and Sudipto Mukherjee and Prathosh AP and Sreeram Kannan and Himanshu Asnani},
  journal= {arXiv preprint arXiv:2005.08226},
  year   = {2020}
}

Comments

Updated for UAI, 2020 camera-ready version

R2 v1 2026-06-23T15:36:14.114Z