paper-with-me

홈 › Papers

Nearest neighbor density functional estimation from inverse Laplace transform

2018-05-22 · J. Jon Ryu, Shouvik Ganguly, Young-Han Kim, Yung-Kyun Noh, Daniel D. Lee

A new approach to $L_2$-consistent estimation of a general density functional using $k$-nearest neighbor distances is proposed, where the functional under consideration is in the form of the expectation of some function $f$ of the densities at each point. The estimator is designed to be asymptotically unbiased, using the convergence of the normalized volume of a $k$-nearest neighbor ball to a Gamma distribution in the large-sample limit, and naturally involves the inverse Laplace transform of a scaled version of the function $f.$ Some instantiations of the proposed estimator recover existing $k$-nearest neighbor based estimators of Shannon and R\'enyi entropies and Kullback--Leibler and R\'enyi divergences, and discover new consistent estimators for many other functionals such as logarithmic entropies and divergences. The $L_2$-consistency of the proposed estimator is established for a broad class of densities for general functionals, and the convergence rate in mean squared error is established as a function of the sample size for smooth, bounded densities.

📄 PDF Abstract BibTeX arXiv:1805.08342

Code (1)

jongharyu/knn-functional-estimation 공식 구현

Similar Papers 제목 키워드 기반

A Local Density-Based Approach for Local Outlier Detection

2016-06-28 · Bo Tang, Haibo He

This paper presents a simple but effective density-based outlier detection approach with the local kernel density estimation (KDE). A Relative Density-based Outlier Score (RDOS) is introduced to measure the local outlier…

Density EstimationObjectOutlier Detection

Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators

2016-06-05 · NeurIPS 2016 12 · Shashank Singh, Barnabás Póczos

We provide finite-sample analysis of a general framework for using k-nearest neighbor statistics to estimate functionals of a nonparametric continuous probability density, including entropies and divergences. Rather than…

DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search

2021-07-06 · Matti Karppa, Martin Aumüller, Rasmus Pagh

Kernel Density Estimation (KDE) is a nonparametric method for estimating the shape of a density function, given a set of samples from the distribution. Recently, locality-sensitive hashing, originally proposed as a tool …

Density Estimation

Density estimation from unweighted k-nearest neighbor graphs: a roadmap

2013-12-01 · NeurIPS 2013 12 · Ulrike Von Luxburg, Morteza Alamgir

Consider an unweighted k-nearest neighbor graph on n points that have been sampled i.i.d. from some unknown density p on R^d. We prove how one can estimate the density p just from the unweighted adjacency matrix of the…

Density Estimation

Clustering by Deep Nearest Neighbor Descent (D-NND): A Density-based Parameter-Insensitive Clustering Method

2015-12-07 · Teng Qiu, YongJie Li

Most density-based clustering methods largely rely on how well the underlying density is estimated. However, density estimation itself is also a challenging problem, especially the determination of the kernel bandwidth. …

ClusteringDensity Estimation