S. Benítez Peña, S. Novo Díaz, J. García González Redondo

Ensuring interpretability and robustness in machine learning models while preserving fairness is critical for trustworthy decision-making in high-stakes applications. This paper investigates the trade-off between fairness, sparsity, and predictive performance in classification. We propose a robust framework based on Twin SVMs that incorporates sparsity penalties for embedded feature selection together with explicit fairness constraints. Unlike standard approaches, our formulation enables the joint optimization of interpretability and equitable decision-making. To move beyond hard classification toward risk-aware decision-making, we extend the framework to yield calibrated probabilistic predictions. We evaluate ensembles built with different calibration strategies, analyzing their effect on the reliability and stability of probability estimates. Extensive experiments analyze the impact of regularization and fairness levels on both accuracy and the stability of selected features.

Keywords: Algorithmic Fairness, Sparse Learning, Probabilistic Calibration, Interpretable Classification

Scheduled

GT TABiDa I
September 2, 2026  11:20 AM
Aula 24


Other papers in the same session


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.