Risk-averse Fair Multi-class Classification
Not on the map. Why?
Abstract (arXiv)
We develop a new classification framework based on the theory of coherent risk measures and systemic risk. The proposed approach is suitable for multi-class problems when the data is noisy, scarce (relative to the dimension of the problem), and the labeling might be unreliable. In the first part of our paper, we provide the foundation of the use of systemic risk models and show how to apply it in the context of linear and kernel-based multi-class problems. More advanced formulation via a system-theoretic approach with non-linear aggregation is proposed, which leads to a two-stage stochastic programming problem. A risk-averse regularized decomposition method is designed to solve the problem. We use a popular multi-class method as a benchmark in the performance analysis of the proposed classification methods. We illustrate our ideas by proposing several generalization of that method by the use of coherent measures of risk. The viability of the proposed risk-averse methods are supported theoretically and numerically. Additionally, we demonstrate that the application of systemic risk measures facilitates enforcing fairness in classification. Analysis and experiments regarding the fairness of the proposed models are carefully conducted. For all methods, our numerical experiments demonstrate that they are robust in the presence of unreliable training data and perform better on unknown data than the methods minimizing expected classification errors. Furthermore, the performance improves when the number of classes increases.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 46 references that are in the map. First posted on arXiv 6 Sep 2025.
Builds on
16 of 46 references.
References · 16
- 2014Certifying and removing disparate impactcited by 715
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
- 2017Generalised Dice overlap as a deep learning loss function for highly unbalanced segmentationscited by 620
- 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 443
- 2017On Fairness and Calibrationcited by 406
- 2017A General and Adaptive Robust Loss Functioncited by 236
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2020Fair Regression with Wasserstein Barycenterscited by 100
- 2020FairBatch: Batch Selection for Model Fairnesscited by 99
- 2016A Confidence-Based Approach for Balancing Fairness and Accuracycited by 73
- 2017Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labelscited by 52
- 2019A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalizationcited by 23
4 more
- 2021Wasserstein Robust Classification with Fairness Constraintscited by 10
- 2022Metrizing Fairnesscited by 6
- 2018Risk-Averse Classificationcited by 3
- 2023On Risk Evaluation and Control of Distributed Multi-Agent Systemscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.