Metraipolis › archive › dc_2d75feb772d3
Fairness in multi-class multi-group classification problems via contextial coherent risk measures — arXiv:2608.30223
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30223
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:39:56.389Z
- SHA-256 of the archived text
b769e66de550f8c32fb0389e45b35f1b44d757595857a44ba6a495d64c636a4b- Stable URL of this page
https://metraipolis.com/documento/dc_2d75feb772d3
How to cite
Fairness in multi-class multi-group classification problems via contextial coherent risk measures — arXiv:2608.30223 — arXiv (en), https://arxiv.org/abs/2608.30223 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d75feb772d3 (Metraipolis archive dc_2d75feb772d3, sha256 b769e66de550f8c32fb0389e45b35f1b44d757595857a44ba6a495d64c636a4b)
BibTeX
@misc{dc2d75feb772d3,
title = {Fairness in multi-class multi-group classification problems via contextial coherent risk measures — arXiv:2608.30223},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30223},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d75feb772d3; sha256 b769e66de550f8c32fb0389e45b35f1b44d757595857a44ba6a495d64c636a4b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30223. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.LG). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.30223 — 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-17T08:13:26.932Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).