Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chatterjee, Ayan, Ikica, Barbara, Ravandi, Babak, Palowitch, John
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2504.10925
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915247048097792
author Chatterjee, Ayan
Ikica, Barbara
Ravandi, Babak
Palowitch, John
author_facet Chatterjee, Ayan
Ikica, Barbara
Ravandi, Babak
Palowitch, John
contents Link prediction on graphs has applications spanning from recommender systems to drug discovery. Temporal link prediction (TLP) refers to predicting future links in a temporally evolving graph and adds additional complexity related to the dynamic nature of graphs. State-of-the-art TLP models incorporate memory modules alongside graph neural networks to learn both the temporal mechanisms of incoming nodes and the evolving graph topology. However, memory modules only store information about nodes seen at train time, and hence such models cannot be directly transferred to entirely new graphs at test time and deployment. In this work, we study a new transfer learning task for temporal link prediction, and develop transfer-effective methods for memory-laden models. Specifically, motivated by work showing the informativeness of structural signals for the TLP task, we augment a structural mapping module to the existing TLP model architectures, which learns a mapping from graph structural (topological) features to memory embeddings. Our work paves the way for a memory-free foundation model for TLP.
format Preprint
id arxiv_https___arxiv_org_abs_2504_10925
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Transfer Learning for Temporal Link Prediction
Chatterjee, Ayan
Ikica, Barbara
Ravandi, Babak
Palowitch, John
Machine Learning
Artificial Intelligence
Link prediction on graphs has applications spanning from recommender systems to drug discovery. Temporal link prediction (TLP) refers to predicting future links in a temporally evolving graph and adds additional complexity related to the dynamic nature of graphs. State-of-the-art TLP models incorporate memory modules alongside graph neural networks to learn both the temporal mechanisms of incoming nodes and the evolving graph topology. However, memory modules only store information about nodes seen at train time, and hence such models cannot be directly transferred to entirely new graphs at test time and deployment. In this work, we study a new transfer learning task for temporal link prediction, and develop transfer-effective methods for memory-laden models. Specifically, motivated by work showing the informativeness of structural signals for the TLP task, we augment a structural mapping module to the existing TLP model architectures, which learns a mapping from graph structural (topological) features to memory embeddings. Our work paves the way for a memory-free foundation model for TLP.
title Transfer Learning for Temporal Link Prediction
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2504.10925