Consistency Of The \(k\)-nearest Neighbor Regressor Under Complex Survey Designs

Abstract

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.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhasler2026consistency

Related papers

• Certifiable Robustness For Nearest Neighbor Classifiers (2022)0.00
• Nearest Neighbor And Kernel Survival Analysis: Nonasymptotic Error Bounds And Strong Consistency Rates (2019)0.00
• An Adaptive Nearest Neighbor Rule For Classification (2019)0.00
• Universal Consistency Of The \(k\)-nn Rule In Metric Spaces And Nagata Dimension (2020)2.26
• Distributionally Robust Weighted \(k\)-nearest Neighbors (2020)0.00
• Nearest-neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions (2017)0.00
• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35
• A Two-stage Active Learning Algorithm For \(k\)-nearest Neighbors (2022)0.00