aiqbench analysis
This research introduces a novel framework for fair multi-class classification using coherent risk measures to handle overlapping sensitive attributes and group interactions. The proposed method offers robustness against data corruption and scarcity while scaling efficiently, outperforming standard support-vector machine approaches in fairness-sensitive scenarios.
Fairness in multi-class multi-group classification problems via contextial coherent risk measures
arXiv:2608.30223v1 Announce Type: cross Abstract: We propose a new design of fair classifiers for multi-class classification problems in the presence of vector-valued sensitive attributes. In that scenario each sensitive attribute has multiple values and forms several groups relevant to the fairness consideration. Naturally those groups are overlapping and one should also analyze the interaction of factors. Additionally, the decision makers aided by the classification should not violate individual rights at the expense of satisfying fairness metrics at the group level. We propose an approach using the theory and methods of coherent measures of risk aiming at resolving the fairness challenges. Further, we propose a specialized numerical method for solving the resulting optimization problem. The method scales well with the increase of the number of observations. Additionally, we note that the obtained classifier is robust with respect to corrupted data or to situation when data is scarce. We demonstrate the advantages of the proposed framework in comparison to the support-vector machine framework and other methods handling fairness.
Abstract:We propose a new design of fair classifiers for multi-class classification problems in the presence of vector-valued sensitive attributes. In that scenario each sensitive attribute has multiple values and forms several groups relevant to the fairness consideration. Naturally those groups are overlapping and one should also analyze the interaction of factors. Additionally, the decision makers aided by the classification should not violate individual rights at the expense of satisfying fairness metrics at the group level. We propose an approach using the theory and methods of coherent measures of risk aiming at resolving the fairness challenges. Further, we propose a specialized numerical method for solving the resulting optimization problem. The method scales well with the increase of the number of observations. Additionally, we note that the obtained classifier is robust with respect to corrupted data or to situation when data is scarce. We demonstrate the advantages of the proposed framework in comparison to the support-vector machine framework and other methods handling fairness.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2608.30223 [stat.ML]
(or arXiv:2608.30223v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2608.30223 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 258 words
Related coverage

Handling Imbalanced Classification: What Works Better Than SMOTE
Analytics Vidhya · Jul 12, 2026

Academia is for Ambition — Alex Zhang, MIT
Latent Space · Oct 2, 2026
Base Models Can Detect Hidden Intentions that Prompted Classifiers Miss
LessWrong · Oct 12, 2026

[AINews] not much happened today
Latent Space · Oct 3, 2026