acceptodds
Under review as a conference paper at ICLR 2027

MambaTG: Candidate-Aware State Space Modeling for Future Link Prediction on Temporal Graphs

24 views

Abstract

Future link prediction on temporal graphs involves both repeated interactions between previously connected node pairs and first-time interactions between pairs with no prior interaction. While repeated-edge prediction can exploit direct pairwise evidence, unseen-edge prediction must generalize beyond historical recurrence. Existing temporal graph models often exploit signals tied to recurring interactions or historical overlap, which are highly informative for repeated edges but become limited or unavailable for unseen edges, contributing to substantial performance degradation on unseen-edge prediction. Based on this observation, we identify two complementary signals for modeling sequential dynamics beyond historical recurrence: (1) historical-sequence evolution, which captures dependencies among the source node's chronologically ordered interactions, and (2) candidate–history compatibility, which captures how well a candidate fits the source node's evolving history. Based on the decomposition, we propose MambaTG, a candidate-aware Mamba-based framework that jointly models these two signals. Mamba provides a natural mechanism for this design: its selective recurrence captures the evolution of ordered interaction histories, while its input-dependent state transitions allow the history state to adapt to different candidate inputs. Extensive experiments on 13 temporal graph datasets against 13 representative baselines show that MambaTG achieves strong and consistent performance across both repeated and unseen edges while remaining computationally efficient.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Temporal graph learning, future link prediction

Reviews

Among:
Shape:
1234this paper, Bottom 27%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.00 over 3 reviews, above 27% of the others.
Reviewer_gPfQOpenReview ↗
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
  1. 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.

  2. 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.

  3. 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
  1. 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.
  2. 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
  1. 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.
  2. 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.
  3. Could authors provide a more comprehensive comparison between MambaTG and MambaTG-R across both repeated-edge-dominant and unseen-edge-dominant datasets?
5 comments
AuthorsOpenReview ↗

Response to Reviewer gPfQ: Part (1/2)

Thanks for your valuable time and constructive suggestions.

Weakness 1. Insufficient justification for adopting Mamba.

Q1. 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.

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.

DatasetGRULSTMMambaΔ vs GRUΔ vs LSTM
ML-20M36.4437.3737.98+1.54+0.61
Flickr61.9760.6363.94+1.97+3.31
YouTube58.5359.0159.81+1.28+0.80
GoogleLocal60.4960.2564.62+4.13+4.37

