REVIEW 3 cited by
MiNT: Multi-Network Training for Transfer Learning on Temporal Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Temporal Graph Learning (TGL) has become a robust framework for discovering patterns in dynamic networks and predicting future interactions. While existing research has largely concentrated on learning from individual networks, this study explores the potential of learning from multiple temporal networks and its ability to transfer to unobserved networks. To achieve this, we introduce Temporal Multi-network Training MiNT, a novel pre-training approach that learns from multiple temporal networks. With a novel collection of 84 temporal transaction networks, we pre-train TGL models on up to 64 networks and assess their transferability to 20 unseen networks. Remarkably, MiNT achieves state-of-the-art results in zero-shot inference, surpassing models individually trained on each network. Our findings further demonstrate that increasing the number of pre-training networks significantly improves transfer performance. This work lays the groundwork for developing Temporal Graph Foundation Models, highlighting the significant potential of multi-network pre-training in TGL.
Forward citations
Cited by 3 Pith papers
-
T-GRAB: A Synthetic Diagnostic Benchmark for Learning on Temporal Graphs
T-GRAB, a set of three synthetic temporal-graph tasks, shows that no current TGNN reliably does counting, delayed cause-effect, or long-range spatio-temporal reasoning.
-
A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction
A hybrid quantum-classical temporal graph network with adaptive amplitude encoding claims strong link-prediction results on five TGBL benchmarks, but the evaluation is undermined by a below-random baseline and missing code.
-
Higher-order Structure Boosts Link Prediction on Temporal Graphs
HTGN adds hyperedge memory and hypergraph convolution to temporal GNNs, claiming better dynamic link prediction and lower memory cost, but the reported results are undermined by data inconsistencies and invalid proofs.
Discussion (0). Continue with ORCID to comment.