Cost-sensitive Multiclass Classification Risk Bounds

Bernardo Avila Pires 1 Mohammad Ghavamzadeh 2 Csaba Szepesvari 1
2 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : A commonly used approach to multiclass classification is to replace the 0-1 loss with a convex surrogate so as to make empirical risk minimization computationally tractable. Previous work has uncovered sufficient and necessary conditions for the consistency of the resulting procedures. In this paper, we strengthen these results by showing how the 0-1 excess loss of a predictor can be upper bounded as a function of the excess loss of the predictor measured using the convex surrogate. The bound is developed for the case of cost-sensitive multiclass classification and a convex surrogate loss that goes back to the work of Lee, Lin and Wahba. The bounds are as easy to calculate as in binary classification. Furthermore, we also show that our analysis extends to the analysis of the recently introduced "Simplex Coding" scheme.
Type de document :
Communication dans un congrès
International Conference on Machine Learning, Jun 2013, Atlanta, United States. 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00840485
Contributeur : Mohammad Ghavamzadeh <>
Soumis le : mardi 2 juillet 2013 - 15:35:56
Dernière modification le : jeudi 11 janvier 2018 - 01:49:33
Document(s) archivé(s) le : mercredi 5 avril 2017 - 06:16:12

Fichier

icml2013multiclass.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00840485, version 1

Collections

Citation

Bernardo Avila Pires, Mohammad Ghavamzadeh, Csaba Szepesvari. Cost-sensitive Multiclass Classification Risk Bounds. International Conference on Machine Learning, Jun 2013, Atlanta, United States. 2013. 〈hal-00840485〉

Partager

Métriques

Consultations de la notice

432

Téléchargements de fichiers

161