Fair Node Representation Learning via Adaptive Data Augmentation

• URL: http://arxiv.org/abs/2201.08549v1
• Date: Fri, 21 Jan 2022 05:49:15 GMT
• Title: Fair Node Representation Learning via Adaptive Data Augmentation
• Authors: O. Deniz Kose, Yanning Shen
• Abstract summary: This work theoretically explains the sources of bias in node representations obtained via Graph Neural Networks (GNNs) Building upon the analysis, fairness-aware data augmentation frameworks are developed to reduce the intrinsic bias. Our analysis and proposed schemes can be readily employed to enhance the fairness of various GNN-based learning mechanisms.
• Score: 9.492903649862761
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Node representation learning has demonstrated its efficacy for various applications on graphs, which leads to increasing attention towards the area. However, fairness is a largely under-explored territory within the field, which may lead to biased results towards underrepresented groups in ensuing tasks. To this end, this work theoretically explains the sources of bias in node representations obtained via Graph Neural Networks (GNNs). Our analysis reveals that both nodal features and graph structure lead to bias in the obtained representations. Building upon the analysis, fairness-aware data augmentation frameworks on nodal features and graph structure are developed to reduce the intrinsic bias. Our analysis and proposed schemes can be readily employed to enhance the fairness of various GNN-based learning mechanisms. Extensive experiments on node classification and link prediction are carried out over real networks in the context of graph contrastive learning. Comparison with multiple benchmarks demonstrates that the proposed augmentation strategies can improve fairness in terms of statistical parity and equal opportunity, while providing comparable utility to state-of-the-art contrastive methods.

Related papers

• Graph Classification with GNNs: Optimisation, Representation and Inductive Bias [0.6445605125467572]
  We argue that such equivalence ignores the accompanying optimization issues and does not provide a holistic view of the GNN learning process. We prove theoretically that the message-passing layers in the graph, have a tendency to search for either discriminative subgraphs, or a collection of discriminative nodes dispersed across the graph.
  arXiv  Detail & Related papers  (2024-08-17T18:15:44Z)
• Graph Reasoning Networks [9.18586425686959]
  Graph Reasoning Networks (GRNs) is a novel approach to combine the strengths of fixed and learned graph representations and a reasoning module based on a differentiable satisfiability solver. Results on real-world datasets show comparable performance to GNNs. Experiments on synthetic datasets demonstrate the potential of the newly proposed method.
  arXiv  Detail & Related papers  (2024-07-08T10:53:49Z)
• DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations [62.04558318166396]
  Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures. A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes. Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
  arXiv  Detail & Related papers  (2024-01-28T06:43:13Z)
• FairSample: Training Fair and Accurate Graph Convolutional Neural Networks Efficiently [29.457338893912656]
  Societal biases against sensitive groups may exist in many real world graphs. We present an in-depth analysis on how graph structure bias, node attribute bias, and model parameters may affect the demographic parity of GCNs. Our insights lead to FairSample, a framework that jointly mitigates the three types of biases.
  arXiv  Detail & Related papers  (2024-01-26T08:17:12Z)
• Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
  We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs) In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together. Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
  arXiv  Detail & Related papers  (2023-12-19T18:00:15Z)
• Analyzing the Effect of Sampling in GNNs on Individual Fairness [79.28449844690566]
  Graph neural network (GNN) based methods have saturated the field of recommender systems. We extend an existing method for promoting individual fairness on graphs to support mini-batch, or sub-sample based, training of a GNN. We show that mini-batch training facilitate individual fairness promotion by allowing for local nuance to guide the process of fairness promotion in representation learning.
  arXiv  Detail & Related papers  (2022-09-08T16:20:25Z)
• FairNorm: Fair and Fast Graph Neural Network Training [9.492903649862761]
  Graph neural networks (GNNs) have been demonstrated to achieve state-of-the-art for a number of graph-based learning tasks. It has been shown that GNNs may inherit and even amplify bias within training data, which leads to unfair results towards certain sensitive groups. This work proposes FairNorm, a unified normalization framework that reduces the bias in GNN-based learning.
  arXiv  Detail & Related papers  (2022-05-20T06:10:27Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Unbiased Graph Embedding with Biased Graph Observations [52.82841737832561]
  We propose a principled new way for obtaining unbiased representations by learning from an underlying bias-free graph. Based on this new perspective, we propose two complementary methods for uncovering such an underlying graph.
  arXiv  Detail & Related papers  (2021-10-26T18:44:37Z)
• Fairness-Aware Node Representation Learning [9.850791193881651]
  This study addresses fairness issues in graph contrastive learning with fairness-aware graph augmentation designs. Different fairness notions on graphs are introduced, which serve as guidelines for the proposed graph augmentations. Experimental results on real social networks are presented to demonstrate that the proposed augmentations can enhance fairness in terms of statistical parity and equal opportunity.
  arXiv  Detail & Related papers  (2021-06-09T21:12:14Z)
• Towards Deeper Graph Neural Networks [63.46470695525957]
  Graph convolutions perform neighborhood aggregation and represent one of the most important graph operations. Several recent studies attribute this performance deterioration to the over-smoothing issue. We propose Deep Adaptive Graph Neural Network (DAGNN) to adaptively incorporate information from large receptive fields.
  arXiv  Detail & Related papers  (2020-07-18T01:11:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.