Adversarial Cost-Sensitive Classification

Abstract

In many classification settings, mistakes incur different application-dependent penalties based on the predicted and the actual class label. Cost-sensitive classifiers that attempt to minimize these application-based penalties are needed. We propose a robust minimax approach for producing classifiers that directly minimize the cost of mistakes as a convex optimization problem. This is in contrast to previous methods that minimize the empirical risk using a convex surrogate for the cost of mistakes, since minimizing the empirical risk of the actual cost-sensitive loss is generally intractable. By treating properties of the training data as being uncertain, our approach avoids these computational difficulties. We develop theory and algorithms for our approach and demonstrate its benefits on cost-sensitive classification tasks.