- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies continuous-time dynamic graph representation learning, focusing on distinguishing rational mutations that follow stable evolution patterns from occasional mutations caused by incidental factors. This paper proposes TE-MDG, which learns global temporal prototypes to represent stable evolution and adds a transfer-entropy regularizer to increase the information these prototypes provide about future local representations. The key idea is to use the prototypes as a reference that retains predictive behavioral changes and downweights incidental ones. On TGB and DyGLib, the TE-MDG report improvements over several baselines on temporal link prediction and node-level ranking.
Critical strengths
The paper identifies a meaningful gap in dynamic graph representation learning: not all changes in historical interactions are equally informative for future behavior, and distinguishing persistent trends from incidental interactions is a useful direction. Its evolution-pattern decoupling module offers a straightforward way to inject global, reusable temporal patterns into local sequence representations, and the learned prototypes combine naturally with patch-level features inside existing temporal encoders. The evaluation covers temporal link prediction and node-level ranking on TGB and DyGLib, with consistent gains across the reported metrics on UCI, Enron, and tgbn-genre.
Critical weaknesses
Equation (2) makes the prototype representation a deterministic function of the current local state, so the conditional mutual information in Equation (6) is identically zero. This also contradicts Equation (8), which requires a rational mutation to remain dependent on the prototype after conditioning on that same state. The mini-batch shuffling strategy does not appear to sample from the conditional distribution required for the stated transfer entropy and may instead estimate ordinary mutual information. Consequently, the proposed objective does not theoretically justify the claimed distinction between rational and occasional mutations.
Mutation types are assigned by inspecting PCA plots, with no pre-specified rule or controlled injection of the two changes, so downstream accuracy does not show that rational mutations are preserved and occasional ones are filtered. The transfer-entropy term also contributes little: removing it changes average TGB AUC by only 0.45, and on tgbl-wiki the variant without it has higher AP than the full model. Confidence in the comparison is further limited by the gap from published TGB results. On tgbl-coin, published DyGFormer and GraphMixer reach about 75 MRR, while Table 1 reports 26.56 and 35.80. The unspecified subsampling rate and the w/o-S rows that reproduce DyGFormer, including the standard deviations, remain to be clarified.
Questions for authors
Equation (2) makes the prototype representation a deterministic function of the current local state. How can the conditional mutual information in Equation (6) be nonzero, and how can the conditional dependence asserted in Equation (8) hold?
What rule identifies rational and occasional mutations independently of the embedding geometry shown in Figure 1?
What evidence shows that the learned prototypes represent stable evolution patterns shared across nodes and time, rather than only a recombination of the current patch?
Why are the tgbl-coin test MRRs in Table 1, 26.56 for DyGFormer and 35.80 for GraphMixer, substantially below the published results of about 75 under the official TGB protocol?
Why do the w/o-S results on tgbl-wiki, tgbl-review, and UCI match the DyGFormer row in Table 1, including the standard deviations?
8 comments
Response to Reviewer J24M (2/6):
W2&Q2: Rules for Distinguishing Rational and Occasional Mutations
Thank you for this constructive suggestion. While we initially visualize the difference between rational and occasional mutations in the representation space via the PCA in Fig. 1, following your suggestion, we further broaden our verification dimensions to provide more objective and direct empirical evidence. Specifically, we distinguish these two types of mutations directly from the perspectives of raw interaction behaviors and independent predictive utility.
First, we verify the objective existence of mutations in raw data. By partitioning historical interactions into consecutive windows and applying Jensen–Shannon Divergence (JSD) with permutation tests, we find that 44.95% of adjacent window pairs exhibit significant distributional shifts. This confirms that local mutations are real behavioral changes rather than artifacts of the learned embeddings.
Building on this, our core rule distinguishes mutations based on their future predictive utility. We analyze 2,828 significant mutations by constructing three predictors: a base predictor that relies solely on historical interactions, an enhanced predictor that incorporates the true mutation, and a Sham control predictor that adds an equal number of resampled historical interactions to control for sample size. Based on the predictive gain in subsequent probe windows and its Bootstrap confidence intervals, we classify the mutations into Predictive, Non-predictive, and Uncertain categories, and subsequently evaluate their future predictive utility in an independent verification window. Specifically, Mean Net Gain measures the average improvement in future prediction, while Positive-Gain Rate quantifies the proportion of mutations yielding positive predictive gains in the independent verification window.
Table 1. Predictive Utility of Significant Local Mutations on UCI
| Mutation Type | Number of Mutations | Mutation Proportion (%) | Mutation Magnitude (Mean JSD, nats) | Future Predictive Utility (Mean Net Gain, nats/interaction) ↑ | Positive-Gain Rate(%) ↑ |
|---|---|---|---|---|---|
| Uncertain | 879 | 31.1 | 0.483 | 0.428 | 37.7 |
| Non-predictive | 374 | 13.2 | 0.478 | 0.243 | 23.3 |
| Predictive | 1,575 | 55.7 | 0.467 | 1.444 | 70.5 |
As shown in table 1, the Predictive and Non-predictive groups have highly similar mutation magnitudes (Mean JSD: 0.467 vs. 0.478). However, their future predictive utilities are substantially different. The Predictive group achieves a mean net gain of 1.444 nats/interaction with a 70.5% positive-gain rate, whereas the Non-predictive group yields only 0.243 nats/interaction with a 23.3% positive-gain rate. The difference in net gain is 1.201 (95% CI: [1.053, 1.365]). These results provide direct empirical support for our definitions. Rational mutations correspond to the Predictive group, as they contain information that continuously improves future predictions despite potentially deviating from historical trends. Occasional mutations correspond to the Non-predictive group, which exhibit similar magnitudes but lack future predictive value. This proves that predictive utility serves as a rigorous, independent rule to distinguish the mutations, fundamentally justifying the necessity of selective mutation modeling in TE-MDG.
Thank you again for your time in understanding our paper and for the insightful questions. We have added the detailed experimental designs and results to Appendices C.4.1 and C.4.2, respectively.
Response to Reviewer J24M (3/6):
W2: Selective Mutation Modeling Capability of TE-MDG
We greatly appreciate your insightful comment. As we have demonstrated in Section 4.3, there is a significant positive correlation between the TE gain and the model's predictive capability. We also theoretically discuss the selective modeling capability of TE-MDG for the two types of mutations in Appendix A.3. To provide more direct evidence for the selective mutation modeling capability of TE-MDG, we conduct a Counterfactual Mutation Replacement experiment.
Specifically, we replace the true mutation (Original) with resampled historical interactions (Sham), while strictly controlling for the number of interactions, timestamps, and future validation samples. We then measure two metrics: Counterfactual Predictive Gain (measuring how much the model leverages the true mutation for prediction) and Counterfactual Representation Distance (measuring the model's representational sensitivity to the mutation). If TE-MDG selectively models mutations, retaining a rational mutation should yield a high predictive gain and distinct representation response, whereas replacing a non-predictive occasional mutation should have a negligible impact.
To further verify whether TE gain reflects the predictive utility differences of local mutations, we utilize the MINE statistics network to compute the information association difference between the true temporal transfer and the negative sampling control, which is then aggregated into per-mutation TE score. Subsequently, we compare the score distributions across different mutation types, employ AUROC to quantify the discriminative power between rational and occasional mutations, and compare these with JSD and prototype assignment weights to evaluate the representational capability of TE scores regarding mutation predictive utility. The results are summarized in Table 2.
Table 2. Selective Mutation Modeling and TE Score Analysis on UCI
| Evaluation Metric | Predictive | Uncertain | Non-predictive |
|---|---|---|---|
| Counterfactual Predictive Gain ↑ | 0.1035(95% CI [0.0805, 0.1328]) | 0.0314(95% CI [0.0103, 0.0617]) | 0.0040(95% CI [-0.0197, 0.0332]) |
| Counterfactual Representation Distance ↑ | 0.1819 | 0.0672 | 0.0472 |
| TE Score ↑ | 0.3449 | 0.2423 | 0.2235 |
| As shown in Table 2, the Predictive group achieves a Counterfactual Predictive Gain of 0.1035, compared to merely 0.0040 for the Non-predictive group. This indicates that removing rational mutations significantly impairs TE-MDG's predictive performance, while replacing occasional mutations causes no stable average performance drop. Furthermore, the Counterfactual Representation Distance for the Predictive group (0.1819) is substantially larger than that of the Non-predictive group (0.0472), demonstrating that the model is highly sensitive to changes in rational mutations. Additionally, the Counterfactual Predictive Gain strongly correlates with the independent predictive utility metric established in our previous analysis (Spearman ρ = 0.718). |
Furthermore, the TE Score of the Predictive group (0.3449) is higher than that of the Non-predictive group (0.2235). When distinguishing between Predictive and Non-predictive mutations, the AUROC of the TE Score reaches 0.612 , surpassing the performance of both JSD and Prototype Weight, which stand at approximately 0.499. This indicates that relying solely on the magnitude of local mutations or prototype matching weights struggles to effectively distinguish mutations with different predictive values. In contrast, the TE Score captures additional information highly relevant to future predictive utility, demonstrating a superior discriminative capability. This further supports the critical role of TE gain in identifying rational mutations. Collectively, these results confirm that the internally learned TE scores successfully reflect the predictive utility differences of local mutations. (Detailed analysis is provided in Appendix C.5.2 and Figure 8).
Once again, we sincerely appreciate your insightful comments and constructive suggestions. We have added the detailed experimental designs, evaluation metrics, and result analyses to Appendix C.5.
Response to Reviewer J24M (1/6):
Dear J24M,
We sincerely appreciate the time and effort you have devoted to reviewing our work. We are particularly grateful for your insightful and constructive comments, which have helped us further refine and strengthen our study.
W1&Q1: Theoretical Derivation of Non-zero Conditional Mutual Information and Clarification on Mutation Dependence
We sincerely appreciate your insightful comment. We formalize the stochastic nature of the global prototypes and their relationship with local states, and then present a theoretical derivation and a concrete example to demonstrate the conditions under which the conditional mutual information is nonzero.
1. Theoretical Derivation of Non-Zero Conditional Mutual Information.
The global prototypes S in Eq. (2) are random prototypes jointly optimized during training. They represent shared evolution knowledge learned from historical interactions across nodes, and inherently capture cross-node factors that extend beyond the current local state. Consequently, the prototype representation is fully expressed as p~m=f(hmctx,S).
Across the joint probability distributions of different dynamic graph environments, varying historical interactions and learning processes naturally produce varying global prototypes. Thus, we model S as a random variable. Because these shared prototypes contain information about future states extending beyond the current local state, p~m provides additional predictive information given hmctx. This analysis follows Schreiber's definition of information transfer between stochastic processes [1] and the framework for multivariate information transfer proposed by Lizier et al. [2].
Specifically, let H=hmctx, Y=hm+1ctx, and P=p~m. Since P=f(H,S), the chain rule of conditional mutual information gives:
= I(Y;S\mid H)-I(Y;S\mid H,P).$$ Therefore, the prototype representation retains a portion of the conditional predictive information about future states contained in the global prototypes. Formally, this is expressed as: $$I(Y;S\mid H)>I(Y;S\mid H,P),$$ which directly yields $I(Y;P\mid H)>0$. We further construct a concrete example to demonstrate this condition, consistent with the softmax-based prototype aggregation mechanism in Eq. (2). Let $B\sim\operatorname{Bernoulli}(1/2)$ and $S=(B,B+1)$, which gives $P=B+\sigma(H/\tau)$. Suppose the future state satisfies $Y=B\oplus O$, where $O\sim\operatorname{Bernoulli}(q)$ is independent noise with $0<q<1/2$. We then obtain: $$I(Y;P\mid H)=1-H_2(q)>0.$$ This example confirms that, **under the joint distribution with random prototypes , the prototype aggregation mechanism in Eq. (2) yields strictly positive conditional mutual information in Eq. (6)**. **2. Establishment of the Conditional Dependence Relationships in Eq. (8)** Eq. (8) characterizes $\delta_{\mathrm{rat}}$ and $\delta_{\mathrm{oca}}$ as two latent information components of local mutations. These components are defined by their distinct informational roles in predicting future states, extending beyond mere similarities to historical interaction patterns. Specifically, **Rational Mutations** refer to change components that are related to the evolution patterns encoded by the shared prototypes and provide predictive information about future states. In contrast, **Occasional Mutations** refer to perturbation components that do not contain such shared predictive information. Rational mutations do not need to follow existing local historical trends, as newly emerging behavior patterns may also carry useful information about future evolution. Therefore, Eq. (8) precisely formulates the distinct conditional dependence relationships between these two components and the prototype representation: $$\delta_{\mathrm{rat}} \not\perp \tilde{p}_m \mid h_m^{\mathrm{ctx}}, \qquad \delta_{\mathrm{oca}} \perp \tilde{p}_m \mid h_m^{\mathrm{ctx}}.$$ In the constructive example above, let $\delta_{\mathrm{rat}}=B$ and $\delta_{\mathrm{oca}}=O$. We can simultaneously obtain: $$I(\delta_{\mathrm{rat}};P\mid H)=1\ \mathrm{bit}>0, \qquad \delta_{\mathrm{oca}}\perp P\mid H.$$ This theoretically establishes that **the nonzero condition of transfer entropy and the conditional dependence relationships of the two mutation components can hold simultaneously under the same probabilistic model**. Thank you again for your valuable suggestion, which helps us improve the theoretical explanation of our method. **We have added the complete proof to Appendix B.1.** [1] Schreiber T. Measuring information transfer[J]. Physical review letters, 2000, 85(2): 461. [2] Lizier J, Rubinov M. Multivariate construction of effective computational networks from observational data[J]. 2012.