(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.

BackboneGoogleLocal: CC / LF / ΔYouTube: CC / LF / Δ
GRU60.49 / 58.71 / +1.7858.53 / 58.34 / +0.19
LSTM60.25 / 58.43 / +1.8259.01 / 57.60 / +1.41
Mamba64.62 / 59.30 / +5.3259.81 / 57.18 / +2.63

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.

AuthorsOpenReview ↗

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.

ModelUCI†Wikipedia†Reddit†MOOC†LastFM†Flights†TaobaoYelp
Unseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / Repeated
Test edge share (%)28.7 / 71.310.8 / 89.26.9 / 93.139.2 / 60.89.3 / 90.715.8 / 84.281.3 / 18.792.0 / 8.0
CRAFT40.0 / 89.016.4 / 97.122.3 / 94.463.0 / 60.626.3 / 58.048.9 / 89.664.0 / 97.471.4 / 91.7
MambaTG48.9 / 91.618.5 / 97.523.1 / 94.766.3 / 63.829.5 / 59.848.5 / 91.368.4 / 93.574.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-dominantRepeated-edge-dominant.
ML-20MGoogleLocalFlickrYouTubeUCIMOOCWikipediaRedditLastFM
MambaTG37.9864.6263.9459.8168.3864.3787.3787.3847.68
MambaTG-R38.7963.9064.8960.0079.3164.7788.9989.7156.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.

AuthorsOpenReview ↗

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.

Reviewer_9gC8OpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

This paper is concerned with temporal link prediction, and the core idea is based on two aspects of the temporal data: First, the "current state" of a node depends on its ordered interaction history, that is, the order in which the node has interacted with others is important. Two nodes that have the same interaction partners, but the sequence of interactions is different, have different states. Second, based on this, the suitability of future interaction partners is evaluated. The authors build on "Mamba" and extend it for temporal link prediction, calling their method "MambaTG". They compare their method against a range of standard baselines across standard temporal-graph-learning datasets, and demonstrate their method's competitive performance. They also perform an ablation study to investigate which components of their method are crucial for its performance.

I found the paper generally easy to follow and that the authors communicated their thoughts clearly. The balance between math/definition and explanations seems good, although I would have been curious to see some more analysis connected to the learned representations and how the "Dual-Branch Representation Refinement" creates embeddings that are more informative than those of other methods which do not adopt the idea of leveraging sequence data, but I also understand that this is easier said than done.

Regarding the idea of using the ordered sequence of interactions: this is not a particularly new idea -- network scientists have long studied temporal networks and path data, sometimes also referred to as "higher-order data", and shown that the sequence of interactions should be taken into account and that it carries useful information.

Critical strengths

I would say that the core strength of the paper can be summarised as "leveraging higher-order" data to learn more informative representations for temporal link prediction.

Critical weaknesses

None

Questions for authors

There are a couple of points that I have been thinking about while reading the paper:

  1. How much more data is necessary to learn useful representations compared to methods that do not consider sequences of interactions? The typical problem when working with "higher-order data" is that much more data is required to infer patterns -- the longer histories we consider, the more possible sequences there are, and the sparser the data becomes in the sense of "what sequences have we seen vs. what sequences are possible".
  2. Can you provide some intuition of what DRR does? And would there be a way to compare the DRR-based representations with those of other models? I think what I am after is a way to understand how DRR is better than HSR or CFR alone.
  3. You mention in l.227 that "Without prior refinement, stronger patterns at one scale may obscure subtler yet predictive dynamics at other scales", which I totally agree with. You mention that DRR is supposed to address this issue, and I am wondering about the limits of that -- under what conditions might DRR fail? For example, what if a node has regularly occurring interactions at different timescales, but also some truly random interactions that do not carry any information? Would DRR manage to identify those regular interactions while throwing away the random interactions?
  4. Did you run all experiments across all baselines and datasets yourself, or did you take some results for Table 2 from other papers?
  5. Could you explain why you call the paragraph in l. 415 "Performance-Efficiency Trade-off"? I do not quite see where there is a trade-off, which would imply something like sacrificing MRR in favour of shorter training times or buying better performance by doing longer training. Is there something like this hidden, for example, by considering different history lengths, or does the word "trade-off" give me the wrong idea here?
  6. I noticed that the performance drop in the ablation study on the unseen-dominated datasets in Table 4 is similar to the performance drop of ShuffledTrain and ShuffledBoth in Table 3. However, I don't know how to interpret this. I would have expected that shuffling the data, thereby destroying information, should have a worse effect on the performance than removing a component from the model. Or could removing a component from the model be interpreted as essentially disturbing the model's view on the data in a way that is similar to shuffling? I also understand that it might just be a coincidence that the numbers are similar, but I am curious to hear your thoughts.

Minor points

  • I thought the definition of future link prediction was a little odd: "future link prediction [...] ranks the true destination above negative candidates". I suppose that is desirable for good predictions, but it doesn't seem like this should be the definition.
7 comments
AuthorsOpenReview ↗

Response to Reviewer 9gC8: Part (1/4)

Thanks for your valuable time and constructive suggestions.

(Comment 1) Regarding the idea of using the ordered sequence of interactions: this is not a particularly new idea -- network scientists have long studied temporal networks and path data, sometimes also referred to as "higher-order data", and shown that the sequence of interactions should be taken into account and that it carries useful information.

We thank the reviewer for this perspective, and we agree that the ordered sequence of interactions carries useful information. However, this insight has not been fully exploited in temporal graph link prediction. Some recent models rely on recurrence-based signals such as neighbor co-occurrence or interaction frequency [R1, R2, R3], which are unavailable for unseen edges and lead to degradation in unseen-edge prediction [R4]. MambaTG addresses this gap by jointly modeling two signals, historical-sequence evolution and candidate-history compatibility. It scores each candidate as a continuation of the source node’s ordered history, which improves unseen-edge prediction while remaining strong on repeated edges. To our knowledge, this joint view of the two signals, together with its supporting empirical evidence (Sec. 5.3), provides a new perspective for designing link predictors on temporal graphs.

[R1] Towards Better Dynamic Graph Learning: New Architecture and Unified Library. NeurIPS 2023.

[R2] FreeDyG: Frequency Enhanced Continuous-Time Dynamic Graph Model for Link Prediction. ICLR 2024.

[R3] DyGMamba: Efficiently Modeling Long-Term Temporal Dependency on Continuous-Time Dynamic Graphs with State Space Models. TMLR 2025.

[R4] TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics. ICLR 2025.

Q1. How much more data is necessary to learn useful representations compared to methods that do not consider sequences of interactions? The typical problem when working with "higher-order data" is that much more data is required to infer patterns -- the longer histories we consider, the more possible sequences there are, and the sparser the data becomes in the sense of "what sequences have we seen vs. what sequences are possible".

Does MambaTG require much more data? No. All methods in Table 2 are trained on the same chronological split (Sec. 5.1), so MambaTG uses the same amount of training data as every baseline. MambaTG also mitigates the sparsity of seen versus possible sequences through parameter sharing: each node has a single embedding trained on all histories it appears in, and the same Mamba update is applied at every position of every history. It therefore does not need to have seen a particular sequence during training to process it.

The long-sequence analysis (Sec. 5.2, Fig. 3) supports this. There, the training data is fixed while the history length grows up to 1000 interactions, which greatly increases the number of possible sequences. If data sparsity were a limitation, performance would degrade as histories grow. Instead, MambaTG-R maintains strong performance, while CRAFT-R and DyGFormer degrade.

To measure this directly, we train MambaTG-R and CRAFT-R on 10-100% of the training queries on MOOC, keeping validation and test data fixed. MambaTG-R outperforms CRAFT-R at every data fraction, and its advantage does not shrink as training data decreases. With only 50% of the training queries, MambaTG-R already exceeds CRAFT-R trained on all of them (62.09 vs. 61.56).

Training queries kept10%25%50%75%100%
CRAFT-R51.1454.5159.2160.3561.56
MambaTG-R54.0358.3662.0962.8964.77
Δ+2.89+3.85+2.88+2.54+3.21
AuthorsOpenReview ↗

Response to Reviewer 9gC8: Part (2/4)

(Comment 2) I would have been curious to see some more analysis connected to the learned representations and how the "Dual-Branch Representation Refinement" creates embeddings that are more informative than those of other methods which do not adopt the idea of leveraging sequence data.

Q2. Can you provide some intuition of what DRR does? And would there be a way to compare the DRR-based representations with those of other models? I think what I am after is a way to understand how DRR is better than HSR or CFR alone.

Intuition for DRR and comparison of representations. The sequential encoder of MambaTG (CAME) reads the source history step by step and adapts to each interaction, but accesses earlier interactions only through a compressed, decaying state. HSR complements this sequential view by considering the entire history at once. Its learnable frequency-domain filter is equivalent to a circular convolution over the history [R5], allowing each interaction to be refined using all others so that weaker but predictive dynamics at different scales are not obscured by dominant patterns. This provides CAME with a history in which informative patterns are already emphasized, which is important because uninformative fluctuations can consume the limited state capacity of Mamba [R6]. Since HSR changes the history representations and each candidate continues from this refined state, CFR rescales the candidate’s channels to keep it compatible. HSR and CFR are therefore designed as a pair.

We support this with three experiments.

1. DRR is better than either branch alone. We add only HSR, only CFR, or both to MambaTG without DRR on GoogleLocal and Flickr. Each branch alone gives limited gains, while both together give far more than the sum of their individual gains.

Gain over MambaTG w/o DRR (pp)HSR onlyCFR onlySum of individual gainsHSR + CFR (full DRR)
GoogleLocal+0.88+0.25+1.13+1.83
Flickr+0.12−0.18−0.06+1.72

2. CFR aligns the candidate with the refined history. We measure the scale mismatch between the history and candidate representations entering CAME as the mean absolute difference of their per-channel standard deviations. HSR substantially raises this mismatch, and CFR closes 52-89% of it. This motivates CFR design and explains why HSR alone gives limited gains.

Scale mismatchGoogleLocalFlickrUCIMOOC
No refinement (w/o DRR)0.0530.0790.0170.095
With HSR, before CFR0.9330.5370.5340.344
With HSR, after CFR0.2210.1580.0610.164

3. DRR improves other models. We add DRR to CRAFT, which matches candidates to history through cross-attention. Since DRR only changes the input representations, no other change to CRAFT is needed. DRR improves CRAFT on all five datasets, showing that the refined representations are useful beyond MambaTG.

Test MRR (%)GoogleLocalYouTubeFlickrUCILastFM
CRAFT(-R)61.5658.3963.2974.9355.05
CRAFT(-R) + DRR63.4459.8563.8975.4755.49
Gain (pp)+1.88+1.46+0.60+0.54+0.44

[R5] Filter-enhanced MLP is All You Need for Sequential Recommendation. WWW 2022.

[R6] ASGMamba: Adaptive Spectral Gating Mamba for Multivariate Time Series Forecasting. 2026.

AuthorsOpenReview ↗

Response to Reviewer 9gC8: Part (3/4)

Q3. You mention in l.227 that "Without prior refinement, stronger patterns at one scale may obscure subtler yet predictive dynamics at other scales", which I totally agree with. You mention that DRR is supposed to address this issue, and I am wondering about the limits of that -- under what conditions might DRR fail? For example, what if a node has regularly occurring interactions at different timescales, but also some truly random interactions that do not carry any information? Would DRR manage to identify those regular interactions while throwing away the random interactions?

We thank the reviewer for this insightful question. DRR is able to handle the scenario the reviewer describes, and becomes less effective when random interactions dominate the history. This scenario primarily concerns HSR, the branch responsible for refining the history. Regular interactions at different timescales concentrate their energy at specific frequencies of the interaction sequence, whereas truly random interactions spread their energy roughly uniformly across frequencies. HSR’s learnable filter can therefore emphasize the frequencies of the regular patterns and attenuate the rest. HSR does not discard individual random interactions, since it acts on the whole sequence. Interaction-level selection is instead performed by CAME, whose input-dependent updates control how strongly each interaction affects the state.

We test this directly by replacing a fraction ρ of each history’s interactions with random nodes at test time, keeping their timestamps and order unchanged, and comparing MambaTG with and without HSR.

Test MRR (%)ρ = 00.10.20.30.50.70.9
GoogleLocalFull64.6262.2958.2753.9842.3127.6914.17
w/o HSR63.0460.3455.7851.0738.7325.3013.80
Gain (pp)+1.58+1.95+2.49+2.91+3.58+2.39+0.37
FlickrFull63.961.257.152.441.830.519.9
w/o HSR62.059.054.649.739.329.019.4
Gain (pp)+1.9+2.2+2.5+2.7+2.5+1.5+0.5

HSR’s advantage grows as random interactions are added, showing that it helps retain the regular patterns when noise is present. The advantage becomes small only when most of the history is random, where regular patterns are weak at every frequency and little signal remains to recover.

Q4. Did you run all experiments across all baselines and datasets yourself, or did you take some results for Table 2 from other papers?

In Table 2, EdgeBank, FreeDyG, DyG-Mamba and DyGMamba are from our own runs. All other baselines are taken from [R7] [R4], which use the same datasets, splits, negative samples, evaluation protocol, with closely matched training settings. The source of each result is described in Sec. 5.2 and App. B.4-B.5, and we will mark it explicitly in Table 2.

[R7] Future Link Prediction Without Memory or Aggregation. NeurIPS 2025.

[R4] TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics. ICLR 2025.

Q5. Could you explain why you call the paragraph in l. 415 "Performance-Efficiency Trade-off"? I do not quite see where there is a trade-off, which would imply something like sacrificing MRR in favour of shorter training times or buying better performance by doing longer training. Is there something like this hidden, for example, by considering different history lengths, or does the word "trade-off" give me the wrong idea here?

The term "Trade-off" refers to the trade-off observed in strong prior methods, where models such as DyGFormer and DyGMamba achieve high performance on repeated-edge-dominant datasets but incur substantially higher computational costs. Fig. 4 and App. J.2 show that MambaTG avoids this trade-off on MOOC, LastFM, and UCI, achieving the highest MRR while remaining among the most efficient models in terms of training time and model size. We will clarify this in the paragraph and rename the section to "Performance and Efficiency".

Reviewer_9ML6OpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper studies the problem of future link prediction on temporal graphs. The authors propose MambaTG, a candidate-aware Mamba-based framework that models historical-sequence evolution and candidate–history compatibility. The proposed method achieves competitive predictive performance and computational efficiency across multiple datasets.

Critical strengths

S1. Improving future link prediction on both repeated and unseen edges is an important problem.

S2. The experimental results demonstrate that the proposed method achieves better predictive performance and computational efficiency than existing baselines.

Critical weaknesses

W1. My main concern is the novelty. The main motivations of this work, including repeated/unseen-edge prediction, learnable node embeddings, and candidate–history matching, have already been extensively studied in prior work such as TGB-Seq and CRAFT. The proposed method mainly replaces CRAFT's cross-attention-based matching with Mamba-based sequential encoding and candidate continuation, while the additional spectral refinement follows existing frequency-domain modeling techniques. Therefore, the methodological novelty beyond combining existing components appears limited.

W2. The improvements over CRAFT are relatively modest, especially on unseen-edge-dominant datasets. Moreover, the efficiency experiments are mainly conducted on relatively small datasets (UCI, MOOC, and LastFM). I suggest evaluating training time, inference time, and memory usage on larger datasets such as Taobao, Yelp, and WikiLink to better justify the performance–efficiency trade-off of the proposed method.

W3. The model already incorporates temporal information through query-relative time encoding and Mamba-based sequential modeling. It remains unclear what additional temporal patterns HSR captures and whether FFT-based refinement is necessary. I suggest the authors provide stronger justification for these design choices, rather than simply combining existing techniques.

Minor

I suggest clarifying the column labels in Tables 3 and 4, as “Repeated” and “Unseen” may be misinterpreted as edge-level results rather than averages over repeated-edge-dominant and unseen-edge-dominant datasets.

Questions for authors

Q1. The paper reports results on repeated-edge-dominant and unseen-edge-dominant datasets. Could the authors additionally report MRR separately for repeated and unseen edges within the same datasets? This would help clarify how MambaTG performs on each type of interaction and better support its main motivation.

Q2. According to Table 3 and Figure 5, ShuffledInference causes a substantial performance drop, whereas ShuffledTrain and ShuffledBoth result in much smaller drops. Moreover, ShuffledInference has only a minor impact on YouTube. Could the authors explain these differences and clarify how much chronological ordering actually contributes to prediction performance? In particular, could the large degradation under ShuffledInference mainly result from the mismatch between training and inference rather than the loss of chronological ordering?

6 comments
AuthorsOpenReview ↗

Response to Reviewer 9ML6: Part (1/4)

Thanks for your valuable time and constructive suggestions.

Weakness 1. My main concern is the novelty.

We thank the reviewer for raising this concern. We agree that TGB-Seq [R1] and CRAFT [R2] established unseen-edge prediction and candidate–history matching as key problems. However, one gap remains. CRAFT compares each candidate with individual past interactions, so it does not explicitly capture how the history evolves. This matters most for unseen edges, where a candidate’s fit must be judged against the trajectory of the history rather than any single interaction. For example, a learner who took Python, Machine Learning, Computer Vision and then Robotics I is likely to take Robotics II next, whereas the same courses in reverse order make Programming Fundamentals more likely (Fig. 1).

MambaTG addresses this gap with candidate-conditioned sequential modeling. It encodes the history as a sequence and continues it with each candidate, so every candidate is evaluated in the context of the evolved history. Three results support this.

(1) Sequential core vs CRAFT. Without DRR, MambaTG still outperforms CRAFT on all four datasets, so its advantage does not depend solely on DRR but also comes from the sequential framework.

UCIMOOCGoogleLocalYouTube
CRAFT(-R)74.9361.5661.5658.39
MambaTG(-R) w/o DRR78.7164.4462.7959.65

(2) Long histories. As the history grows to 1,000 interactions, MambaTG-R maintains strong performance while CRAFT-R degrades (Sec. 5.2, Fig. 3). Longer histories can contain richer sequential patterns, which MambaTG captures by modeling the history as a sequence, whereas per interaction matching does not fully exploit them.

(3) Unseen edges and large candidate pools. MambaTG’s gains over CRAFT are largest on unseen edges (see our response to Weakness 2-1) and grow as the candidate pool becomes larger (see our response to Weakness 2-2).

The framework is also not tied to Mamba, as candidate continuation improves GRU and LSTM backbones over late fusion as well (see our response to Reviewer gPfQ, Weakness 1). We justify the design of DRR in our response to Weakness 3. Overall, MambaTG is not merely a combination of existing components, but a different way of scoring candidates by treating them as continuations of an evolving history. This design is backbone-agnostic and yields gains on both repeated- and unseen-edge-dominant datasets.

[R1] TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics. ICLR 2025.

[R2] Future Link Prediction Without Memory or Aggregation. NeurIPS 2025.

Weakness2-1. The improvements over CRAFT are relatively modest, especially on unseen-edge-dominant datasets.

Q1. The paper reports results on repeated-edge-dominant and unseen-edge-dominant datasets. Could the authors additionally report MRR separately for repeated and unseen edges within the same datasets? This would help clarify how MambaTG performs on each type of interaction and better support its main motivation.

We thank the reviewer for this suggestion. MambaTG’s improvements are largest on unseen edges, which dataset-level MRR can understate. To show this, we report MRR separately for repeated and unseen test edges on eight datasets.

ModelUCI†Wikipedia†Reddit†MOOC†LastFM†Flights†TaobaoYelp
Unseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / RepeatedUnseen / Repeated
Test edge share (%)28.7 / 71.310.8 / 89.26.9 / 93.139.2 / 60.89.3 / 90.715.8 / 84.281.3 / 18.792.0 / 8.0
CRAFT40.0 / 89.016.4 / 97.122.3 / 94.463.0 / 60.626.3 / 58.048.9 / 89.664.0 / 97.471.4 / 91.7
MambaTG48.9 / 91.618.5 / 97.523.1 / 94.766.3 / 63.829.5 / 59.848.5 / 91.368.4 / 93.574.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 by an average of +3.2 pp on unseen edges, 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. There, MambaTG outperforms CRAFT on the first four (+0.89 to +2.27 pp) and performs on par on WikiLink.

AuthorsOpenReview ↗

Response to Reviewer 9ML6: Part (2/4)

Weakness 2-2. Moreover, the efficiency experiments are mainly conducted on relatively small datasets (UCI, MOOC, and LastFM). I suggest evaluating training time, inference time, and memory usage on larger datasets such as Taobao, Yelp, and WikiLink to better justify the performance-efficiency trade-off of the proposed method.

We measure training time per epoch, inference time and peak GPU memory on Taobao, Yelp and WikiLink.

Taobao

ModelEpoch time (min)Inference time (min)Peak memory (GB)Test MRR (%)
MambaTG15.628.43.073.06
CRAFT7.824.22.170.68
DyGFormer68.4412.815.2-

Yelp

ModelEpoch time (min)Inference time (min)Peak memory (GB)Test MRR (%)
MambaTG15.712.82.175.85
CRAFT9.110.61.072.69
DyGFormer79.2177.615.821.68

WikiLink

ModelEpoch time (min)Inference time (min)Peak memory (GB)Test MRR (%)
MambaTG48.035.55.075.38
CRAFT18.230.63.375.48
DyGFormer197.1840.824.8-

Compared with DyGFormer, MambaTG trains 4.1-5.0× faster, runs inference 14-24× faster and uses 5-7.5× less memory, while achieving much higher MRR on Yelp (75.85 vs. 21.68).

We would like to explain the higher cost of MambaTG compared with CRAFT on these datasets. (1) In the current setting, with 100 negative candidates per query and histories of at most 250 interactions, CRAFT’s candidate-to-history attention reduces to small matrix multiplications that GPUs execute very efficiently. (2) Our implementation adds training overhead, since each history scan is extended by d_state auxiliary positions to propagate gradients through the cached history state (App. C.2).

In real applications such as recommendation, however, the candidate pool can contain thousands to millions of items. To reflect this setting, we compare MambaTG-R and CRAFT-R on LastFM as the number of negative candidates q increases, with the history length fixed at 250 interactions. Since LastFM has 1,000 destination nodes, q = 999 ranks the true destination against every other destination. As q increases, the extra inference time of MambaTG-R relative to CRAFT-R drops from 17.3% to 3.5%, while its MRR improvement over CRAFT-R grows from 3.5% to 11.6%. MambaTG therefore offers a more favorable trade-off as the candidate set grows, as in full-ranking settings.

Negative candidates q100500999
Inference time, CRAFT-R (s)91.4470.5984.7
Inference time, MambaTG-R (s)107.2490.51019.6
Extra inference time of MambaTG-R over CRAFT-R (↓)+17.3%+4.3%+3.5%
MRR, CRAFT-R (%)55.0532.5624.21
MRR, MambaTG-R (%)56.9835.1927.03
MRR improvement of MambaTG-R over CRAFT-R (↑)+3.5%+8.1%+11.6%
AuthorsOpenReview ↗

Response to Reviewer 9ML6: Part (3/4)

Weakness 3. The model already incorporates temporal information through query-relative time encoding and Mamba-based sequential modeling. It remains unclear what additional temporal patterns HSR captures and whether FFT-based refinement is necessary. I suggest the authors provide stronger justification for these design choices, rather than simply combining existing techniques.

We thank the reviewer for this suggestion. We agree that FFT-based filtering is not a new technique. What differs in DRR is that it is designed for the needs of candidate-conditioned encoding, and its CFR branch, which is not included in existing FFT-based methods [R3], is introduced directly from this design.

What does HSR capture beyond time encoding and Mamba? Query-relative time encoding treats each interaction independently, and Mamba reaches earlier interactions only through a compressed, decaying state. HSR complements both by considering the entire history at once. Its learnable frequency-domain filter is equivalent to a circular convolution over the whole history [R4], so each interaction is refined using all others and dominant patterns do not obscure subtler predictive dynamics. This also reduces the risk that uninformative fluctuations consume Mamba’s limited state capacity [R5].

Four experiments support this design:

1. HSR and CFR are complementary. On the unseen-edge datasets GoogleLocal and Flickr, we use only HSR, only CFR, or both, and measure the gain over MambaTG without DRR. Each branch alone gives limited gains, but together they yield far more than the sum of their individual gains on both datasets. HSR and CFR therefore work as a pair, and their gains reflect information that neither the time encoding nor Mamba already provides.

Gain over MambaTG w/o DRR (pp)HSR onlyCFR onlySum of individual gainsHSR + CFR (full DRR)
GoogleLocal+0.88+0.25+1.13+1.83
Flickr+0.12−0.18−0.06+1.72

2. CFR aligns the candidate with the refined history. We measure the scale mismatch between the history and candidate representations entering CAME as the mean absolute difference of their per-channel standard deviations. HSR substantially raises this mismatch, and CFR closes 52-89% of it on all four datasets. This confirms the mismatch that motivates CFR and explains why HSR alone gives limited gains.

Scale mismatchGoogleLocalFlickrUCIMOOC
No refinement (w/o DRR)0.0530.0790.0170.095
With HSR, before CFR0.9330.5370.5340.344
With HSR, after CFR0.2210.1580.0610.164

3. HSR suppresses uninformative interactions. We replace a fraction ρ of each history’s interactions with random nodes at test time, keeping their timestamps and order unchanged, and compare MambaTG with and without HSR. The advantage of HSR grows with the noise level on both datasets. HSR therefore prevents uninformative interactions from obscuring the predictive patterns in history.

Test MRR (%)ρ = 00.10.20.30.5
GoogleLocalFull64.6262.2958.2753.9842.31
w/o HSR63.0460.3455.7851.0738.73
Gain (pp)+1.58+1.95+2.49+2.91+3.58
FlickrFull63.961.257.152.441.8
w/o HSR62.059.054.649.739.3
Gain (pp)+1.9+2.2+2.5+2.7+2.5

4. DRR is a transferable plug-in. Since DRR operates only on input representations, we add it to CRAFT, which matches candidates to history through cross-attention, without changing its architecture. DRR improves CRAFT on all five datasets, with larger gains on the unseen-edge datasets. Its benefit is therefore not tied to Mamba’s sequential encoding.

Test MRR (%)GoogleLocalYouTubeFlickrUCILastFM
CRAFT(-R)61.5658.3963.2974.9355.05
CRAFT(-R) + DRR63.4459.8563.8975.4755.49
Gain (pp)+1.88+1.46+0.60+0.54+0.44

[R3] FreeDyG: Frequency Enhanced Continuous-Time Dynamic Graph Model for Link Prediction. ICLR 2024.

[R4] Filter-enhanced MLP is All You Need for Sequential Recommendation. WWW 2022.

[R5] ASGMamba: Adaptive Spectral Gating Mamba for Multivariate Time Series Forecasting. 2026.

Comments on the paper

1 comment
AuthorsOpenReview ↗

Summary of Revisions

We sincerely thank all reviewers for their thoughtful and constructive feedback, which has substantially improved our paper. Their comments helped us clarify the motivation of MambaTG, strengthen the justification of its design, and broaden the empirical evaluation. We have uploaded a revised version of the paper, with all changes highlighted in blue. The main revisions are summarized below, with the related reviewers indicated in brackets.

Main text

  • Related work (Sec. 2). Clarified the difference from CRAFT and why modeling the sequential evolution of the history matters most for unseen edges. [9ML6]
  • Preliminaries (Sec. 3). Revised the definition of future link prediction to separate the task from its evaluation. [9gC8]
  • DRR (Sec. 4.2). Added (1) the motivation for refining the history before sequential encoding, (2) the interpretation of HSR as a learnable circular convolution over the history, and (3) the role of CFR in aligning candidates with the refined history. [9ML6, 9gC8]
  • Main results (Sec. 5.2, Table 2). (1) Marked the baseline results from our own runs (†) and stated the sources of the others, (2) explained that the model variant is fixed by dataset group, (3) summarized the new edge-level evaluation, and (4) renamed the efficiency paragraph to "Performance versus Efficiency". [9ML6, 9gC8, gPfQ]
  • Signal validation (Sec. 5.3, Tables 3 and 4). (1) Relabelled the columns of Tables 3 and 4 as repeated-edge-dominant and unseen-edge-dominant dataset groups, (2) summarized a controlled shuffling experiment that isolates the contribution of chronological order, and (3) noted that candidate continuation also improves GRU and LSTM backbones. [9ML6, 9gC8, gPfQ]
  • Ablation study (Sec. 5.4). Added pointers to the new analyses of DRR. [9ML6, 9gC8]

Appendix sections

  • Appendix D.6. Isolating the contribution of chronological order under shuffling. [9ML6, 9gC8]
  • Appendix F.2–F.4. (1) Complementarity of HSR and CFR, (2) scale alignment by CFR, and (3) robustness of HSR to uninformative interactions. [9ML6, 9gC8]
  • Appendix G.1–G.2. (1) Comparison with GRU and LSTM backbones, and (2) separation of the backbone effect from candidate continuation. [9ML6, gPfQ]
  • Appendix J.4. Edge-level evaluation on repeated and unseen test edges. [9ML6, gPfQ]
  • Appendix J.5. Comparison of MambaTG and MambaTG-R on both dataset groups. [gPfQ]
  • Appendix J.6. Efficiency on larger datasets (Taobao, Yelp, and WikiLink). [9ML6]
  • Appendix J.7. Scalability to large candidate sets, up to full ranking on LastFM. [9ML6]

We hope these revisions address the reviewers' concerns, and we are happy to answer any further questions during the remaining discussion period.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.