Nearest Neighbor And Kernel Survival Analysis: Nonasymptotic Error Bounds And Strong Consistency Rates

Abstract

We establish the first nonasymptotic error bounds for Kaplan-Meier-based nearest neighbor and kernel survival probability estimators where feature vectors reside in metric spaces. Our bounds imply rates of strong consistency for these nonparametric estimators and, up to a log factor, match an existing lower bound for conditional CDF estimation. Our proof strategy also yields nonasymptotic guarantees for nearest neighbor and kernel variants of the Nelson-Aalen cumulative hazards estimator. We experimentally compare these methods on four datasets. We find that for the kernel survival estimator, a good choice of kernel is one learned using random survival forests.

Stats

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

Related papers

• Kernel Density Estimation Through Density Constrained Near Neighbor Search (2020)5.84
• Consistency Of The \(k\)-nearest Neighbor Regressor Under Complex Survey Designs (2026)0.00
• Nearest-neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions (2017)0.00
• Fast And Bayes-consistent Nearest Neighbors (2019)0.00
• Certifiable Robustness For Nearest Neighbor Classifiers (2022)0.00
• Explaining The Success Of Nearest Neighbor Methods In Prediction (2025)18.63
• An Adaptive Nearest Neighbor Rule For Classification (2019)0.00
• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35