The Multiclass Score-Oriented Loss (MultiSOL) on the Simplex
Francesco Marchetti, Edoardo Legnaro, Sabrina Guastavino
TL;DR
This work extends score-oriented losses from binary to multiclass classification by introducing a multidimensional threshold on the simplex. The MultiSOL framework defines a per-class confusion-matrix expectation under threshold distributions and optimizes a chosen score directly during training, using Monte Carlo sampling and differentiable surrogates. Empirical results across MNIST, FashionMNIST, CIFAR-10, and MedMNIST demonstrate robustness to priors and hyperparameters, competitive performance relative to state-of-the-art losses, and clear evidence of score-driven behavior. Overall, MultiSOL provides a principled mechanism to achieve metric-specific optimization in multiclass, particularly in imbalanced settings, linking simplex geometry with score-oriented learning.
Abstract
In the supervised binary classification setting, score-oriented losses have been introduced with the aim of optimizing a chosen performance metric directly during the training phase, thus avoiding \textit{a posteriori} threshold tuning. To do this, in their construction, the decision threshold is treated as a random variable provided with a certain \textit{a priori} distribution. In this paper, we use a recently introduced multidimensional threshold-based classification framework to extend such score-oriented losses to multiclass classification, defining the Multiclass Score-Oriented Loss (MultiSOL) functions. As also demonstrated by several classification experiments, this proposed family of losses is designed to preserve the main advantages observed in the binary setting, such as the direct optimization of the target metric and the robustness to class imbalance, achieving performance comparable to other state-of-the-art loss functions and providing new insights into the interaction between simplex geometry and score-oriented learning.
