- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes DYG-WM, a dynamic graph learning framework inspired by the world modeling paradigm, aiming to predict future node and relation representations from historical graph observations. The framework consists of three main components. First, a historical node-relation context encoder captures node-neighborhood trajectories and pair-specific interaction histories. Second, a node-relation path-signature encoder models the ordered structural changes at both node and relation levels to characterize path-dependent graph evolution. Third, a dual-level joint-embedding predictive objective aligns predicted future node and relation representations with target representations obtained from an EMA-based encoder, enabling latent future-state prediction without explicitly reconstructing the target graph. The framework is evaluated on 12 dynamic link prediction datasets under different negative sampling strategies and two dynamic node classification datasets. Additional latent alignment analyses investigate the effectiveness of DYG-WM in learning predictive representations.
Critical strengths
- The paper explores a meaningful direction by extending predictive latent representation learning to dynamic graph evolution. Rather than focusing exclusively on downstream edge or node predictions, the proposed framework introduces an objective for jointly predicting future node and relation representations. This provides an interesting perspective on modeling graph evolution in latent space.
- The proposed architecture incorporates complementary historical information through node-neighborhood trajectories, pair-specific structural contexts, and path-signature representations of ordered structural changes. The introduction of relation modeling can potentially capture temporal dependencies that may not be adequately represented by node embeddings alone.
- The paper evaluates DYG-WM on both dynamic link prediction and dynamic node classification. Component ablations and latent alignment analyses also support the proposed architecture and its predictive learning objective.
Critical weaknesses
- Potential over-claim of the graph world modeling framing. Although the paper presents DYG-WM as a dynamic graph world model, the proposed framework more closely resembles temporal graph representation learning regularized by future latent prediction. The model inference is based on historical representations rather than explicit future graph state generation. The distinction between the proposed framework and self-supervised temporal graph learning remains insufficiently established, raising concerns about over-claiming.
- Limited empirical advantages and unclear contribution of the world modeling objective. In dynamic link prediction, DYG-WM does not demonstrate consistent or substantial improvements over strong baselines such as DyGFormer across different datasets and negative sampling settings. More importantly, the component ablations suggest that the predictive objective, which constitutes the central world modeling component, contributes less to the final performance than the path-signature encoder. Given that dynamic link prediction accounts for major part of empirical evaluation, the experimental evidence therefore does not sufficiently establish the distinctive benefits of the world modeling framing over conventional temporal graph learning approaches.
- Limited evidence of graph state evolution learning. The latent alignment experiments primarily demonstrate that the predicted representations become more similar to the target representations when the joint-embedding predictive objective is employed. However, improved latent similarity mainly verifies that the alignment objective is functioning as intended, rather than demonstrating that the model has learned meaningful or generalizable graph state evolution patterns.
Questions for authors
- Could authors clarify what distinguishes DYG-WM from conventional self-supervised temporal graph learning? It would be helpful to explain what specific world modeling capabilities the proposed framework provides beyond learning future temporal representations.
- Could authors provide further evidence of the practical benefits of the world modeling objective for dynamic link prediction, and provide ablation results on dynamic node classification?
- Could authors provide more evidence (the multi-step latent prediction for example) that the predicted latent representations capture meaningful graph evolution patterns beyond alignment with next-step embeddings?
6 comments
W1/ Q1: DyG-WM is a world model in the JEPA sense: an action-free model that, from the history , forecasts the future graph state in a learned latent space. Forecasting in latent space instead of generating the future graph is a deliberate JEPA design choice: it targets the predictable, abstract part of the future instead of reconstructing unpredictable details. We will state this scope explicitly, namely that there is no explicit graph generation and no actions or planning, and describe DyG-WM as a latent world model of graph dynamics.
Within this scope, DyG-WM differs from self-supervised temporal graph learning in what it learns and what it can do at inference time:
| Method family | Training signal | Explicit forecast at inference? | Pair-level future state? |
|---|---|---|---|
| Contrastive (e.g., CLDG) | invariance across time spans | no | no |
| Masked reconstruction (e.g., MaskDGNN, DVGMAE) | recover masked present structure / features | no | no |
| Node-level JEPA (SG-JEPA) | next-snapshot node embeddings | node level only | no |
| DyG-WM | horizon-conditioned forecast of future node and relation latents vs. an EMA target | yes: , from alone | yes |
W2/ Q2: DyG-WM has the best average AUC-ROC rank in all three settings: 2.67 vs. 3.08 for DyGFormer (random negatives), 4.33 vs. 4.42 (historical) and 3.58 vs. 4.42 (inductive). Under AP the two are on par (Tables 8–9). Where DyGFormer is clearly ahead, the cause is dataset-specific:
-
Can. Parl.: events within a year are sorted by destination, and DyGFormer's un-masked padding then separates positive from negative batches.
-
MOOC: the dominant signal is a user's exact previous item, which no snapshot model observes. DyG-WM is the best snapshot method there.
Details are in our response to Reviewer qzG6 (W1). Revision: Contribution 3 is stated for AUC-ROC, and AP is discussed separately.
The signature and the objective play different roles, so their ablation drops are not directly comparable. The signature adds input information (the ordered structural changes of a pair), so removing it removes information. The objective shapes what the representation encodes, and its benefits for link prediction are direct:
-
A usable forecast. The forecast alone ranks links with AUC 84–92, while a model trained without the objective reaches the same supervised accuracy but has an uninformative forecast (AUC 37–58). Adding the forecast to the scorer improves Can. Parl. by +2.1 AUC / +1.9 AP on 4 of 5 seeds; on Enron the change is not significant (−0.6, p = 0.09). Replacing the observed relation context by the forecast costs only ~1 AUC.
-
No accuracy cost, small consistent gains. Under random negatives on US Legis., AP improves on all 5 seeds (+0.28). Elsewhere the differences are within seed variance.
-
Useful representations without labels. With JEPA-only pretraining and a frozen probe, DyG-WM beats an identically probed random encoder on Enron (+3.5 AUC, every seed; also above all self-supervised baselines of Table 1 in the same setting) and on UN Trade (+1.1 AUC / +2.3 AP, 4 of 5 seeds).
For the node classification ablation, on dblp, the three parts show the capability.
| Macro-F1 | Micro-F1 | ||
|---|---|---|---|
| full | 75.30±0.28 | 73.30±0.31 | |
| w/o predictive objective | 73.63±0.55 | 71.47±0.24 | |
| w/o path signature | 73.36±0.50 | 71.32±0.37 | |
| w/o node trajectories | 73.40±0.68 | 71.36±0.54 |
We thank the reviewer for finding the direction promising and the paper clearly written, and for questions that pinpoint exactly what a world-model claim must show. Our answers rest on new evidence:
The forecast captures how graphs evolve, not just alignment (W3/Q3). It identifies the true future pair state 4–8× above chance, up to three snapshots ahead. On UCI it beats a "no change" baseline by a margin that grows with the horizon: +5.2, +10.0 and +11.6 points.
The world-modelling objective has practical benefits for link prediction (W2/Q2). Its forecast alone scores links with AUC 84–92, adding it to the scorer improves Can. Parl. by +2.1 AUC, and JEPA-only pretraining beats a random encoder under a frozen probe.
Node-classification ablations are added (Q2).
The framing is scoped precisely: a latent, action-free world model of graph dynamics (W1/Q1).