Direct Estimation of Information Divergence Using Nearest Neighbor Ratios
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
Citing papers per year: 2022: 3; 2023: 3; 2024: 2; 2025: 2; 2026: 1.
11 papers.
- 2022MAUVE Scores for Generative Models: Theory and Practicecited by 34
- 2022Action Noise in Off-Policy Deep Reinforcement Learning: Impact on Exploration and Performancecited by 21
- 2024Discriminative Estimation of Total Variation Distance: A Fidelity Auditor for Generative Datacited by 10
- 2023The Representation Jensen-Shannon Divergencecited by 9
- 2023The Conditional Cauchy-Schwarz Divergence with Applications to Time-Series Data and Sequential Decision Makingcited by 6
- 2022The Stanford Drone Dataset is More Complex than We Think: An Analysis of Key Characteristicscited by 4
- 2025Improving Privacy Benefits of Redactioncited by 2
- 2023A Theoretical Perspective on Subnetwork Contributions to Adversarial Robustnesscited by 0
- 2024A Unifying Information-theoretic Perspective on Evaluating Generative Modelscited by 0
- 2025Sample Complexity of Nonparametric Closeness Testing for Continuous Distributions and Its Application to Causal Discovery with Hidden Confoundingcited by 0
- 2026Local polynomial density ratio estimationcited by 0
- 2026Local polynomial density ratio estimation29 Sep 2026
- 2025Sample Complexity of Nonparametric Closeness Testing for Continuous Distributions and Its Application to Causal Discovery with Hidden Confounding10 Mar 2025
- 2025Improving Privacy Benefits of Redaction29 Jan 2025
- 2024A Unifying Information-theoretic Perspective on Evaluating Generative Models18 Dec 2024
- 2024Discriminative Estimation of Total Variation Distance: A Fidelity Auditor for Generative Data24 May 2024
- 2023A Theoretical Perspective on Subnetwork Contributions to Adversarial Robustness7 Jul 2023
- 2023The Representation Jensen-Shannon Divergence25 May 2023
- 2023The Conditional Cauchy-Schwarz Divergence with Applications to Time-Series Data and Sequential Decision Making21 Jan 2023
- 2022MAUVE Scores for Generative Models: Theory and Practice30 Dec 2022
- 2022Action Noise in Off-Policy Deep Reinforcement Learning: Impact on Exploration and Performance8 Jun 2022
- 2022The Stanford Drone Dataset is More Complex than We Think: An Analysis of Key Characteristics22 Mar 2022