Minimax optimal high-dimensional classification using deep neural networks

Abstract

High-dimensional classification is a fundamentally important research problem in high-dimensional data analysis. In this paper, we derive a nonasymptotic rate for the minimax excess misclassification risk when feature dimension exponentially diverges with the sample size and the Bayes classifier possesses a complicated modular structure. We also show that classifiers based on deep neural networks can attain the above rate, hence, are minimax optimal.

References in corpus (5)

• High-dimensional classification using features annealed independence rules
• Fast learning rates for plug-in classifiers
• On Deep Instrumental Variables Estimate
• A Convex Optimization Approach to High-Dimensional Sparse Quadratic Discriminant Analysis
• Sharp Rate of Convergence for Deep Neural Network Classifiers under the Teacher-Student Setting