Improving Mutual Information Estimation with Annealed and Energy-Based Bounds
Rob Brekelmans, Sicong Huang, Marzyeh Ghassemi, Greg Ver Steeg, Roger, Grosse, Alireza Makhzani

TL;DR
This paper introduces new bounds for mutual information estimation using importance sampling, improving accuracy especially in high MI scenarios, and unifies several existing bounds within a single framework.
Contribution
It proposes three novel MI bounds based on importance sampling, including Multi-Sample AIS, GIWAE, and MINE-AIS, unifying and enhancing previous methods.
Findings
Multi-Sample AIS tightly estimates large MI values.
GIWAE unifies variational and contrastive bounds.
MINE-AIS improves energy-based MI estimation.
Abstract
Mutual information (MI) is a fundamental quantity in information theory and machine learning. However, direct estimation of MI is intractable, even if the true joint probability density for the variables of interest is known, as it involves estimating a potentially high-dimensional log partition function. In this work, we present a unifying view of existing MI bounds from the perspective of importance sampling, and propose three novel bounds based on this approach. Since accurate estimation of MI without density information requires a sample size exponential in the true MI, we assume either a single marginal or the full joint density information is known. In settings where the full joint density is available, we propose Multi-Sample Annealed Importance Sampling (AIS) bounds on MI, which we demonstrate can tightly estimate large values of MI in our experiments. In settings where only a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Topic Modeling · Domain Adaptation and Few-Shot Learning
MethodsInfoNCE
