- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies graph neural networks with mean aggregation. Authors ask the question when, and to what extent, mean aggregation can be used to recover the information about the degree of a node, and how important is this information for a GNN. To study this problem, authors model the number of neighbours with a Poisson distribution. Then, they use Fisher information to determine how the expected value of the degree can be recovered from the mean aggregation of neighbours. In other words, authors study how well, on average, the degree of a node can be predicted from the mean aggregation of neighbours which are random. The paper contains both theoretical and experimental analysis.
Critical strengths
Mean GNNs, although very simple and very popular models are still not understood in full regarding their expressiveness and computational capabilities. A study of what their computations allow for, and their practical performance is both interesting and important.
The importance of the degree information – which is central structural information in graph data – is important to understand, and the paper provides another step in this direction.
The analysis of GNNs with Fisher information seems to be a novel approach, and may lead to interesting results. The direction is potentially promising and may open an interesting research direction.
Critical weaknesses
The way the paper is written, does not satisfy basic research paper standards. It is very unclear, imprecise, does not explain the setting and the meaning of the results appropriately; to the point that it is hard to judge the quality of the obtained results. The paper lacks appropriate explanation and definition of used concepts and is currently in the form which disallowed me to obtain its proper understanding.
The paper uses a number of undefined notions. For example “neighbourhood-category proportions” and “continuous-message centres” in 055 are never explained before. Similarly in the description of contributions it is not clear what are “exact proportions”, what is “composition”, what does it mean that “realized degrees remain ambiguous”, what is meant by “rounding or additive noise” as it is not explained where this noise is added, what is meant by a readout (which is not as in standard GNNs) and in particular what are “regular readouts” or ”fitted neural readouts”.
Statement “At finite expected degree” remains unclear for me. Also, “location information” is not explained and what does it mean that “it survives” is unclear. Furthermore “degree-dependent grid of possible proportions” is not explained. Similarly “complete neighbourhood” in 149 probably should be “complete observation”, but I am not sure. “Output H” and “aggregation channels” are not introduced in the paper before the usage of these terms, and so is “parameter-independent channel with regular support” which occurs in Proposition 1. Similarly “fixed probe feature map” in Proposition 2 is not defined.
Experimental section is also unclear for me, namely the whole setting seems to be underspecified in the main body of the paper, where it should be explained. For example it is not clear on what graphs GNNs are trained and on what task they are trained. Also it is not clear for me what is the relation of the experiments to the theory. The results presented in “Explicit degree under degree shift.” and “Sensitivity to aggregate precision and noise.“ do not have a discussion that would link them to theoretical results, which remains unclear for me.
Questions for authors
I wonder if and how the experimental results in “Explicit degree under degree shift.” and “Sensitivity to aggregate precision and noise.“ are related to the theoretical results in the paper.