- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The aim of the paper appears to be finding time-dependent maps between attributes for adjacent nodes in a dynamic network. I am not entirely certain I have interpreted the aim correct as the problem was only defined on page 4 and it was not possible to follow on an initial reading. Prior to that point, there was undefined notation and concepts which made the paper near impossible to read. As a result, I am unable to comment on the contribution and validation of the results presented in this work.
Critical strengths
The author is clearly knowledgable in the mathematical theory used in the paper. However, this is not explained in anywhere near a suitable manner for a wider audience. Potentially, with a vast and thorough editing of the paper, the theory could be worthy of publication but that is currently not possible to confirm.
Critical weaknesses
Notation and concepts were introduced without definition from the beginning making it impossible for anyone without expertise in this area to understand what is trying to be accomplished. In it's current state, it is unsuitable for a wide-ranging audience like ICLR.
Questions for authors
Based on the writing style, I believe this was written by a single author. Was the manuscript shared with anyone else at any stage to check for readability and clarity?
Clarification, Revised abstract and introduction section
Dear reviewer,
Thanks for your time to provide the feedback.
Q1. The formal setting is a discrete-time dynamic graph: the graph is a sequence of snapshots, not a continuous-time event stream. The revised introduction states this explicitly. I have revised both abstract and introduction in the PDF. Please have a look.
As TGN is a continuous-time link predictor, it keeps a memory per node, updates that memory on timestamped events, and ranks future interactions against negative destinations. In these experiments it is adapted to the snapshot protocol. Each snapshot is one batch, and every edge in that snapshot uses the snapshot index as its timestamp. The decoder scores those existing edges with binary cross-entropy, and the per-node memory is updated after the score. Training uses the same leak-free split as the other snapshot models: the loss is computed only on snapshots before the midpoint, and test labels are not used. This is supervised scoring of observed edges, not TGN’s original future-link task. Your point that this adaptation changes TGN’s task is fair.
I did not report STHN for that reason. STHN is a continuous-time heterogeneous link predictor. A snapshot anomaly scorer built from it would be a different model, and I did not want to report that reimplementation under the name STHN. To test typed aggregation inside this snapshot protocol, I used a temporal R-GCN control on the same DualPath backbone and the same split.
Q2. This control is not the static R-GCN. Relation types are handled inside each snapshot. Time is a graph-level state carried from one snapshot to the next.
Within a snapshot, each edge type has its own linear map. Source features are transformed by that map and averaged onto the target. A shared layer mixes each node’s features with that typed average. Those relation weights are shared across snapshots. They do not depend on time, and edges have no timestamps. This is one round of per-type mean aggregation, not the basis-regularized R-GCN stack from the 2018 paper.
Across snapshots, the node embedding are averaged into one graph vector. A GRU reads that vector in snapshot order and keeps one hidden state for the whole graph, not a memory per node. A gate, whose input is the current graph vector and an exponential moving average of earlier graph vectors, mixes the GRU output with the current graph vector. The fused vector is added to every node. The edge score uses the two endpoint embedding and their raw features.
Training matches DualPath. The loss uses only snapshots before the midpoint. At evaluation the recurrent state is reset and the snapshots are replayed in order. The recurrent state at a snapshot comes from earlier snapshots, including earlier test snapshots. The current snapshot’s features and edges are inputs to the encoder when that snapshot’s edges are scored. Test labels are not used.
The temporal signal in this control is the graph-level GRU state and the gate’s moving average. TGN keeps a memory per node. EvolveGCN evolves the weight matrices. The Cayley sheaf updates a shared orthogonal transport. This control does none of those three.
Regrading presentation, I have revised Abstract and Introduction in the PDF, I would appreciate if you have a look again.
I would also like to thank you that you followed review comments from other reviewers and I specifically choose to notify all respected reviewers during adding my comments. I would respectfully like to say that, one more reviewer and not reviewers who provided this feedback.
I hope this will help you reassess and happy to clarify if any questions.