Papers › Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks

Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks

22 Aug 2024arXiv:2408.12753archive 2025-07-28

Amirhossein Nouranizadeh, Fatemeh Tabatabaei Far, Mohammad Rahmati

Evolving networks are complex data structures that emerge in a wide range of systems in science and engineering. Learning expressive representations for such networks that encode their structural connectivity and temporal evolution is essential for downstream data analytics and machine learning applications. In this study, we introduce a self-supervised method for learning representations of temporal networks and employ these representations in the dynamic link prediction task. While temporal networks are typically characterized as a sequence of interactions over the continuous time domain, our study focuses on their discrete-time versions. This enables us to balance the trade-off between computational complexity and precise modeling of the interactions. We propose a recurrent message-passing neural network architecture for modeling the information flow over time-respecting paths of temporal networks. The key feature of our method is the contrastive training objective of the model, which is a combination of three loss functions: link prediction, graph reconstruction, and contrastive predictive coding losses. The contrastive predictive coding objective is implemented using infoNCE losses at both local and global scales of the input graphs. We empirically show that the additional self-supervised losses enhance the training and improve the model's performance in the dynamic link prediction task. The proposed method is tested on Enron, COLAB, and Facebook datasets and exhibits superior results compared to existing models.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

amrhssn/teneNCE officialmentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Contrastive LearningDynamic Link PredictionGraph Neural NetworkGraph ReconstructionLink PredictionRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Dynamic Link Prediction DBLP Temporal teneNCE AP 90.45 #1 of 7 Archive leaderboard report
Dynamic Link Prediction DBLP Temporal teneNCE AUC 88.25 #1 of 7 Archive leaderboard report
Dynamic Link Prediction DBLP Temporal teneNCE MRR 0.3397 #1 of 7 Archive leaderboard report
Dynamic Link Prediction Enron Emails teneNCE AP 93.65 #3 of 7 Archive leaderboard report
Dynamic Link Prediction Enron Emails teneNCE AUC 93.54 #3 of 7 Archive leaderboard report
Dynamic Link Prediction Enron Emails teneNCE MRR 0.315 #3 of 7 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Contrastive Predictive CodingInfoNCE

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections