- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The main research problem of this paper is "Given an attributed graph with a probability distribution over its nodes, how should the topology of the graph re-weigh that distribution?". The paper proposes to compute node POVs by first weighing the edges based on node probabilities and then counting the weight of paths of max length m between nodes. Then, the node POVs are normalized and aggregated into a graph POV. This method is supported by theory from a category perspective and culminates in two main results: 1) on a connected graph, node POVs converge to a single distribution as m grows; and 2) on a complete graph, the original distribution is recovered. Then, the method is evaluated on a set of complete graphs (theoretical guarantee) and also 7 node classification datasets (downstream application).
Critical strengths
- The paper includes detailed and sound theory which provides mathematical guarantees (convergence on connected graphs and recovery on complete graphs) in support of the proposed method.
Critical weaknesses
-
The HPGNN experiment setup provides little validation for the paper. The graph datasets used do not come with prior probability distributions over its nodes, instead the authors provide synthetic distributions. The choice of these synthetic distributions should be justified and also ablated. Though, ideally, the authors can provide experiments on datasets that come with a meaningful prior probability distributions.
-
The comparative results are unconvincing. In Table 1, it is unclear if the uncertainty values and the tuning protocol are the same as the original HPGNN method. Hence, the results may not be comparable at all, even as a "descriptive" result. Furthermore, the paper only compares against personalized PageRank inside of HPGNN. Additional experiments that include other architectures and other baselines would greatly strengthen the paper.
Questions for authors
- While the related works section seem to provide some similar papers, there is no explicit description of existing work on the stated problem. Could the authors provide a detailed review on how prior works have tried to answer their research problem and why they're insufficient?
- How were the synthetic distributions chosen for the HPGNN experiments? Were there other choices and how much does the choice matter? Also, what is an example of a setting a probability distribution over nodes naturally arises?
- Can the authors provide additional context on how the category framework contribute to the results in Section 5? For example, how does the node POV definition in 5.2 relate to the node POV definition in 4.1?