- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
In this paper, the authors propose a framework for fair graph editing that models task-related and sensitive contributions to edge formation, uses uncertainty bounds to decide when to intervene, and audits whether edits match their intended targets. Experiments report reduced group disparities with small accuracy costs. Its certificate covers prediction stability under fixed interventions, without guaranteeing fairness improvement.
Critical strengths
-
The paper explains why lower group disparity alone cannot determine which graph edges should change, directing attention toward the quality of structural decisions.
-
The framework distinguishes inaccurate mechanism estimates, uncertain interventions, and incorrect editing decisions, allowing each stage to be evaluated independently.
-
The experiments cover four datasets and evaluate accuracy, statistical parity disparity, and counterfactual disparity, alongside analyses of certificate coverage, abstention, and action fidelity.
Critical weaknesses
-
The proposed MIC qualifies edits based on prediction stability, but small prediction changes do not necessarily imply reduced unfairness. The connection between passing the certificate and selecting beneficial fairness interventions remains indirect.
-
Feature similarity is treated as task-related, but removing sensitive attributes and labels does not remove their proxies or demonstrate that the remaining similarity captures useful task information.
-
Beating random selection demonstrates useful selection, but does not establish the added value of MIC over simpler confidence-based or prediction-change-based selection rules.
-
The lower bound concerns policies restricted to three aggregate statistics. It provides limited explanation of the behavior of full GNNs and editors that use much richer graph information.
Questions for authors
Please refer to the Critical Weaknesses.