Logistic lasso regression with nearest neighbors for gradient-based dimension reduction
基于最近邻的逻辑套索回归与梯度降维
This paper investigates a new approach to estimate the gradient of the conditional probability given the covariates in the binary classification framework. The proposed approach consists of fitting a localized nearest-neighbor logistic model with $\ell_1$-penalty in order to cope with possibly high-dimensional covariates. Our theoretical analysis shows that the pointwise convergence rate of the gradient estimator is optimal under very mild assumptions. Moreover, using an…