Contrastive Log-Ratio Upper Bound (CLUB)

• CLUB is a method that tightly upper bounds mutual information by contrasting log-likelihoods of matching and mismatched data pairs, ensuring unbiased estimation under independence.
• It employs a variational approximation (vCLUB) to substitute p(x|y) with a neural network model, enabling closed-form computations in exponential family cases.
• The framework improves scalability via negative sampling and demonstrates superior performance in synthetic experiments, representation learning, and domain adaptation.

The Contrastive Log-ratio Upper Bound (CLUB) is a framework for estimating and minimizing mutual information (MI) in high-dimensional scenarios where only samples from the relevant distributions, rather than their explicit forms, are available. CLUB constructs a tight, variationally-approximable upper bound on MI that enables stable and scalable MI minimization—tasks where lower bound estimators are inapplicable. The CLUB methodology addresses the estimation bias, computational scalability, and numerical instability that afflict earlier MI upper bound strategies, thereby facilitating its use in representation learning, domain adaptation, and information bottleneck contexts (Cheng et al., 2020).

1. Formal Definition of CLUB

Let $(X, Y)$ be random variables with joint distribution $p(x, y)$. Mutual information is defined as

$$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$

The CLUB estimator presumes access to the conditional density $p(x \mid y)$ and defines

$$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$

Given $N$ i.i.d. samples $\{(x_i, y_i)\}_{i=1}^N$, the empirical estimate is

$$\hat I_{\mathrm{CLUB}} = \frac{1}{N} \sum_{i=1}^N \log p(x_i | y_i) - \frac{1}{N^2} \sum_{i=1}^N \sum_{j=1}^N \log p(x_j | y_i) = \frac{1}{N^2} \sum_{i, j} \left[\log p(x_i | y_i) - \log p(x_j | y_i)\right].$$

This estimator relies on the explicit evaluation or modeling of $p(x|y)$, and operates by contrasting log-likelihoods across matched and mismatched pairs.

2. Upper Bound Derivation and Tightness

Define the gap $\Delta = I_{\mathrm{CLUB}}(X; Y) - I(X; Y)$. The derivation proceeds as follows: $p(x, y)$0 By concavity of $p(x, y)$1 and Jensen’s inequality, $p(x, y)$2, guaranteeing that $p(x, y)$3. Thus,

$p(x, y)$4

with equality if and only if $p(x, y)$5 is independent of $p(x, y)$6, i.e., $p(x, y)$7. The bound is tight for independent variables and grows otherwise; the magnitude reflects the deviation from independence.

3. Variational Approximation: vCLUB

When $p(x, y)$8 is unknown or intractable, CLUB is made practical via a variational approximation. A conditional model $p(x, y)$9 (typically parameterized by neural networks) is introduced: $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$0 with the sample estimator

$$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$1

For parametric exponential family forms, such as Gaussians with mean $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$2 and diagonal covariance, this estimator admits closed-form computations based on Mahalanobis distances.

4. Theoretical Properties and Bias Analysis

The theoretical guarantees of CLUB are as follows:

• Exactness: $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$3, with equality if and only if $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$4.
• vCLUB as Upper Bound: Let $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$5. If $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$6, then $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$7.
• Approximation Error: If, in addition, $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$8 and $$I(X; Y) = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x, y)}{p(x)p(y)} \right] = \mathbb{E}_{p(x, y)} \left[ \log \frac{p(x \mid y)}{p(x)} \right].$$9, then $p(x \mid y)$0.

A plausible implication is that strong variational modeling of $p(x \mid y)$1 ensures not only the validity but the tightness of the CLUB upper bound relative to the true mutual information.

5. Scalable MI Minimization Training: Negative Sampling Scheme

The original estimator is quadratic in $p(x \mid y)$2. CLUB–S and vCLUB–S accelerate computation via negative sampling, lowering the complexity to $p(x \mid y)$3. Training involves two main phases:

1. Conditional Model Update: Fit $p(x \mid y)$4 to maximize conditional log-likelihood over data batches.
2. MI Minimization via Negative Sampling: For each positive $p(x \mid y)$5 pair, one negative is sampled, constructing $p(x \mid y)$6. Then,

$p(x \mid y)$7

is minimized w.r.t. the generative model parameters $p(x \mid y)$8.

$$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$7

This sampled variant is unbiased and substantially more scalable. The negative sampling strategy improves both statistical and computational characteristics of the bound.

6. Empirical Evaluation and Practical Performance

CLUB and its variational extensions have undergone validation on both synthetic and real-world benchmarks:

• Synthetic Estimation: On Gaussian/Cubic data ($p(x \mid y)$9, true $$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$0), CLUB attains the lowest bias and minimum squared error compared to competing lower and upper bound MI estimators. CLUB–S incurs slightly higher variance but maintains unbiasedness.
• Information Bottleneck (MNIST, latent dim=256): CLUB and vCLUB achieve lower test classification error (approaching $$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$1) than DVB (VUB), MINE, NWJ, InfoNCE, and Leave-One-Out estimators. Negative sampling further enhances generalization.
• Unsupervised Domain Adaptation: In MNIST$$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$2MNIST-M and USPS$$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$3MNIST settings, within a disentangled representation objective minimizing $$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$4, CLUB–S provides the highest or near-highest target domain accuracy ($$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$5–$$I_{\mathrm{CLUB}}(X; Y) = \mathbb{E}_{p(x, y)} [\log p(x \mid y)] - \mathbb{E}_{p(x)p(y)} [\log p(x \mid y)].$$6), surpassing lower-bound and prior upper-bound estimators that suffer from numerical instability.

The aggregate findings demonstrate that CLUB delivers a tight, stable, and computationally efficient upper bound for MI estimation and minimization in high-dimensional deep learning tasks (Cheng et al., 2020).