- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper considers the temporal link prediction (TLP) and proposes a lightweight log‑linear temporal link predictor without node embeddings. Inspired by language‑model smoothing, it uses pooled transition and co‑occurrence counts. Even with 9‑13 learnable parameters, it can achive inference quality competitive to or even better than existing TLP approaches on TGB and TGB‑Seq benchmarks.
Critical strengths
S1. The basic idea of examining whether simple counts of recurring interaction patterns can provide competitive predictions without learning these representations seems interesting.
S2. This paper anonymously provides its code and data to ensure reproducibility of experiments.
Critical weaknesses
W1. It seems that this paper does not provide a comprehensive formal statement regarding the considered TLP problem.
First, it is unclear this paper considers which data model of dynamic graphs, e.g., discrete-time dynamic graphs (DTDGs) and continuous-time dynamic graphs (CTDGs), as different data models may have different experiment settings and evaluation protocols.
Second, it is unclear whether this paper assume graph attributes (e.g., node attributes) are available. It seems that the simple method proposed by this work does not consider attributes, while some baselines in experiments (e.g., DyRep, TGN, DyGFormer, etc.) can leverage such attributes.
Third, it is unclear this paper considers the conventional transductive or advanced inductive settings of TLP or both. It seems that the proposed method can only support the transductive TLP, while some baselines in experiments (e.g., DyRep, TGN, CAWN, DyGFormer, etc.) can handle inductive TLP, predicting future links for new nodes not observed in previous time steps.
W2. The overall presentation of this paper is still hard to understand (e.g., lack of details about toy example figures and necessary preliminaries), which need significant improvements.
It should be a good presentation to show the basic motivation using Fig. 1 at the very beginning. However, it seems that Fig. 1 is LLM-generated cluttered with many mathematical notations. There seem no further descriptions regrading Fig. 1's details, e.g., what do different notations like , , , etc. mean, how to get such a toy example from which dynamic graph, etc. As a result, it is still unclear what do Fig. 1 mean even after reading Section 1 (Introduction).
It was claimed that this work utilizes some classic techniques in NLP (e.g., statistical language modelling, Kneser-Ney continuation counts, etc.) to tackle TLP. However, there seem no preliminaries about these techniques, e.g., toy examples about the mapping from text corpus to dynamic graphs, formal definitions of each concept. In particular, it remain unclear how these NLP techniques are applied to dynamic graphs and why they can help ensure the quality of TLP. Such a presentation issue makes the basic motivation of this paper very weak and hinders a comprehensive evaluation regarding the novelty.
W3. Consistent with W2, there seem no pseudo-code to describe the overall training and inference procedures of the proposed method. As a result, it is still hard to understand how this method exactly work.
W4. There seem no any formal analysis of complexity or empirical runtime evaluations for the proposed method.
It was highlighted that the proposed method only has 9-13 learned parameters, indicating that it is a lightweight yet effective method. While it cannot ensure the best inference quality in all cases, it is expected to achieve much better inference efficiency or scalability compared with most baselines, especially those with much more learnable parameters. In this sense, a significant trade-off between the inference quality and efficiency/scalability should be a potential advantage of the proposed method. Nevertheless, there seem no complexity analysis or runtime evaluations to validate this advantage.
W5. Some details about experiments are missing.
There seems no summary about the statistics of datasets using in datasets, e.g., numbers of nodes, edges, time steps, etc..
There seem no descriptions regarding the experiment environment, e.g., OS, CPU, GPU, memory size, etc.
Questions for authors
See W1-W5.
3 comments
Thanks for the rebuttal, which address some of my concerns. However, W2 about the overall presentation may still not be well addressed. I decide to keep my original score.
Thank you for confirming that the rebuttal addresses some of your concerns. We would like to understand which part of W2 remains unclear in the revised manuscript. Your original comment identified two specific presentation issues, and we revised both:
- Fig. 1 now shows a bipartite user–film graph with nodes in lanes and time in columns. Arrows connect users to films, rather than suggesting graph edges between successive targets. The caption defines the sources, candidate, recent targets, probability estimates, recency and scoring parameters. App. E shows how the example counts enter the equations, including the calculation of the transition probability of approximately 0.77.
- Sec. 4.1 now explains the connection to language modelling through film examples. Each source supplies a sequence of targets, corresponding to a sentence of words. Individual targets give unigram counts and consecutive pairs give bigram counts. Pooling these across sources allows another viewer's transition to support a film the current viewer has never watched. We also explain how co-occurrence includes nonconsecutive pairs. Sec. 4.2 introduces smoothing and explains both backoff distributions through the same examples.
These changes are marked in blue in the revised manuscript. Could you point to the specific passage, notation, or step that remains unclear? This would allow us to address the remaining presentation concern directly within the time available for discussion.
Response to Reviewer bKog
Thank you for recognising the interest of testing recurring interaction counts and the reproducible code release. We have expanded the explanations and added pseudocode, cost measurements, and dataset statistics. The added text is blue.
W1
We have expanded Sec. 3 (blue). Our model takes continuous-time events (u,v,t), using node IDs and timestamps without attributes.
The heuristics and CRAFT also use no attributes. CRAFT leads on the most datasets among our neural references (Yi et al., 2025a). TGN can use node and edge attributes (Rossi et al., 2020), while TPNet uses edge features in its released implementation (Lu et al., 2024).
Our model supports both transductive and inductive prediction with a fixed candidate vocabulary. Its shared weights can score nodes seen during training and nodes first observed afterwards. TGB also includes new nodes during validation and testing (Huang et al., 2023, App. G). We report overall test MRR rather than separate scores for seen and unseen nodes.
W2
We have redrawn Fig. 1 with node lanes and time columns. Arrows connect sources u,u′ to targets. Source u visits a,b,c,b,c, and u′ visits d. The caption defines the candidate z and smoothed estimate P^. App. E now substitutes the counts: with no decay and α=1, P^tr(c∣b)=(2+0.30)/(2+1)≈0.77. There are two b→c transitions, and 0.30 is the smoothed frequency of c.
Sec. 4.1 explains the estimators through film examples. Targets act as words and each source sequence as a sentence. Single targets are unigrams and consecutive pairs are bigrams. These pairs describe successive interactions of one source, not graph edges between targets. Pooling across sources lets one viewer's transitions support a film another has never watched. Co-occurrence also includes pairs separated by other visits.
Sec. 4.2 also explains smoothing. Popularity remains a separate feature, while smoothing keeps each estimate positive for its logarithm and gives backoff more weight when counts are sparse. Marginal backoff uses target frequency. Continuation backoff counts distinct predecessors: b,c occur equally often, but b has two predecessors and c one. If no transitions from a recent target have been observed, its transition estimate equals the backoff.
W3
We have added pseudocode for feature extraction, training and inference in App. G.1 (blue), referenced in Sec. 4.5.
We process training and validation events in order. For each event, we compute candidate features from the preceding interactions, save them, then update the counts and recent history. These features are computed once. Training adjusts only the shared scoring parameters, using the saved training features and one uniform negative per query. Validation MRR selects the best parameters. Training stops after ten epochs without improvement or at 100 epochs.
At test time, we initialise history from the training and validation events. The fitted parameters remain fixed. We score each query from preceding interactions, then add its observed event to history.
W4
We have added runtime, memory and complexity results in App. J (blue). On tgbl-enron, where all methods completed three uninterrupted fits, mean preparation and fitting take 42.5 seconds for ours, 649.6 for CRAFT and 781.5 for TGN. All use an L40, with EPYC 7763 for ours/TGN and 7543 for CRAFT. We compute features once and reuse them across epochs, fitting only the shared scoring parameters.
Prediction requires computing features for each new query. Ours predicts faster than TGN on GoogleLocal and YouTube, while TGN is faster on tgbl-enron. CRAFT is faster on all three. Our peak allocated GPU memory is lower than both, while process RAM is higher on GoogleLocal and YouTube (Tab. 9). App. J reports three runs for counting methods on all 16 datasets and neural prediction on these three, separated by CPU type.
For M candidates and K recent interactions, feature construction and scoring take O(M(K+1)) time under expected constant-time hash access. Basic count updates take O(1) per event, and co-occurrence adds O(K). At fixed K, count storage can grow linearly with the number of events. Training also stores candidate features for reuse across epochs. App. J.1 derives the full storage and fitting costs.
W5
We have added Tab. 3 in App. A (blue), reporting source and target nodes, interaction events, distinct directed pairs and distinct timestamps for all 16 datasets.
App. G specifies one L40 GPU, four allocated CPUs and 128 GiB of allocated RAM per main fit. The cluster runs Debian GNU/Linux 13. App. J gives the runtime setup: four CPU threads on EPYC 7543/7763, L40 GPUs for comparisons with neural methods, Python 3.13.5, PyTorch 2.11.0+cu128, NumPy 2.5.1 and CUDA 12.8.