- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes MambaTG, a candidate-aware state space model for future link prediction on temporal graphs, with particular emphasis on predicting both repeated and previously unseen edges. The authors identify two complementary signals for future interaction prediction: historical-sequence evolution, which captures dependencies among chronologically ordered interactions, and candidate–history compatibility, which characterizes how a candidate relates to the evolving source history. To jointly model these signals, MambaTG introduces a Candidate-Aware Mamba Encoder (CAME), which first encodes the source node's interaction history and then performs candidate-conditioned state updates using the shared historical state. The framework further incorporates Dual-Branch Representation Refinement (DRR), consisting of frequency-domain refinement of historical interactions and feature-wise refinement of candidate representations. Experiments on 13 temporal graph datasets demonstrate competitive predictive performance against existing temporal graph learning methods. Moreover, efficiency experiments demonstrate the advantages of shared history encoding for handling long interaction sequences and large candidate sets.
Critical strengths
-
The paper investigates a known challenge in unseen interaction modeling in temporal graph learning. The proposed framework jointly models historical-sequence evolution and candidate–history compatibility, providing a reasonable perspective for incorporating sequential dependencies and candidate-specific information into future link prediction.
-
The proposed Candidate-Aware Mamba Encoder provides an efficient way to incorporate candidate-specific information into sequential history modeling. By encoding the source history once and reusing its recurrent states across candidates, the architecture avoids repeatedly processing the same interaction history and offers favorable computational scalability.
-
The paper provides comprehensive experimental evaluations across 13 temporal graph datasets and various representative baselines. The authors also discussed temporal ordering, candidate-conditioned modeling, architectural components, long-sequence effectiveness, and computational efficiency.
Critical weaknesses
- Insufficient justification for adopting Mamba. The necessity of adopting Mamba for this problem are not sufficiently justified. The two proposed modeling signals, historical-sequence evolution and candidate–history compatibility, are not inherently specific to state space models and could also be captured by other sequential architectures. Although Appendix G includes a comparison with GRU, the analysis is limited to two datasets and does not thoroughly disentangle the contributions of Mamba-specific mechanisms from those of the general candidate-conditioned sequential modeling framework.
- Insufficient evaluation of repeated-edge and unseen-edge prediction capabilities. Although improving prediction across both repeated and unseen edges is a central objective, the main experiments primarily divide datasets into repeated-edge-dominant and unseen-edge-dominant groups. Such comparisons cannot directly establish how the proposed model performs on the two types of edges, particularly when both occur within the same dataset. Moreover, the experiments use different model variants for the two dataset groups, making it difficult to disentangle the effects of architectural design, explicit recurrence information, and dataset characteristics.
Questions for authors
- Could authors provide further justification and empirical evidence of the Mamba-specific advantages in unseen-edge prediction? It would be helpful to clarify whether the observed improvements originate from Mamba's selective state-space modeling or the general candidate-conditioned sequential modeling design.
- Could authors report separate prediction performance for repeated and unseen edges within the same datasets? A more fine-grained evaluation would help substantiate the claimed improvements in unseen-edge prediction.
- Could authors provide a more comprehensive comparison between MambaTG and MambaTG-R across both repeated-edge-dominant and unseen-edge-dominant datasets?
5 comments
Response to Reviewer gPfQ: Part (2/2)
Weakness 2-1. Insufficient evaluation of repeated-edge and unseen-edge prediction capabilities.
Q2. Could authors report separate prediction performance for repeated and unseen edges within the same datasets? A more fine-grained evaluation would help substantiate the claimed improvements in unseen-edge prediction.
We report MRR separately for repeated and unseen edges within the same datasets. On eight datasets, we classify each positive test interaction (u, v, t) as repeated if (u, v) occurred before t and unseen otherwise, and evaluate both subsets against the same negative candidates.
| Model | UCI† | Wikipedia† | Reddit† | MOOC† | LastFM† | Flights† | Taobao | Yelp |
|---|---|---|---|---|---|---|---|---|
| Unseen / Repeated | Unseen / Repeated | Unseen / Repeated | Unseen / Repeated | Unseen / Repeated | Unseen / Repeated | Unseen / Repeated | Unseen / Repeated | |
| Test edge share (%) | 28.7 / 71.3 | 10.8 / 89.2 | 6.9 / 93.1 | 39.2 / 60.8 | 9.3 / 90.7 | 15.8 / 84.2 | 81.3 / 18.7 | 92.0 / 8.0 |
| CRAFT | 40.0 / 89.0 | 16.4 / 97.1 | 22.3 / 94.4 | 63.0 / 60.6 | 26.3 / 58.0 | 48.9 / 89.6 | 64.0 / 97.4 | 71.4 / 91.7 |
| MambaTG | 48.9 / 91.6 | 18.5 / 97.5 | 23.1 / 94.7 | 66.3 / 63.8 | 29.5 / 59.8 | 48.5 / 91.3 | 68.4 / 93.5 | 74.8 / 88.5 |
| Δ | +8.9 / +2.6 | +2.1 / +0.4 | +0.8 / +0.3 | +3.3 / +3.2 | +3.2 / +1.8 | −0.4 / +1.7 | +4.4 / −3.9 | +3.4 / −3.2 |
† Results use the -R variant (CRAFT-R / MambaTG-R).
MambaTG improves over CRAFT on unseen edges in seven of eight datasets, with an average gain of +3.2 pp versus +0.4 pp on repeated edges. This supports our claim that MambaTG improves unseen-edge prediction while remaining competitive on repeated edges. In addition, in ML-20M, GoogleLocal, Flickr, YouTube and WikiLink, all test edges are unseen, so their MRR in Table 2 directly measures unseen-edge prediction. MambaTG outperforms CRAFT on the first four by 0.89-2.27 pp and performs on par on WikiLink. We will add this edge-level evaluation to the revision.
Weakness 2-2. Moreover, the experiments use different model variants for the two dataset groups, making it difficult to disentangle the effects of architectural design, explicit recurrence information, and dataset characteristics.
Q3. Could authors provide a more comprehensive comparison between MambaTG and MambaTG-R across both repeated-edge-dominant and unseen-edge-dominant datasets?
We thank the reviewer for this suggestion. MambaTG and MambaTG-R share the same architecture. The only difference is that MambaTG-R also feeds the historical source-candidate interaction count to the prediction head. We compare both variants on both dataset groups:
| Unseen-edge-dominant | Repeated-edge-dominant. | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| ML-20M | GoogleLocal | Flickr | YouTube | UCI | MOOC | Wikipedia | LastFM | ||
| MambaTG | 37.98 | 64.62 | 63.94 | 59.81 | 68.38 | 64.37 | 87.37 | 87.38 | 47.68 |
| MambaTG-R | 38.79 | 63.90 | 64.89 | 60.00 | 79.31 | 64.77 | 88.99 | 89.71 | 56.98 |
| Δ (R − base) | +0.81 | −0.72 | +0.95 | +0.19 | +10.93 | +0.40 | +1.62 | +2.33 | +9.30 |
Why two variants? The interaction count provides direct evidence of a repeated edge but offers little information for an unseen edge, whose positive pair has never interacted. This is reflected in the results. The count improves MRR by 4.92 pp on average on repeated-edge-dominant datasets, but only by 0.31 pp on unseen-edge-dominant datasets, with a small and inconsistent effect. We therefore use MambaTG-R on repeated-edge-dominant datasets and the base MambaTG where repeated edges are rare. This allows the unseen-edge results to reflect the history patterns and candidate compatibility captured by our framework rather than relying on recurrence statistics. The variant is fixed by dataset group (App. B.2, Table 6), following [R1], rather than selected based on test performance.
[R1] Future Link Prediction Without Memory or Aggregation. NeurIPS 2025.
—————————————————————————————————
We thank the reviewer for the constructive feedback, which helped us clarify the contributions of MambaTG. We will include these updates in the revised paper and are happy to answer any further questions.
Follow-up on Our Responses
Dear Reviewer gPfQ,
Thank you again for your time and constructive review. As the discussion period is ending soon, we would like to kindly follow up on our responses.
We have also uploaded a revised version of the paper that incorporates the updates from our responses, with all changes highlighted in blue (see our "Summary of Revisions" comment).
If our responses have addressed your concerns, we would greatly appreciate it if you could consider raising your score. We are also happy to clarify any remaining questions.
Response to Reviewer gPfQ: Part (1/2)
Thanks for your valuable time and constructive suggestions.
We thank the reviewer for this thorough observation. Our design has two parts: (i) candidate continuation, which processes each candidate as one more step of the encoded source history instead of fusing it at the prediction head, and (ii) Mamba as the sequential model that performs this continuation.
Why does Mamba suit candidate continuation? For each channel, Mamba maintains d_state state components, each with its own learned decay. When a candidate continues from the cached history, it sets the step size Δ, which controls how much each component is retained, and the readout C, which selects which components form the output. Each candidate can therefore query a multi-timescale summary of the history in its own way.
We provide two experiments to separate the contributions of the backbone and our proposed framework.
(1) Isolating the backbone. We replace Mamba with GRU and LSTM, keeping candidate continuation and all other components unchanged. Mamba achieves the best MRR on all four unseen-edge-dominant datasets.
(2) Isolating the framework. For each backbone, we replace candidate continuation (CC) with LateFusion (LF, App. D.4), which encodes the history independently and combines it with the candidate only at the prediction head. Candidate continuation improves all three backbones on both datasets, so the framework helps regardless of the sequential encoder.
Under LateFusion, Mamba has no clear edge over GRU/LSTM; it even ranks lowest on YouTube. With candidate continuation, however, its gain is far larger than that of GRU or LSTM. Mamba’s benefit therefore does not come mainly from stronger history encoding. It appears when the candidate conditions the state update, which is consistent with the mechanism described above.