Saved in:
Bibliographic Details
Main Author: Hasler, Caren
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.17551
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908897191657472
author Hasler, Caren
author_facet Hasler, Caren
contents We study the consistency of the $k$-nearest neighbor regressor under complex survey designs. While consistency results for this algorithm are well established for independent and identically distributed data, corresponding results for complex survey data are lacking. We show that the $k$-nearest neighbor regressor is consistent under regularity conditions on the sampling design and the distribution of the data. We derive lower bounds for the rate of convergence and show that these bounds exhibit the curse of dimensionality, as in the independent and identically distributed setting. Empirical studies based on simulated and real data illustrate our theoretical findings.
format Preprint
id arxiv_https___arxiv_org_abs_2603_17551
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Consistency of the $k$-Nearest Neighbor Regressor under Complex Survey Designs
Hasler, Caren
Machine Learning
We study the consistency of the $k$-nearest neighbor regressor under complex survey designs. While consistency results for this algorithm are well established for independent and identically distributed data, corresponding results for complex survey data are lacking. We show that the $k$-nearest neighbor regressor is consistent under regularity conditions on the sampling design and the distribution of the data. We derive lower bounds for the rate of convergence and show that these bounds exhibit the curse of dimensionality, as in the independent and identically distributed setting. Empirical studies based on simulated and real data illustrate our theoretical findings.
title Consistency of the $k$-Nearest Neighbor Regressor under Complex Survey Designs
topic Machine Learning
url https://arxiv.org/abs/2603.17551