On Generalizing the C-Bound to the Multiclass and Multi-label Settings
Résumé
The C-bound, introduced in Lacasse et al., gives a tight upper bound on the risk of a binary majority vote classifier. In this work, we present a first step towards extending this work to more complex outputs, by providing generalizations of the C-bound to the multiclass and multi-label settings.
Domaines
Machine Learning [stat.ML]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|