REVIEW 2 cited by
Nearest neighbor empirical processes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
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.
Forward citations
Cited by 2 Pith papers
-
On the pointwise and sup-norm errors for local regression estimators
The shape of local averaging regions, not just their size, determines whether a local regression estimator achieves the minimax rate, and a single condition called shape regularity is both necessary and sufficient.
-
Pointwise convergence of purely random partition estimators: from random trees to prototype rules
A single shape-regularity criterion determines which purely random partitions reach the minimax regression rate; centered and uniform trees fail it, while Mondrian trees and OptiNet pass, and Proto-NN gets its first p...
Discussion (0). Continue with ORCID to comment.