analiza aiqbench
This paper introduces a rigorous algebraic framework that unifies classification performance evaluation across diverse settings, from binary to multilabel and soft-label scenarios. By mapping aggregation operators directly to standard averaging methods, it provides a structural basis for deriving properties of complex metrics without measure-specific derivations. The work offers critical theoretical insights into metric behavior, such as the conditions under which micro-averaging collapses onto accuracy or how non-trivial performance floors exist even for incorrect classifiers.
A Unified Algebraic Framework for Classification Performance Evaluation
arXiv:2607.04028v2 Announce Type: replace-cross Abstract: We propose a unified algebraic framework for classification performance evaluation covering binary, multiclass, multilabel, ordinal, hierarchical, cost-sensitive, and soft-label settings. Actual and predicted labels are represented as binary indicator matrices, where three aggregation operators (global, column-wise, row-wise) correspond directly to micro, macro/weighted, and exemplar averaging. Any binary measure expressed in terms of the four confusion-matrix counts extends to all these settings by substituting an operator, with no measure-specific derivation. We show that structural properties governing an extension are derivable from the binary formula. Micro-averaging equals denominator-weighted macro-averaging precisely for aggregation-decomposable (linear-fractional) measures, a strict class characterised algebraically. For soft ground truth, we prove from t-norm axioms alone that the product t-norm is the unique choice whose confusion counts preserve marginal memberships. In multiclass settings, micro-precision, micro-recall, and micro-F1 collapse identically onto accuracy. Furthermore, binary skew-invariance transfers unconditionally to multilabel aggregation, but only partially to multiclass problems. For measures with a linear numerator and prediction-independent denominator, the optimal decision threshold is the share of the numerator weight favouring a negative prediction, revealing when standard training targets the measure. Under one-hot multiclass encoding, a measure fails to attain its theoretical minimum whenever its zero-true-positive value still depends on true negatives, establishing non-trivial performance floors even for completely incorrect classifiers (e.g., zero correct predictions on 10 classes yields a label accuracy of 0.8).
Abstract:We propose a unified algebraic framework for classification performance evaluation covering binary, multiclass, multilabel, ordinal, hierarchical, cost-sensitive, and soft-label settings. Actual and predicted labels are represented as binary indicator matrices, where three aggregation operators (global, column-wise, row-wise) correspond directly to micro, macro/weighted, and exemplar averaging. Any binary measure expressed in terms of the four confusion-matrix counts extends to all these settings by substituting an operator, with no measure-specific derivation. We show that structural properties governing an extension are derivable from the binary formula. Micro-averaging equals denominator-weighted macro-averaging precisely for aggregation-decomposable (linear-fractional) measures, a strict class characterised algebraically. For soft ground truth, we prove from t-norm axioms alone that the product t-norm is the unique choice whose confusion counts preserve marginal memberships. In multiclass settings, micro-precision, micro-recall, and micro-F1 collapse identically onto accuracy. Furthermore, binary skew-invariance transfers unconditionally to multilabel aggregation, but only partially to multiclass problems. For measures with a linear numerator and prediction-independent denominator, the optimal decision threshold is the share of the numerator weight favouring a negative prediction, revealing when standard training targets the measure. Under one-hot multiclass encoding, a measure fails to attain its theoretical minimum whenever its zero-true-positive value still depends on true negatives, establishing non-trivial performance floors even for completely incorrect classifiers (e.g., zero correct predictions on 10 classes yields a label accuracy of 0.8).
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2607.04028 [cs.LG]
(or arXiv:2607.04028v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.04028 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 315 cuvinte
Subiecte conexe
A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks
arXiv · 27 iul. 2026

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · 24 sept. 2026

[AINews] Opus 5.5 is good at explainer videos
Latent Space · 29 sept. 2026

[AINews] The Future of Latent Space
Latent Space · 25 sept. 2026