High Dimensional Classification through ℓ_0-Penalized Empirical Risk Minimization

11/23/2018

∙

by   Le-Yu Chen, et al.

∙

Columbia University

∙

Academia Sinica

∙

0

∙

share

We consider a high dimensional binary classification problem and construct a classification procedure by minimizing the empirical misclassification risk with a penalty on the number of selected features. We derive non-asymptotic probability bounds on the estimated sparsity as well as on the excess misclassification risk. In particular, we show that our method yields a sparse solution whose l0-norm can be arbitrarily close to true sparsity with high probability and obtain the rates of convergence for the excess misclassification risk. The proposed procedure is implemented via the method of mixed integer linear programming. Its numerical performance is illustrated in Monte Carlo experiments.