- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper explores the task of continuous-time dynamic graph condensation tailored for temporal edge classification. Instead of generating synthetic events, the approach relies on learning importance scores for original training events, picking a compact subset through a class-wise top-k mechanism and a straight-through estimator. To steer this selection, a frozen temporal relay model is employed to optimize two main goals: aligning the class-wise representation statistics between the original and condensed histories, and maintaining label prediction accuracy. Across five datasets and various downstream models, experiments show that the selected subsets generally surpass baseline event-selection methods, particularly at lower retention ratios.
Critical strengths
This paper tackles a meaningful problem with unique temporal challenges. Condensing an event stream is inherently trickier than filtering independent training examples because dropping a single event alters the historical context of everything that follows. Exploring reusable, compact training streams for temporal edge classification is therefore a worthwhile pursuit that nicely pushes graph condensation beyond static and snapshot-based setups.
The approach is conceptually coherent and backed by encouraging empirical results. Aligning the representations of selected events across original and condensed histories is an intuitive way to handle these temporal dependencies. The experiments span five datasets, multiple retention ratios, and several downstream architectures, offering solid evidence that the method produces genuinely useful training subsets. The cross-architecture evaluation is a particular highlight, as it alleviates concerns that the selected events might only be overfitted to the relay model.
Critical weaknesses
The current analysis does not fully isolate the specific contribution of temporal-context preservation. The proposed losses might simply favor events that are easy for the frozen relay model to classify or whose representations remain stable when history is dropped, rather than capturing broader temporal dependencies.
While the ablations confirm that both objectives help, they do not distinguish your temporal mechanism from standard supervised subset selection using the same relay model.
Crucial details regarding the optimization and evaluation setup also remain unclear. Although the straight-through estimator mask is defined, the manuscript does not explain how it integrates into temporal neighborhood construction and aggregation, or how unselected events receive gradients to re-enter the subset.
It is ambiguous whether downstream evaluation can access discarded training events as historical context.
Questions for authors
Could you walk us through how the straight-through estimator mask is actually integrated into temporal neighborhood sampling and aggregation?
What kind of historical information is accessible during downstream training, validation, and testing?
How can we be sure how much performance gain stems directly from accounting for shifts in temporal context?
What does the overall preprocessing overhead look like?
Could you clarify the discrepancy in the Enron results at the 2.5% retention ratio? Table 2 lists , while the complete model in Table 4 reports . Were these generated using different experimental settings?