Empirical estimation of information

1 Histogram estimator

The obvious one for discrete data. For continuous data where the histogram bins must also be learned, this method is highly sensitive and can be inconsistent if you don’t do it right (Paninski 2003).

2 Parametric

🏗

3 Monte Carlo parametric

One case you might want to estimate this value is when there is no nonparametric estimation problem per se but the integral to solve it is inconvenient. In which case, we might use a Monte Carlo method.

John Schulmann explicates a good trick for estimating KL divergence in the case that you can simulate from $x_i\sim q$ and calculate $p(x)$ and $q(x_i),$ The following estimator is good despite looking unrelated:

$$\begin{array}{rl}KL[q,p]& ={\int }_{x}q(x)\log \frac{q(x)}{p(x)}\mathrm{d}x\\ & =E_{x\sim q}[\log \frac{q(x)}{p(x)}]\\ & \approx \frac{1}{N}\sum _{i=1}^N\frac{1}{2}(\log p(x)-\log q(x){)}^2\end{array}$$

He also introduced a simple debiased one that does even better. The mechanics are interesting. (If you actually want mutual information, this notionally calculates it if we find the KL divergence between joint and product densities; but that is not totally trivial I shall concede.)

4 Incoming

Inform: A C library for information analysis of complex systems

Inform is a cross-platform C library designed for performing information analysis of complex systems.

• The inform_dist struct provides discrete, empirical probability distributions. These form the basis for all of the information-theoretic measures.
• A collection of information measures built upon the distribution struct provide the core algorithms for the library, and are provided through the shannon.h header.
• A host of measures of the information dynamics on time series are built upon the core information measures. Each measure is housed in its own header, e.g. active_info.h.

See also ITE toolbox (estimators).

Information Theoretical Estimators (ITE) in Python

It

• is the redesigned, Python implementation of the Matlab/Octave ITE toolbox.
• can estimate numerous entropy, mutual information, divergence, association measures, cross quantities, and kernels on distributions.
• can be used to solve information theoretical optimization problems in a high-level way.
• comes with several demos.
• is free and open source: GNU GPLv3(>=).

Estimated quantities:

• entropy (H): Shannon entropy, Rényi entropy, Tsallis entropy (Havrda and Charvát entropy), Sharma-Mittal entropy, Phi-entropy (f-entropy).
• mutual information (I): Shannon mutual information (total correlation, multi-information), Rényi mutual information, Tsallis mutual information, chi-square mutual information (squared-loss mutual information, mean square contingency), L2 mutual information, copula-based kernel dependency, kernel canonical correlation analysis, kernel generalized variance, multivariate version of Hoeffding’s Phi, Hilbert-Schmidt independence criterion, distance covariance, distance correlation, Lancaster three-variable interaction.
• divergence (D): Kullback-Leibler divergence (relative entropy, I directed divergence), Rényi divergence, Tsallis divergence, Sharma-Mittal divergence, Pearson chi-square divergence (chi-square distance), Hellinger distance, L2 divergence, f-divergence (Csiszár-Morimoto divergence, Ali-Silvey distance), maximum mean discrepancy (kernel distance, current distance), energy distance (N-distance; specifically the Cramer-Von Mises distance), Bhattacharyya distance, non-symmetric Bregman distance (Bregman divergence), symmetric Bregman distance, J-distance (symmetrised Kullback-Leibler divergence, J divergence), K divergence, L divergence, Jensen-Shannon divergence, Jensen-Rényi divergence, Jensen-Tsallis divergence.
• association measures (A): multivariate extensions of Spearman’s rho (Spearman’s rank correlation coefficient, grade correlation coefficient), multivariate conditional version of Spearman’s rho, lower and upper tail dependence via conditional Spearman’s rho.
• cross quantities (C): cross-entropy,
• kernels on distributions (K): expected kernel (summation kernel, mean map kernel, set kernel, multi-instance kernel, ensemble kernel; specific convolution kernel), probability product kernel, Bhattacharyya kernel (Bhattacharyya coefficient, Hellinger affinity), Jensen-Shannon kernel, Jensen-Tsallis kernel, exponentiated Jensen-Shannon kernel, exponentiated Jensen-Rényi kernels, exponentiated Jensen-Tsallis kernels.
• conditional entropy (condH): conditional Shannon entropy.
• conditional mutual information (condI): conditional Shannon mutual information.

5 References