Neyman-Pearson Multi-class Classification via Cost-sensitive Learning

Abstract

Most existing classification methods aim to minimize the overall misclassification error rate. However, in applications such as loan default prediction, different types of errors can have varying consequences. To address this asymmetry issue, two popular paradigms have been developed: the Neyman-Pearson (NP) paradigm and the cost-sensitive (CS) paradigm. Previous studies on the NP paradigm have primarily focused on the binary case, while the multi-class NP problem poses a greater challenge due to its unknown feasibility. In this work, we tackle the multi-class NP problem by establishing a connection with the CS problem via strong duality and propose two algorithms. We extend the concept of NP oracle inequalities, crucial in binary classifications, to NP oracle properties in the multi-class context. Our algorithms satisfy these NP oracle properties under certain conditions. Furthermore, we develop practical algorithms to assess the feasibility and strong duality in multi-class NP problems, which can offer practitioners the landscape of a multi-class NP problem with various target error levels. Simulations and real data studies validate the effectiveness of our algorithms. To our knowledge, this is the first study to address the multi-class NP problem with theoretical guarantees. The proposed algorithms have been implemented in the R package \texttt{npcs}, which is available on CRAN.

114 pages, 18 figures

References in corpus (13)

• Fast learning rates for plug-in classifiers
• Neyman-Pearson (NP) classification algorithms and NP receiver operating characteristics (NP-ROC)
• Neyman-Pearson classification, convexity and stochastic constraints
• Neyman-Pearson Classification under High-Dimensional Settings
• Intentional Control of Type I Error over Unconscious Data Distortion: a Neyman-Pearson Approach to Text Classification
• THORS: An Efficient Approach for Making Classifiers Cost-sensitive
• A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptation
• Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints
• Bridging Cost-sensitive and Neyman-Pearson Paradigms for Asymmetric Binary Classification
• A flexible model-free prediction-based framework for feature ranking
• Non-splitting Neyman-Pearson Classifiers
• Tight Rates in Supervised Outlier Transfer Learning
• Distribution-Free Rates in Neyman-Pearson Classification