Fairness-Aware Node Representation Learning

Abstract

Node representation learning has demonstrated its effectiveness for various applications on graphs. Particularly, recent developments in contrastive learning have led to promising results in unsupervised node representation learning for a number of tasks. Despite the success of graph contrastive learning and consequent growing interest, fairness is largely under-explored in the field. To this end, this study addresses fairness issues in graph contrastive learning with fairness-aware graph augmentation designs, through adaptive feature masking and edge deletion. In the study, different fairness notions on graphs are introduced, which serve as guidelines for the proposed graph augmentations. Furthermore, theoretical analysis is provided to quantitatively prove that the proposed feature masking approach can reduce intrinsic bias. 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, while providing comparable classification accuracy to state-of-the-art contrastive methods for node classification.

15 pages, 4 tables, submitted manuscript

References in corpus (15)

• Adam: A Method for Stochastic Optimization
• PyTorch: An Imperative Style, High-Performance Deep Learning Library
• A Simple Framework for Contrastive Learning of Visual Representations
• Learning deep representations by mutual information estimation and maximization
• Fast Graph Representation Learning with PyTorch Geometric
• Simplifying Graph Convolutional Networks
• Graph Contrastive Learning with Adaptive Augmentation
• Deep Graph Contrastive Representation Learning
• Data Decisions and Theoretical Implications when Adversarially Learning Fair Representations
• InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization
• HARP: Hierarchical Representation Learning for Networks
• Towards a Unified Framework for Fair and Stable Graph Representation Learning
• Spatio-Temporal Deep Graph Infomax
• Majorization and dynamics of continuous distributions
• Interpretable Stability Bounds for Spectral Graph Filters

Cited by in corpus (5)

• Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakage
• A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainability
• Towards Fair Graph Neural Networks via Graph Counterfactual
• Counterfactual Learning on Graphs: A Survey
• Modeling Techniques for Machine Learning Fairness: A Survey