On Rank Graduation Metrics for High Dimensional Ordinal Data
Not on the map. Why?
Abstract (arXiv)
Evaluating the reliability of machine learning classifications remains a fundamental challenge in Artificial Intelligence (AI), particularly when the target variable is multidimensional. Classification variables can be expressed by means of a categorical scale which, at best, is ordinal. Because ordinal data lack a natural metric structure in their underlying space, most conventional distance measures aimed at assessing the accuracy of machine learning classifications cannot be directly or meaningfully applied. In this paper, we develop a mathematical framework for comparing ordinal data based on a family of Rank Graduation (RGXp) metrics. We demonstrate that these metrics can quantify the proportion of variability of the response explained by the predictions, in a similar manner as the predictive R2 for continuous response variables. After establishing theoretical connections between the RGXp family and other prominent metrics in AI, we conduct extensive experiments across diverse datasets and learning tasks to evaluate their empirical performance. The results underscore the versatility, interpretability, and robustness of the RGXp metrics as a principled foundation for developing trustworthy and SAFE AI systems.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Nov 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026A Rank Graduation metric for Algorithmic fairness30 Sep 2026
- 2026Measuring AI harms with multidimensional Lorenz Zonoids29 Jul 2026
- 2026I-SAFE: Wasserstein Coherence Metrics for Structural Auditing of Scientific AI Models20 May 2026
- 2026Explainable cluster analysis: a bagging approach20 Mar 2026