On Generalizing the C-Bound to the Multiclass and Multi-label Settings
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 13 Jan 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.