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

22 Jun 2020Pengyu ChengWeituo HaoShuyang DaiJiachang LiuZhe GanLawrence Carin

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... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.