ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2010.00438
69
33

Analysis of KNN Density Estimation

30 September 2020
Puning Zhao
Lifeng Lai
ArXiv (abs)PDFHTML
Abstract

We analyze the ℓ1\ell_1ℓ1​ and ℓ∞\ell_\inftyℓ∞​ convergence rates of k nearest neighbor density estimation method. Our analysis includes two different cases depending on whether the support set is bounded or not. In the first case, the probability density function has a bounded support and is bounded away from zero. We show that kNN density estimation is minimax optimal under both ℓ1\ell_1ℓ1​ and ℓ∞\ell_\inftyℓ∞​ criteria, if the support set is known. If the support set is unknown, then the convergence rate of ℓ1\ell_1ℓ1​ error is not affected, while ℓ∞\ell_\inftyℓ∞​ error does not converge. In the second case, the probability density function can approach zero and is smooth everywhere. Moreover, the Hessian is assumed to decay with the density values. For this case, our result shows that the ℓ∞\ell_\inftyℓ∞​ error of kNN density estimation is nearly minimax optimal. The ℓ1\ell_1ℓ1​ error does not reach the minimax lower bound, but is better than kernel density estimation.

View on arXiv
Comments on this paper