dorsal/arxiv
View SchemaOn the use of graph models to achieve individual and group fairness
| Authors | Arturo Pérez-Peralta, Sandra Benítez-Peña, Rosa E. Lillo |
|---|---|
| Categories | |
| ArXiv ID | 2601.08784vv1 |
| URL | https://arxiv.org/abs/2601.08784 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Machine Learning algorithms are ubiquitous in key decision-making contexts such as justice, healthcare and finance, which has spawned a great demand for fairness in these procedures. However, the theoretical properties of such models in relation with fairness are still poorly understood, and the intuition behind the relationship between group and individual fairness is still lacking. In this paper, we provide a theoretical framework based on Sheaf Diffusion to leverage tools based on dynamical systems and homology to model fairness. Concretely, the proposed method projects input data into a bias-free space that encodes fairness constrains, resulting in fair solutions. Furthermore, we present a collection of network topologies handling different fairness metrics, leading to a unified method capable of dealing with both individual and group bias. The resulting models have a layer of interpretability in the form of closed-form expressions for their SHAP values, consolidating their place in the responsible Artificial Intelligence landscape. Finally, these intuitions are tested on a simulation study and standard fairness benchmarks, where the proposed methods achieve satisfactory results. More concretely, the paper showcases the performance of the proposed models in terms of accuracy and fairness, studying available trade-offs on the Pareto frontier, checking the effects of changing the different hyper-parameters, and delving into the interpretation of its outputs.
{
"annotation_id": "f7d8ec2b-9cb2-4ca3-92e5-272d5404d0db",
"date_created": "2026-02-17T05:53:16.228000Z",
"date_modified": "2026-02-17T05:53:16.228000Z",
"file_hash": "f33da9bb129cb62e675aa1cb7bfa9af7275b3e78409f6fc863c2636be7e67a1a",
"private": false,
"record": {
"abstract": "Machine Learning algorithms are ubiquitous in key decision-making contexts such as justice, healthcare and finance, which has spawned a great demand for fairness in these procedures. However, the theoretical properties of such models in relation with fairness are still poorly understood, and the intuition behind the relationship between group and individual fairness is still lacking. In this paper, we provide a theoretical framework based on Sheaf Diffusion to leverage tools based on dynamical systems and homology to model fairness. Concretely, the proposed method projects input data into a bias-free space that encodes fairness constrains, resulting in fair solutions. Furthermore, we present a collection of network topologies handling different fairness metrics, leading to a unified method capable of dealing with both individual and group bias. The resulting models have a layer of interpretability in the form of closed-form expressions for their SHAP values, consolidating their place in the responsible Artificial Intelligence landscape. Finally, these intuitions are tested on a simulation study and standard fairness benchmarks, where the proposed methods achieve satisfactory results. More concretely, the paper showcases the performance of the proposed models in terms of accuracy and fairness, studying available trade-offs on the Pareto frontier, checking the effects of changing the different hyper-parameters, and delving into the interpretation of its outputs.",
"arxiv_id": "2601.08784",
"authors": [
"Arturo P\u00e9rez-Peralta",
"Sandra Ben\u00edtez-Pe\u00f1a",
"Rosa E. Lillo"
],
"categories": [
"stat.ML",
"cs.CY",
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "On the use of graph models to achieve individual and group fairness",
"url": "https://arxiv.org/abs/2601.08784",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9a70f5a1-05f4-4fbd-99a9-1fc160165dfa",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}