mlsanityData to 7 Oct 2026

Nearest neighbor empirical processes

arXiv 2110.15083 ↗First posted 27 Oct 2021math.ST stat.ML stat.THcited by 2

Not on the map. Why?

Abstract (arXiv)

In the regression framework, the empirical measure based on the responses resulting from the nearest neighbors, among the covariates, to a given point x is introduced and studied as a central statistical quantity. First, the associated empirical process is shown to satisfy a uniform central limit theorem under a local bracketing entropy condition on the underlying class of functions reflecting the localizing nature of the nearest neighbor algorithm. Second a uniform non-asymptotic bound is established under a well-known condition, often referred to as Vapnik-Chervonenkis, on the uniform entropy numbers. The covariance of the Gaussian limit obtained in the uniform central limit theorem is simply equal to the conditional covariance operator given the covariate value. This suggests the possibility of using standard formulas to estimate the variance by using only the nearest neighbors instead of the full data. This is illustrated on two problems: the estimation of the conditional cumulative distribution function and local linear regression.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 64 references that are in the map. First posted on arXiv 27 Oct 2021.

Builds on

5 of 64 references.

References · 5

  1. 2014Hierarchical Nearest-Neighbor Gaussian Process Models for Large Geostatistical Datasetscited by 71
  2. 2017Local nearest neighbour classification with applications to semi-supervised learningcited by 17
  3. 2020Nearest Neighbour Based Estimates of Gradients: Sharp Nonasymptotic Bounds and Applicationscited by 6
  4. 2019Rates of Convergence for Large-scale Nearest Neighbor Classificationcited by 3
  5. 2020Risk bounds when learning infinitely many response functions by ordinary linear regressioncited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.