Jul 2026· Knowledge and Information Systems· Vol 68· 0 citations· 66 references
Computer Science
TL;DR
This paper presents a fairness-aware graph structure learning framework demonstrating how learning fair graphs leads to fairer data for ML training and, consequently, fairer artificial intelligence (AI) decisioning based on such models.
Abstract
Ensuring fairness when training machine learning (ML) models remains a critical challenge, particularly when biases are embedded in the underlying data. This paper presents a fairness-aware graph structure learning framework demonstrating how learning fair graphs leads to fairer data for ML training and, consequently, fairer artificial intelligence (AI) decisioning based on such models. Our method incorporates a fairness regularization term into score-based structure learning algorithms, guiding the search toward graph structures that minimize discriminatory pathways while preserving statistical relationships. The learned fair graph structures enable the generation of synthetic datasets with mitigated biases, which can be used to train diverse ML models. This modification is non-trivial, as structure learning algorithms rely on local search strategies, while fairness is a global property that depends on the entire graph structure. Our framework is highly adaptable, compatible with various structure learning algorithms, and seamlessly incorporates different fairness metrics to meet specific contextual needs. Extensive experiments on both real-world and synthetic datasets demonstrate that our approach significantly improves fairness while maintaining competitive predictive performance, offering an interpretable and versatile solution for mitigating bias in AI systems.
It is formally proved that GNN architectures lacking spectral expressiveness impose strict constraints on the representation space, so that harmful linear correlations between sensitive attributes and target prediction logits are preserved whenever a low-expressive backbone is paired with a debiasing operator acting wi...
Ming-Qi Yang, Zhao-Yu Liu· ACM Transactions on Knowledg...· 0 citations
Demographic-Independent Fair Graph Learning mitigates group unfairness by minimizing disparities in individual treatment across implicitly identified subgroups, thereby enforcing fairness without requiring explicit demographic information.
Zi-Chong Wang, Zhi-Peng Yin, Mo Sha et al.· Proceedings of the Thirty-Fi...· 4 citations
This study highlights the importance of jointly optimizing the graph construction process and fairness objectives in GCN-based learning, providing a systematic approach toward building more equitable and effective graph-based models.
N. Zafeiropoulos, Emmanouil Mavrikos, George E. Tsekouras· 0 citations
This paper develops theoretical bounds on the unfairness and expected loss at deployment, and derives sufficient conditions under which fairness and accuracy can be perfectly transferred via invariant representation learning, and designs a learning algorithm such that fair ML models learned with training data still hav...
Graph neural networks (GNNs) are the standard tool for node representation learning and are increasingly used in high-stakes settings. Their message-passing backbone, however, can amplify topological bias, raising fairness concerns. We study group fairness at the level of downstream predictions for node classification,...
Multimodal graph learning has recently emerged as an effective paradigm for in corporating inter-entity relationships into multimodal representations. Existing studies have made substantial progress on how to construct and optimize graphs, but rarely consider a more fundamental question: whether additional relational s...
Ze-Kai Chen, Kai Hu, Yu-Xin Zeng et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.