Model-Agnostic Fairness Regularization for GNNs with Incomplete Sensitive Information
Mahdi Tavassoli Kejani, Fadi Dornaika, Jean-Michel Loubes

TL;DR
This paper introduces a model-agnostic fairness regularization method for GNNs that effectively reduces bias even when sensitive attributes are only partially available, balancing fairness and accuracy.
Contribution
It proposes a novel fairness regularization framework for GNNs that operates with incomplete sensitive attribute data, addressing a key practical limitation of existing methods.
Findings
Significantly reduces bias across multiple fairness metrics
Maintains competitive node classification accuracy
Outperforms baseline models in fairness-accuracy trade-off
Abstract
Graph Neural Networks (GNNs) have demonstrated exceptional efficacy in relational learning tasks, including node classification and link prediction. However, their application raises significant fairness concerns, as GNNs can perpetuate and even amplify societal biases against protected groups defined by sensitive attributes such as race or gender. These biases are often inherent in the node features, structural topology, and message-passing mechanisms of the graph itself. A critical limitation of existing fairness-aware GNN methods is their reliance on the strong assumption that sensitive attributes are fully available for all nodes during training--a condition that poses a practical impediment due to privacy concerns and data collection constraints. To address this gap, we propose a novel, model-agnostic fairness regularization framework designed for the realistic scenario where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Ethics and Social Impacts of AI · Privacy-Preserving Technologies in Data
