Reproducibility study of FairAC
Not on the map. Why?
Abstract (arXiv)
This work aims to reproduce the findings of the paper "Fair Attribute Completion on Graph with Missing Attributes" written by Guo, Chu, and Li arXiv:2302.12977 by investigating the claims made in the paper. This paper suggests that the results of the original paper are reproducible and thus, the claims hold. However, the claim that FairAC is a generic framework for many downstream tasks is very broad and could therefore only be partially tested. Moreover, we show that FairAC is generalizable to various datasets and sensitive attributes and show evidence that the improvement in group fairness of the FairAC framework does not come at the expense of individual fairness. Lastly, the codebase of FairAC has been refactored and is now easily applicable for various datasets and models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 23 references that are in the map. First posted on arXiv 5 Jun 2024.
Builds on
13 of 23 references.
References · 13
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2020Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Informationcited by 168
- 2017Data Decisions and Theoretical Implications when Adversarially Learning Fair Representationscited by 165
- 2021Towards a Unified Framework for Fair and Stable Graph Representation Learningcited by 128
- 2019On the Apparent Conflict Between Individual and Group Fairnesscited by 126
- 2022Fairness in Graph Mining: A Surveycited by 76
- 2020Learning on Attribute-Missing Graphscited by 42
- 2023Fair Attribute Completion on Graph with Missing Attributescited by 22
Built on by
Not cited yet.