mlsanityData to 7 Oct 2026

Direct Estimation of Information Divergence Using Nearest Neighbor Ratios

arXiv 1702.05222 ↗First posted 17 Feb 2017cs.IT cs.AI math.ITcited by 11

Not on the map. Why?

Abstract (arXiv)

We propose a direct estimation method for R'enyi and f-divergence measures based on a new graph theoretical interpretation. Suppose that we are given two sample sets X and Y, respectively with N and M samples, where η:=M/N is a constant value. Considering the k-nearest neighbor (k-NN) graph of Y in the joint data set (X,Y), we show that the average powered ratio of the number of X points to the number of Y points among all k-NN points is proportional to R'enyi divergence of X and Y 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"older smooth functions, the estimator achieves the MSE rate of O(N-2γ/(γ+d)). Furthermore, by using a weighted ensemble estimation technique, for density functions with continuous and bounded derivatives of up to the order d, and some extra conditions at the support set boundary, we derive an ensemble estimator that achieves the parametric MSE rate of O(1/N). Our estimators are more computationally tractable than other competing estimators, which makes them appealing in many practical applications.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 3; 2024: 2; 2025: 2; 2026: 1.

11 papers.