- Rating
- 1(−1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes a high-order mechanism to explore the multihop relationships in a heterogeneous graph, where edges may indicate a multitude of relationships, allowing for nuanced causal chains that reflect reasoning. The authors propose MC-HGNN, a GNN approach that relies on a Markov process to transition over this state space, for example, by allowing selection of which relational edge type to transition along. These meta-paths capture the higher-order relationships of each graph.
Critical strengths
- The goal of finding meta-paths to capture higher-order relationships specifically in a heterogeneous graph, is an active field of research. Adaptive edge-relation is a potentially interesting idea that goes beyond some existing methods. Further, using a Markov process has strong ties to the estimation of probability distributions, though this topic was not as thoroughly explored. Overall, I think the key research question has a solid grounding.
Critical weaknesses
- The validity of the central claims of the paper is lacking.
First, it is my observation that large parts of the introduction are currently written in passive voice. The introduction also lacks key literature from the corpus of work surrounding higher-order GNNs. Though the introduction highlights the importance of higher-order relationships, it does not cite any work investigating existing walk, hypergraph or geometric deep learning, for example, making it hard to contrast the contributions with what has already been done. In terms of claims made in the introduction, not all GNNs will recompute the self-attention matrix, see GRAND, for instance, and it is often ideal not to do so. This contrasts with the claims made in the second and third paragraph, which asserts that interpreting a normalised matrix as a transition matrix is both a new insight and central to the novelty of the method. This is problematic, given that it is in fact long existing.
The connection between Markov processes, node hubs and attention matrix is therefore not clear, and appears ad-hoc and incremental.
Oversmoothing was a central topic. Therefore, In addition to these things, I would also recommend the authors connect the oversmoothing problem with existing work done in that field, such as NeuralODEs, e.g. HDS, which circumvent the convergence of every node to the same feature vector. In the experiments (Figure 2), the Dirichlet Energy decays at a similar rate to the other methods, which is more important than its starting position, though the authors imply that having a higher Dirichlet energy indicates less decay. One ideal result would be convergence to an intermediate value greater than 0 but less than its starting position, yet the decay appears to be constant. It is not clear what is causing the higher Dirichlet Energy, e.g. initialisation. Further, Higher-order methods have been shown to prevent or mitigate such decay, creating doubts in my mind as to whether the higher-order aspect has been used effectively. It might be the case that selecting a new relation at each step does not produce the same effect, and I expect clarifications to this point going forward. As a side note, Figure 2 is very hard to read.
- The method does not appear novel/particularly exciting.
Admittedly, this may be due to the lack of related work (see start of last point), making it hard to place the contributions of the work accurately. As stated in this review, metapaths themselves are not novel, and Markov processes are well-established tools. For example, foundational methods such as GraphSage use meta-paths, and there has since been much research on them. Coupling meta-path work with the Markov process foundation makes it appear that MC-HGNN is closely related to a sampling problem, and it might be ideal to have more discourse from this perspective. Other method details, such as reweighting by node degree, are also well established. Nevertheless, the stopping condition and the flexible relation selection make this work potentially interesting.
As a side note, the Theorems do not appear to be sufficiently self-contained. The theorems also seem to end on a statement that interprets their meaning. It is often nuanced and infers such a result from the Theorem conditions, which themselves are dense in definitions with unclear context. Better Theorems should state the claim rigorously without overcomplicating things, and inference of said claim should be outside their declaration and somewhat straightforward, at least with sufficent context.
Questions for authors
- The probabilistic transition matrix between nodes of different relations implies that the transition operator is only locally valid, and the global structure therein is not being used. This affects my assessment, given that, in my opinion, the oversmoothing decay is not mitigated. A higher-order mechanism should explore the topology of the graph. Can you further justify the use of the transistion probability matrix in this regard?