REVIEW 2 cited by
Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Fair graph learning plays a pivotal role in numerous practical applications. Recently, many fair graph learning methods have been proposed; however, their evaluation often relies on poorly constructed semi-synthetic datasets or substandard real-world datasets. In such cases, even a basic Multilayer Perceptron (MLP) can outperform Graph Neural Networks (GNNs) in both utility and fairness. In this work, we illustrate that many datasets fail to provide meaningful information in the edges, which may challenge the necessity of using graph structures in these problems. To address these issues, we develop and introduce a collection of synthetic, semi-synthetic, and real-world datasets that fulfill a broad spectrum of requirements. These datasets are thoughtfully designed to include relevant graph structures and bias information crucial for the fair evaluation of models. The proposed synthetic and semi-synthetic datasets offer the flexibility to create data with controllable bias parameters, thereby enabling the generation of desired datasets with user-defined bias values with ease. Moreover, we conduct systematic evaluations of these proposed datasets and establish a unified evaluation approach for fair graph learning models. Our extensive experimental results with fair graph learning methods across our datasets demonstrate their effectiveness in benchmarking the performance of these methods. Our datasets and the code for reproducing our experiments are available at https://github.com/XweiQ/Benchmark-GraphFairness.
Forward citations
Cited by 2 Pith papers
-
Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing
FGU is a shard-based graph unlearning framework with a local fairness regularizer plus a global disparity alignment step, reporting lower demographic parity and equal opportunity gaps than existing graph unlearning baselines.
-
Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes
Fairwos learns pseudo-sensitive features from graph data and enforces fairness by aligning embeddings with nearby same-label nodes, claiming fair GNNs without sensitive attributes.
Discussion (0). Continue with ORCID to comment.