Direct Estimation of Information Divergence Using Nearest Neighbor Ratios
Abstract
We propose a direct estimation method for R\'{e}nyi and f-divergence measures based on a new graph theoretical interpretation. Suppose that we are given two sample sets and , respectively with and samples, where is a constant value. Considering the -nearest neighbor (-NN) graph of in the joint data set , we show that the average powered ratio of the number of points to the number of points among all -NN points is proportional to R\'{e}nyi divergence of and densities. A similar method can also be used to estimate f-divergence measures. We derive bias and variance rates, and show that for the class of -H\"{o}lder smooth functions, the estimator achieves the MSE rate of . Furthermore, by using a weighted ensemble estimation technique, for density functions with continuous and bounded derivatives of up to the order , and some extra conditions at the support set boundary, we derive an ensemble estimator that achieves the parametric MSE rate of . Our estimators are more computationally tractable than other competing estimators, which makes them appealing in many practical applications.
Cite
@article{arxiv.1702.05222,
title = {Direct Estimation of Information Divergence Using Nearest Neighbor Ratios},
author = {Morteza Noshad and Kevin R. Moon and Salimeh Yasaei Sekeh and Alfred O. Hero},
journal= {arXiv preprint arXiv:1702.05222},
year = {2017}
}
Comments
2017 IEEE International Symposium on Information Theory (ISIT)