- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces DyGDi, a diffusion-based framework for continuous-time dynamic graph generation that uses conditional flow matching to generate multiple graph events and their features simultaneously. It combines temporal graph representations, event tokenization, and node-identity matching to support inductive generation. Experiments on Reddit, Wikipedia, MOOC, and LastFM report improvements in generation quality, computational efficiency, and scalability compared with existing approaches.
Critical strengths
The paper addresses a relevant challenge in dynamic graph generation, particularly the computational limitations of autoregressive approaches. Generating multiple events jointly rather than sequentially is an interesting direction, and the proposed treatment of new-node identities addresses a practical difficulty in inductive generation. The evaluation considers several public datasets and examines different aspects of generation quality, including feature distributions, graph topology, and computational efficiency. The obtained generation-speed improvements are useful, especially for applications involving large event streams.
Critical weaknesses
The paper has several serious weaknesses that undermine its scientific contribution.
- The methodological novelty is questionable. The proposed framework combines existing components, including conditional flow matching, temporal graph networks, transformer-based sequence modeling, and embedding-based node matching. The paper does not sufficiently establish what fundamentally new modeling capability emerges from this combination beyond parallel event generation.
- The theoretical foundations are extremely limited, with no formal guarantees concerning temporal consistency, preservation of graph structure, convergence, or the correctness of node-identity matching. The proposed solution to node-identity collapse relies on random Gaussian embeddings and heuristic event classes, but there is no rigorous demonstration that these mechanisms reliably preserve identities across successive generation windows.
- Another major concern is the lack of explicit structural constraints ensuring that events generated form valid and temporally coherent dynamic graphs.
- The experimental evaluation is also not convincing. The comparisons are restricted to a small set of generative baselines, and important aspects such as long-horizon error accumulation, robustness to distribution shifts, and generalization to substantially larger graphs remain uninvestigated. Some reported results directly weaken the claims of consistently superior generation quality: for instance, DyGDi performs worse than DG-Gen on several topological metrics, and its connected-component error on MOOC is particularly concerning.
- The scalability claims are also overstated, so more rigorous validation is needed for complex dynamic graphs.
- The absence of publicly available code at submission time makes verification difficult.
Questions for authors
No need as weaknesses concern novelty and experimental validation.
5 comments
Another major concern is the lack of explicit structural constraints ensuring that events generated form valid and temporally coherent dynamic graphs.
In the CTDG formalism, a dynamic graph is a sequence of time-stamped events, and every event generated by DyGDi is a valid event by construction. Its source and destination are matched to node identifiers (Eq. 10), its timestamp is the cumulative sum of generated inter-event intervals clamped to be non-negative, so timestamps are non-decreasing by construction, and its features are generated jointly. No hand-crafted constraint is needed for the output to be a valid CTDG, as in Tigger and DG-Gen. Temporal coherence is what the model learns from data and what we evaluate, both per window with the topology metrics and over the whole stream with the JL similarity, on which DyGDi is the best model on all eight datasets.
The comparisons are restricted to a small set of generative baselines,
Very few models can perform inductive CTDG generation, as reported by recent studies [Hosseini et al., 2024; Gupta et al., 2022]. We compare against all the inductive CTDG generators we are aware of. For link prediction, we compare against 16 baselines, including six recent models added in the revision (FreeDyG, TPNet, DyGMamba, DyG-Mamba, TAWRMAC, and DSRD).
and important aspects such as long-horizon error accumulation, robustness to distribution shifts, and generalization to substantially larger graphs remain uninvestigated.
- Long-horizon error accumulation. DyGDi generates the whole test split autoregressively, window after window, each window conditioned on the generated past only. This amounts to up to 364k generated events on Contacts. The JL similarity embeds the generated stream, so any accumulated drift lowers it, and DyGDi obtains the best JL similarity on all eight datasets. The topology results are also stable across snapshot window sizes (Section A.8).
- Distribution shift. The same architecture is used without change on eight datasets with very different distributions, bipartite and non-bipartite, with 74 to 10,984 nodes and time spans from 28 days to more than 4 years, and DyGDi obtains the best JL similarity on all of them. The generation is also inductive, so the model must create and reuse nodes never seen during training. Finally, the new-node link-prediction setting holds out of the nodes during training, and DyGDi loses at most AP from the transductive to the new-node setting on Reddit, Wikipedia and MOOC, against up to for the supervised baselines.
- Larger graphs. We added four non-bipartite datasets, Enron, UCI, SocialEvo and Contacts. SocialEvo and Contacts have 2.1 million and 2.4 million events, nearly twice the size of the largest original dataset (LastFM), and the gains of DyGDi carry over to them.
Some reported results directly weaken the claims of consistently superior generation quality: for instance, DyGDi performs worse than DG-Gen on several topological metrics, and its connected-component error on MOOC is particularly concerning.
We report 8 topology metrics on 8 datasets against two baselines, without selection, so no model can be best on every cell. Overall, DyGDi outperforms DG-Gen on 36 of the 64 topology comparisons (with 5 ties) and Tigger on 54 of 64 (with 1 tie), wins 13 of the 14 feature comparisons, and obtains the best JL similarity on all eight datasets. We do not claim to win every metric, and we discuss the cases where DyGDi is behind. The connected-component error on MOOC is discussed in Section 5.2. DyGDi over-fragments its MOOC snapshots into too many components, while performing comparably to DG-Gen on most other topology metrics. On the same dataset, the JL similarity rates DG-Gen five times worse than DyGDi, showing that the individually plausible windows of DG-Gen do not compose into a realistic stream of events.
The scalability claims are also overstated, so more rigorous validation is needed for complex dynamic graphs.
Our scalability claims are supported by direct measurements under identical hardware.
- Generation speed. DyGDi generates faster than DG-Gen with 12 features and faster with 172 features (Section 5.4), where the cost of DyGDi is almost independent of the number of features.
- Feature scaling. With 172 features, DG-Gen loses and of its JL similarity on Reddit and Wikipedia, against and for DyGDi (Section 5.3).
- Training speed and memory. DyGDi converges faster in training time (Section A.4) and its peak memory stays below GB in the largest configuration (Section A.6).
- Graph size. The new SocialEvo and Contacts datasets, with more than 2 million events each, extend the validation to larger and non-bipartite dynamic graphs.
The absence of publicly available code at submission time makes verification difficult.
Releasing code at submission time is not mandatory at ICLR. Following the ICLR guidelines, the paper includes a reproducibility statement, the full experimental setup is described in Section A.2, and all model, training and generation hyperparameters are reported in Table 6. All experiments use public benchmark datasets, and the baselines are run from their released code. We will release our source code and trained checkpoints upon acceptance.
We hope that these answers and the additional experiments address the reviewer's concerns, and we would be grateful if the reviewer would reconsider their assessment. We remain available for any further question.
We thank the reviewer for their review. We are glad that the reviewer recognizes the importance of the problem, the simplicity of the design and its effectiveness. We note that the review raises no question, and we answer each of the stated weaknesses below. All the changes in the updated pdf are shown in red.
Every generative model is built from existing components, and our contribution lies in the formulation, not in the components. DyGDi casts CTDG generation as the joint denoising of a window of event tokens, which is, to the best of our knowledge, the first diffusion-based generative model for CTDGs. This formulation raises a problem that does not exist in prior work, namely the mapping between generated embeddings and node identities for nodes never seen before. We identify and formalize its two failure modes (memory collapse and window collapse, Section 3.2) and resolve each of them.
The new capability is not parallel generation by itself, but joint generation, where the events of a window attend to each other while being generated. Existing inductive CTDG generators either sample events one by one (slow) or sample batches of independent events (incoherent). The new synthetic experiment (Section A.10) shows that this capability is decisive. DyGDi follows a simple node-assignment rule in every window, while DG-Gen and Tigger fail. The same trained DyGDi model also fails as soon as the events of a window are generated independently (Section A.10.3), which isolates joint generation as the cause. Joint denoising also brings the conditioning flexibility of diffusion, which lets the same trained model perform zero-shot link prediction.
DyGDi is trained with the standard conditional flow-matching objective, so it inherits the guarantees of this framework, where the learned velocity field transports the noise distribution to the conditional data distribution of the event windows when the regression loss is minimized [Lipman et al., 2023]. No inductive CTDG generator we are aware of (Tigger, DG-Gen) provides formal guarantees of temporal consistency or structure preservation, and these properties are evaluated empirically in the literature, which we follow with 8 topology metrics, 3 feature metrics and the global JL similarity.
The two mechanisms are not heuristic. Section 3.2 shows that, without them, the matching score of Eq. (10) is degenerate by construction, since all unseen nodes share the zero memory embedding (memory collapse), and the generated queries of distinct new nodes become indistinguishable (window collapse). Identities across successive windows are preserved by design. Once a window is generated, the TGN memory is updated with its events, so every created node obtains its own memory state and is matched as a seen node in the following windows.
We added a direct and exact demonstration in the revision. On the synthetic dataset of Section A.10, new nodes are created in each window, recalled later in the same window and recalled again in the next window, so identity preservation can be scored exactly. DyGDi assigns every identity correctly in all generated windows. The new cross ablation (Section A.10.4) further shows that each mechanism is necessary. Without the Gaussian embedding, the model swaps the new nodes of a window, without the event class, new events reuse existing nodes, and without both, the generation collapses onto a single node per window.