Nearest Neighbor and Kernel Survival Analysis: Nonasymptotic Error Bounds and Strong Consistency Rates
arXiv:1905.05285
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.
arXiv commentInternational Conference on Machine Learning (ICML 2019); this draft includes minor corrections
References in corpus (6)
- DeepSurv: Personalized Treatment Recommender System Using A Cox Proportional Hazards Deep Neural Network
- Fast learning rates for plug-in classifiers
- Bounds on the Lambert function and their application to the outage analysis of user cooperation
- Rates of Convergence for Nearest Neighbor Classification
- k-NN Regression Adapts to Local Intrinsic Dimension
- k*-Nearest Neighbors: From Global to Local