- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies demographic parity gaps in node classification, link prediction, and node regression. Through theoretical analyses, the authors derive task-specific fairness bounds and point out group-mean separation and within-group covariance as key contributing factors. Motivated by these findings, the authors propose FairProp, an extension of APPNP that incorporates mean-equalization projection and within-group variance regularization. Experiments across all three tasks show that FairProp substantially reduces demographic parity gaps while preserving predictive performance, thereby improving the accuracy--fairness trade-off.
Critical strengths
- Comprehensive coverage of multiple graph learning tasks
A key strength of this paper is its comprehensive coverage of multiple graph learning tasks, including node classification, link prediction, and node regression (prior work primarily focuses on a single task, particularly node classification). Beyond empirical evaluation, the authors derive task-specific fairness bounds and provide a unified theoretical perspective that identifies group-mean separation and within-group covariance as key contributors to demographic parity gaps. Furthermore, FairProp addresses fairness across all three tasks, demonstrating the broad applicability of the theoretical findings and proposed approach.
- Clear improvements in the accuracy--fairness trade-off
Despite targeting multiple graph learning tasks, FairProp achieves substantial reductions in demographic parity gaps compared to baseline methods. As shown in Table 1, FairProp consistently improves fairness across widely used graph fairness datasets. Furthermore, it maintains comparable predictive performance in 9 of the 10 reported settings across Tables 1--3 (except for GermanCredit node regression). These results highlight FairProp’s effectiveness in improving the accuracy--fairness trade-off across diverse graph learning tasks.
Critical weaknesses
- Missing equal opportunity evaluation
Of the 18 baseline papers, 14 report both demographic parity and equal opportunity gaps, as these metrics capture complementary aspects of group fairness (overall positive prediction rates vs. true positive rates). However, this paper evaluates only demographic parity, despite equal opportunity being well-defined for node classification (or link prediction). This omission is particularly concerning because FairProp explicitly targets demographic parity, while its impact on equal opportunity remains unexplored. Therefore, the authors should provide an empirical or theoretical analysis of equal opportunity to ensure a more comprehensive fairness evaluation consistent with prior work, rather than deferring this issue to future work.
- Dependence on sensitive-group availability
While many fairness-aware GNN methods assume access to node-level sensitive attributes, either for training nodes or for all nodes, FairProp appears particularly reliant on this information, as it explicitly aligns group means and regularizes within-group covariance. This raises concerns about its applicability when sensitive attributes are unavailable or partially observed. The authors should clarify the extent to which FairProp requires sensitive attributes and evaluate its robustness to missing or inaccurate group information, for instance, by varying the error rate of sensitive-attribute assignments or incorporating a sensitive-attribute prediction module.
Questions for authors
-
Does FairProp require sensitive-attribute information for all nodes, or is access to this information for training nodes sufficient?
-
Can the core ideas of FairProp (mean-equalization projection and within-group variance regularization) be extended to other GNN architectures? While APPNP appears to have been chosen for its decoupling of feature propagation and prediction, it would be helpful to clarify whether FairProp is inherently limited to APPNP or can be generalized to other architectures.