English

Calibrated Surrogate Losses for Classification with Label-Dependent Costs

Machine Learning 2010-09-15 v1

Abstract

We present surrogate regret bounds for arbitrary surrogate losses in the context of binary classification with label-dependent costs. Such bounds relate a classifier's risk, assessed with respect to a surrogate loss, to its cost-sensitive classification risk. Two approaches to surrogate regret bounds are developed. The first is a direct generalization of Bartlett et al. [2006], who focus on margin-based losses and cost-insensitive classification, while the second adopts the framework of Steinwart [2007] based on calibration functions. Nontrivial surrogate regret bounds are shown to exist precisely when the surrogate loss satisfies a "calibration" condition that is easily verified for many common losses. We apply this theory to the class of uneven margin losses, and characterize when these losses are properly calibrated. The uneven hinge, squared error, exponential, and sigmoid losses are then treated in detail.

Keywords

Cite

@article{arxiv.1009.2718,
  title  = {Calibrated Surrogate Losses for Classification with Label-Dependent Costs},
  author = {Clayton Scott},
  journal= {arXiv preprint arXiv:1009.2718},
  year   = {2010}
}

Comments

33 pages, 7 figures

R2 v1 2026-06-21T16:13:49.908Z