2020

CLUB: A Contrastive Log-ratio Upper Bound of Mutual Information

Cheng, Pengyu, Hao, Weituo, Dai, Shuyang et al.

Understand

Mutual information (MI) minimization has gained considerable interests in various machine learning tasks.

  • However, estimating and minimizing MI in high-dimensional spaces remains a challenging problem, especially when only samples, rather than distribution forms, are accessible.
  • Previous works mainly focus on MI lower bound approximation, which is not applicable to MI minimization problems.
  • In this paper, we propose a novel Contrastive Log-ratio Upper Bound (CLUB) of mutual information.

Reading the bibliography…