- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
Fairness in Influence Maximization (IM) tries to spread information widely while avoiding large disparities across different parts of a network. However, existing related methods need to have knowledge about the groups' sensitive attributes, like gender or race, in advance. For this reason, the authors propose Adaptive Unobserved-Group Attainability for Influence Maximization (AURA-IM) for fair influence maximization beyond predefined groups. It normalizing node reach against structural attainability ceilings, it uses an adversarial latent auditor to discover worst-served intersectional latent groups, and uses Frank-Wolfe optimization and extragradient updates to optimize seed selection. The labels of the groups are used only after seed selection, for evaluation.
Critical strengths
- The paper introduces a meaninguful problem, that of ffair influence maximization without access to nodes’ sensitive attributes, a realistic setting that most existing fair IM methods, which assume known groups, do not cover.
Critical weaknesses
-
The overall presentation of the paper is much lower than the standards of a conference like ICLR.
- Complex and heavilty presented mathematical formulations, without any explanation and intuition. See for example equations (8) and (11). Moreover, notation is overloaded.
- Bad quality and squeezed figures (see Figure 2).
-
The method section is very heavily written with little intuition for the key ideas. It describes code details rather than the ideas - is is full of details that matter for running the code but not for understanding the method. Moreover, the evaluation has just one results figure, for a single dataset (even though 9 are presented in Table 1), while the comparison of AURA-IM with baselines lies in the Appendix (Tables 2, 7-10). Reading just the main paper can’t check the authors' claims.
Questions for authors
- Why are all these datasets presented in Table 1 in the main text, if only one of them is actually used in the main experiments?
- How were the many hyperparameters of Tables 3 and 4 chosen?
- How are methods not originally designed for Fair IM, are being instantiated in this problem, like for example CrossWalk?