Metraipolis › archive › dc_955bb19a9cd4

The Optimal Ranking Tradeoffs Between Two Ranking Scores in Two-Class Classification — arXiv:2610.23294

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.23294
License (as archived)
CC0-1.0
Archived
2026-10-19T08:44:25.024Z
SHA-256 of the archived text
c854cea3c4af00b99afe1c53d6fd0c0ff29296bf4f14b2d969a1ff988b1f2086
Stable URL of this page
https://metraipolis.com/documento/dc_955bb19a9cd4

How to cite

The Optimal Ranking Tradeoffs Between Two Ranking Scores in Two-Class Classification — arXiv:2610.23294 — arXiv (en), https://arxiv.org/abs/2610.23294 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_955bb19a9cd4 (Metraipolis archive dc_955bb19a9cd4, sha256 c854cea3c4af00b99afe1c53d6fd0c0ff29296bf4f14b2d969a1ff988b1f2086)
BibTeX
@misc{dc955bb19a9cd4,
  title = {The Optimal Ranking Tradeoffs Between Two Ranking Scores in Two-Class Classification — arXiv:2610.23294},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.23294},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_955bb19a9cd4; sha256 c854cea3c4af00b99afe1c53d6fd0c0ff29296bf4f14b2d969a1ff988b1f2086},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.23294. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The accuracy, true negative rate (negative class recall), true positive rate (positive class recall), negative predictive value (negative class precision), positive predictive value (positive class precision), class-specific intersections over unions, class-specific F-scores, Cohen's kappa, and balanced accuracy are scores that one intuitively wants to maximize when developing machine learning methods. However, they lead to different rankings of such methods. So, how can we establish a ranking that is an optimal tradeoff between any pair of these scores? It turns out that all these scores are special cases of ranking scores: a continuum of scores parameterized by the relative importance values assigned to the true negative, false positive, false negative, and true positive outcomes. Since all these scores are known to induce meaningful rankings, we seek the optimal tradeoffs among them. We consider the tradeoff between two scores to be optimal when it minimizes the Fréchet variance regarding the Kendall distance (also known as the bubble-sort distance) between rankings. For any given set of classifiers to rank, the optimal tradeoff lies at the center of the shortest (geodesic) path on the manifold of all rankings induced by the ranking scores. However, in the parameter space of the ranking scores, it is rarely achieved by averaging the importance values corresponding to the initial scores. In this paper, we present an exact analytical solution for determining a ranking score that is an optimal tradeoff for any given pair of initial scores, in the common case where the class priors are the same for all compared performances. We also experimentally investigate what happens when performance follows some distributions with fixed priors.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.PF, nuovi lavori del giorno).
Categorie arXiv: Performance (cs.PF) ; Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.23294 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:40:09.818Z dalla pagina https://arxiv.org/list/cs.PF/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).