- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper examines the effect of including likely edges (but not necessarily actual edges) in the graph given to a dynamic graph encoder to measure if this improves its predictions of other links in the graph. The proposed method first uses a simple link predictor to find the top-k candidate edges that each node might connect to. Next, it combines the likely neighbors’ embeddings to each candidate node’s embedding. Finally the new embeddings are used for link prediction. This approach moderately improves MRR when applied to a TGN model across four datasets
Critical strengths
- The approach to this problem is novel and interesting
- The research questions that stem from the authors novel approach are reasonable and tested well
- Section 4.5 honestly presents a negative result which contextualizes the positives and negatives of this approach
- The approach is fairly lightweight, requiring only ~70 additional CPU seconds on the largest dataset and would be applicable broadly to many link prediction models, beyond those tested.
Critical weaknesses
- The manuscript is very difficult to read. The core concepts of the work are not difficult to grasp, but the writing uses unnecessarily complex, jargon heavy, and vague language to convey them. Some simpler terminology (e.g. calling the “auditable mechanism vector for legal pairs” simply “edge features”) would make the work easier to follow
- The components of the edge features (closure, popularity, compatibility, activity, and recency) are named, but not formally defined in the body of the work or the appendix. More clarity e.g. which community detection mechanism, how the time windows affect these calculations, etc. would be helpful.
- The value in equation 7 is never explicitly defined. Is it a learned value, an explicitly calculated parameter?
- The first phase assigns exactly K edges to every support-active source with no threshold on their score, and Section 3.3. says that their scores are not used to weight these edges contributions to the final embeddings. This likely affects sparse datasets negatively, e.g. the average node degree in each dataset is 4, 24, 14, and 8 for Wiki, Enron, UCI, and GoogleLocal. This may explain why in Figure 4.a the benefit of ChoiceGaph decreases after K=2 as it sees double the expected number of edges, and some of those edges are likely less plausible
- The “Mixer-style” encoder referenced in Table 3 is not specified in the body of the work or the appendix. It is also only run on two of the four datasets. Why was this approach not run on Enron or GoogleLocal, and why was the evaluation protocol different?
Questions for authors
- How are support-active sources selected?
- How is in Equation 7 derived?
- Please provide more details about the mixer-style model in Table 3 and clarify why it was only tested on a subset of the data