atlas

Research map / Learning theory and algorithms / Sample complexity

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

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a bias-corrected fixed-k k-NN estimator instead of plugging in a consistent k-NN density estimate (k grows with n)k-NN functional estimators (entropy, divergence) · theoretical analysis, beta-Holder densities on [0,1]^DMSE convergence rateHelped
Fix k (no k→∞) with bias correction versus plug-in with k≍n^{β/(β+D)}fixed-k estimators · theory, beta in (0,2]MSE rate exponentHelped
Replace compact-support boundary assumption with locally lower-bounded density (A4)fixed-k estimator analysis · theoryapplicability of finite-sample boundsNo clear effect
Choosing k increasing (e.g., k=n/2) vs fixed k=1 in empirical hypothesis testsk-NN estimators in hypothesis testing · prior empirical work discussedtest performanceMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy