mlsanityData to 7 Oct 2026

GRAPHGINI: Fostering Individual and Group Fairness in Graph Neural Networks

arXiv 2402.12937 ↗First posted 20 Feb 2024cs.LG cs.SIcited by 2

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have demonstrated impressive performance across various tasks, leading to their increased adoption in high-stakes decision-making systems. However, concerns have arisen about GNNs potentially generating unfair decisions for underprivileged groups or individuals when lacking fairness constraints. This work addresses this issue by introducing GraphGini, a novel approach that incorporates the Gini coefficient to enhance both individual and group fairness within the GNN framework. We rigorously establish that the Gini coefficient offers greater robustness and promotes equal opportunity among GNN outcomes, advantages not afforded by the prevailing Lipschitz constant methodology. Additionally, we employ the Nash social welfare program to ensure our solution yields a Pareto optimal distribution of group fairness. Extensive experimentation on real-world datasets demonstrates GraphGini's efficacy in significantly improving individual fairness compared to state-of-the-art methods while maintaining utility and group fairness.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 58 references that are in the map. First posted on arXiv 20 Feb 2024.

Builds on

29 of 58 references.

References · 29

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2018How Powerful are Graph Neural Networks?cited by 4,355
  5. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  6. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  7. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  8. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
  9. 2019Graph Neural Networks for Social Recommendationcited by 711
  10. 2020Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Informationcited by 168
  11. 2020A Semi-supervised Graph Attentive Network for Financial Fraud Detectioncited by 150
  12. 2021Towards a Unified Framework for Fair and Stable Graph Representation Learningcited by 128
17 more
  1. 2019Compositional Fairness Constraints for Graph Embeddingscited by 126
  2. 2022A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainabilitycited by 118
  3. 2018A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indicescited by 97
  4. 2021Trustworthy AI: A Computational Perspectivecited by 93
  5. 2022Fairness in Graph Mining: A Surveycited by 76
  6. 2018Bias Mitigation Post-processing for Individual and Group Fairnesscited by 72
  7. 2021Graph-Based Deep Learning for Medical Diagnosis and Analysis: Past, Present and Futurecited by 67
  8. 2019Operationalizing Individual Fairness with Pairwise Fair Representationscited by 64
  9. 2023No prejudice! Fair Federated Graph Neural Networks for Personalized Recommendationcited by 18
  10. 2020GraphReach: Position-Aware Graph Neural Network using Reachability Estimationscited by 14
  11. 2023FairGAT: Fairness-aware Graph Attention Networkscited by 12
  12. 2023BeMap: Balanced Message Passing for Fair Graph Neural Networkcited by 11
  13. 2019Equitable Allocations of Indivisible Goodscited by 9
  14. 2020Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Datacited by 7
  15. 2019JNET: Learning User Representations via Joint Network Embedding and Topic Embeddingcited by 4
  16. 2024Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clusteringcited by 4
  17. 2021A simple method for estimating the Lorenz curvecited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.