Towards a Unified Framework for Fair and Stable Graph Representation Learning

Chirag Agarwal, Himabindu Lakkaraju, Marinka Zitnik
2/25/2021
cs.LG

Official code: chirag-agarwall/nifty (42 stars, MIT, last commit 2021-04-03).

Abstract

As the representations output by Graph Neural Networks (GNNs) are increasingly employed in real-world applications, it becomes important to ensure that these representations are fair and stable. In this work, we establish a key connection between counterfactual fairness and stability and leverage it to propose a novel framework, NIFTY (uNIfying Fairness and stabiliTY), which can be used with any GNN to learn fair and stable representations. We introduce a novel objective function that simultaneously accounts for fairness and stability and develop a layer-wise weight normalization using the Lipschitz constant to enhance neural message passing in GNNs. In doing so, we enforce fairness and stability both in the objective function as well as in the GNN architecture. Further, we show theoretically that our layer-wise weight normalization promotes counterfactual fairness and stability in the resulting representations. We introduce three new graph datasets comprising of high-stakes decisions in criminal justice and financial lending domains. Extensive experimentation with the above datasets demonstrates the efficacy of our framework.

View on arXivView PDF

Code Implementations(1)

MIT

Code for paper https://arxiv.org/abs/2102.13186

4213PythonFeb 25, 20215 years agoMIT
fairnessgraph-neural-networksgraph-representation-learningrobustnessstability

Similar Papers

Cite this paper

@article{agarwal2021towards,
  title  = {Towards a Unified Framework for Fair and Stable Graph Representation Learning},
  author = {Chirag Agarwal and Himabindu Lakkaraju and Marinka Zitnik},
  year   = {2021},
  eprint = {2102.13186},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2102.13186}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2102.13186.svg)](https://codeofpaper.com/paper/2102.13186)

Discussion