TGM: a Modular and Efficient Library for Machine Learning on Temporal Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911199692587008 |
|---|---|
| author | Chmura, Jacob Huang, Shenyang Ngo, Tran Gia Bao Parviz, Ali Poursafaei, Farimah Leskovec, Jure Bronstein, Michael Rabusseau, Guillaume Fey, Matthias Rabbany, Reihaneh |
| author_facet | Chmura, Jacob Huang, Shenyang Ngo, Tran Gia Bao Parviz, Ali Poursafaei, Farimah Leskovec, Jure Bronstein, Michael Rabusseau, Guillaume Fey, Matthias Rabbany, Reihaneh |
| contents | Well-designed open-source software drives progress in Machine Learning (ML) research. While static graph ML enjoys mature frameworks like PyTorch Geometric and DGL, ML for temporal graphs (TG), networks that evolve over time, lacks comparable infrastructure. Existing TG libraries are often tailored to specific architectures, hindering support for diverse models in this rapidly evolving field. Additionally, the divide between continuous- and discrete-time dynamic graph methods (CTDG and DTDG) limits direct comparisons and idea transfer. To address these gaps, we introduce Temporal Graph Modelling (TGM), a research-oriented library for ML on temporal graphs, the first to unify CTDG and DTDG approaches. TGM offers first-class support for dynamic node features, time-granularity conversions, and native handling of link-, node-, and graph-level tasks. Empirically, TGM achieves an average 7.8x speedup across multiple models, datasets, and tasks compared to the widely used DyGLib, and an average 175x speedup on graph discretization relative to available implementations. Beyond efficiency, we show in our experiments how TGM unlocks entirely new research possibilities by enabling dynamic graph property prediction and time-driven training paradigms, opening the door to questions previously impractical to study. TGM is available at https://github.com/tgm-team/tgm |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_07586 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | TGM: a Modular and Efficient Library for Machine Learning on Temporal Graphs Chmura, Jacob Huang, Shenyang Ngo, Tran Gia Bao Parviz, Ali Poursafaei, Farimah Leskovec, Jure Bronstein, Michael Rabusseau, Guillaume Fey, Matthias Rabbany, Reihaneh Machine Learning Artificial Intelligence Well-designed open-source software drives progress in Machine Learning (ML) research. While static graph ML enjoys mature frameworks like PyTorch Geometric and DGL, ML for temporal graphs (TG), networks that evolve over time, lacks comparable infrastructure. Existing TG libraries are often tailored to specific architectures, hindering support for diverse models in this rapidly evolving field. Additionally, the divide between continuous- and discrete-time dynamic graph methods (CTDG and DTDG) limits direct comparisons and idea transfer. To address these gaps, we introduce Temporal Graph Modelling (TGM), a research-oriented library for ML on temporal graphs, the first to unify CTDG and DTDG approaches. TGM offers first-class support for dynamic node features, time-granularity conversions, and native handling of link-, node-, and graph-level tasks. Empirically, TGM achieves an average 7.8x speedup across multiple models, datasets, and tasks compared to the widely used DyGLib, and an average 175x speedup on graph discretization relative to available implementations. Beyond efficiency, we show in our experiments how TGM unlocks entirely new research possibilities by enabling dynamic graph property prediction and time-driven training paradigms, opening the door to questions previously impractical to study. TGM is available at https://github.com/tgm-team/tgm |
| title | TGM: a Modular and Efficient Library for Machine Learning on Temporal Graphs |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2510.07586 |