A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces

07/08/2020
by   Tommaso Cesari, et al.
0

The property of almost every point being a Lebesgue point has proven to be crucial for the consistency of several classification algorithms based on nearest neighbors. We characterize Lebesgue points in terms of a 1-Nearest Neighbor regression algorithm for pointwise estimation, fleshing out the role played by tie-breaking rules in the corresponding convergence problem. We then give an application of our results, proving the convergence of the risk of a large class of 1-Nearest Neighbor classification algorithms in general metric spaces where almost every point is a Lebesgue point.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2007

A Note on Approximate Nearest Neighbor Methods

A number of authors have described randomized algorithms for solving the...
research
06/30/2014

Rates of Convergence for Nearest Neighbor Classification

Nearest neighbor methods are a popular class of nonparametric estimators...
research
10/27/2021

Nearest neighbor process: weak convergence and non-asymptotic bound

An empirical measure that results from the nearest neighbors to a given ...
research
02/05/2022

One-Nearest-Neighbor Search is All You Need for Minimax Optimal Regression and Classification

Recently, Qiao, Duan, and Cheng (2019) proposed a distributed nearest-ne...
research
10/05/2018

Statistical Optimality of Interpolated Nearest Neighbor Algorithms

In the era of deep learning, understanding over-fitting phenomenon becom...
research
09/06/2013

Convergence of Nearest Neighbor Pattern Classification with Selective Sampling

In the panoply of pattern classification techniques, few enjoy the intui...
research
06/11/2013

Efficient Classification for Metric Data

Recent advances in large-margin classification of data residing in gener...

Please sign up or login with your details

Forgot password? Click here to reset