- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper presents CTDG-THOR, a memory-based CTDG model with second-hop neighbor aggregation. It begins by motivating the need for neighbor context in learning node embeddings for a CTDG and proposes a framework to implement it. The authors then analyze its performance against a model without second-hop neighbor aggregations using the TGBv1 protocol. Furthermore, the paper provides theoretical analysis comparing the framework with and without the proposed aggregation.
Critical strengths
The proposed work presents an efficient CTDGs model based on second-hop neighbor aggregation with TGN-like memory module, improving upon the overall architecture with multi-hop neighbor context.
Critical weaknesses
W1. Clarity and Presentation
The manuscript is currently challenging to follow due to several advanced terms—such as history-conditioned attention, second-order temporal history routing, and separation witness—being introduced and heavily used without clear prior definitions. Additionally, some terms require clarification, such as "Direction-A context" on line 276. There are also minor notation inconsistencies, such as the subscript for the weight matrix appearing as in Eq. 6 and in Eq. 9.Furthermore, the proofs would benefit from more detailed steps and a cleaner structural layout, as formatting parts of the proofs as individual subsections currently disrupts the flow of the theoretical argument.
W2. Message Definition and Theoretical Alignment
The paper adopts a message-passing block inspired by TGN, but it omits a key component. In standard TGN formulations, the message for an event is defined as , incorporating the state of the destination node . The CTDG-THOR framework omits this destination state term, which appears to limit the expressiveness of the resulting memory module. Consequently, the subsequent theoretical analysis builds upon this modified (and more limited) formulation. While removing yields a valid memory module variant, it departs from the standard TGN memory design that CTDG-THOR claims to follow. We encourage the authors to clarify how Theorems A and B generalize to or provide insight into standard CTDG memory modules that incorporate destination states.
W3. Evaluation and Baseline Consistency
The experiments rely on TGBv1 without explicit justification for omitting the more recent TGBv2 benchmark standard. Moreover, there are noticeable discrepancies between the reported results and the official TGB leaderboard figures. For instance, the authors report an MRR of for tgb-wiki-v1, whereas leaderboard benchmarks or related figures differ significantly. Additionally, the finding that a "TGAT-style" model outperforms DyGFormer contrasts sharply with public TGB leaderboard trends (where DyGFormer generally outperforms TGAT). We recommend that the authors double-check their baseline implementations, hyperparameter tunings, and evaluation scripts to ensure these gaps can be addressed.
W4. Limited Novelty
The primary novelty of the work lies in assuming a weak or limited memory module and proposing a way to circumvent this issue. However, existing models like CTAN and TGN (which incorporate state update and memory modules) do not restrict updates solely to the event node itself. Given these standard memory update practices, the paper appears to over-claim its novelty. Furthermore, the idea of incorporating multi-hop neighbors is already part of TGN's node embedding generation module, which uses recursive neighbor sampling and attention weights to collect multi-hop context for a query.
Questions for authors
The above-mentioned weaknesses and
Q1 Failure for LRD?
Is the context strictly limited to second-hop neighbors? If so, wouldn't this framework struggle in long-range dependency setups presented in CTAN, where relevant information resides 10-hops or more away (assuming the memory message is derived using Equation 4)?