Demystifying Fixed k Nearest Neighbor Information Estimators
Estimating mutual information from independent identically distributed samples drawn from an unknown joint density function is a basic statistical problem of broad interest with multitudinous applications. The most popular estimator is the one proposed by Kraskov, Stogbauer, and Grassberger (KSG) in 2004 and is nonparametric and based on the distances of each sample to its $k^\mathrm{ th} nearest neighboring sample, where $k$ is a fixed small integer. Despite of its widespread use (part of scientific software packages) theoretical properties of this estimator have been largely unexplored. In this paper, we demonstrate that the estimator is consistent and also identify an upper bound on the rate of convergence of the \ell _{2} error as a function of a number of samples. We argue that the performance benefits of the KSG estimator stems from a curious "correlation boosting" effect and build on this intuition to modify the KSG estimator in novel ways to construct a superior estimator. As a by product of our investigations, we obtain nearly tight rates of convergence of the \ell _{2} error of the well known fixed $k$ nearest neighbor estimator of differential entropy by Kozachenko and Leonenko.
IEEE Trans. Inf. Theory