Multilabel Prediction with Probability Sets: The Hamming Loss Case

Abstract

In this paper, we study how multilabel predictions can be obtained when our uncertainty is described by a convex set of probabilities. Such predictions, typically consisting of a set of potentially optimal decisions, are hard to make in large decision spaces such as the one considered in multilabel problems. However, we show that when considering the Hamming loss, an approximate prediction can be efficiently computed from label-wise information, as in the precise case. We also perform some first experiments showing the interest of performing partial predictions in the multilabel case. © Springer International Publishing Switzerland 2014.