Instance Discrimination for Link Prediction
Summary
This paper adapts instance discrimination self-supervised learning to link prediction in graphs, proposing new models L-GRACE and L-BGRL that operate on link representations and improve performance especially on unattributed graphs.
View Cached Full Text
Cached at: 05/21/26, 06:21 AM
# Instance Discrimination for Link Prediction Source: [https://arxiv.org/abs/2605.20257](https://arxiv.org/abs/2605.20257) Authors:[Valentin Cuzin\-Rambaud](https://arxiv.org/search/cs?searchtype=author&query=Cuzin-Rambaud,+V)\(SyCoSMA, DM2L, LIRIS, UCBL\),[Mathieu Lefort](https://arxiv.org/search/cs?searchtype=author&query=Lefort,+M)\(LIRIS, SyCoSMA, IRISA, MALT, UR\),[Rémy Cazabet](https://arxiv.org/search/cs?searchtype=author&query=Cazabet,+R)\(DM2L, LIRIS, UCBL, IXXI\) [View PDF](https://arxiv.org/pdf/2605.20257) > Abstract:Recently, instance discrimination models have emerged as a major solution for self\-supervised learning\. Having already demonstrated its effectiveness in the image domain, instance discrimination learning is now proving equally convincing in the graph domain, in particular for node classification\. However, fewer contributions have tackled the link prediction task\. In this contribution, we propose to adapt existing methods to this context\. We first provide a rigorous evaluation of existing self\-supervised models in the field of link prediction, showing that the main performance depends on the augmentation process \(like in computer vision\)\. We then propose a new structural augmentation based on the community structure that is relevant for link prediction\. Our main contribution introduces two new models, L\-GRACE and L\-BGRL, based on link representations instead of node representations, which improve the performance of the existing methods, especially on unattributed graphs, and we show that they perform on par with the state of the art, both in supervised and self\-supervised contexts\. ## Submission history From: Valentin Cuzin\-Rambaud \[[view email](https://arxiv.org/show-email/0996fe63/2605.20257)\] \[via CCSD proxy\] **\[v1\]**Mon, 18 May 2026 13:27:41 UTC \(350 KB\)
Similar Articles
A Survey on GNN-based Link Prediction: Techniques, Applications, and Challenges
This survey comprehensively reviews GNN-based link prediction from a dedicated GNN perspective, categorizing recent advancements by techniques (GCN, GAE, GAT, GFormer) and applications (knowledge graphs, recommendation systems), and discusses challenges and future directions.
NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning
This paper introduces NodeJEPA, a joint-embedding predictive architecture for node-level graph self-supervised learning that predicts latent representations of masked structure-aware ego-subgraphs, avoiding reconstruction and hand-crafted augmentations. The method is evaluated on node classification benchmarks and shows competitive performance.
SLM-Conditioned Hierarchical Relation Routing for Labeled Property Graph Learning
This paper proposes SLM-Conditioned Hierarchical Relation Routing, an architecture that integrates small language models into graph neural networks to enable adaptive message selection in labeled property graphs, enhancing prediction accuracy by leveraging contextual semantic information.
A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions
This paper proposes a unified contrastive framework for learning graph representations across multiple abstraction levels (node, proximity, cluster, graph) with a parameter-free self-weighting mechanism that adaptively assigns weights to similarity scores, outperforming state-of-the-art on downstream tasks like classification, clustering, and link prediction.
Pattern Over-Generalization of Knowledge Graph Embedding
This paper proposes PogRE, a method to address pattern over-generalization in knowledge graph embedding by using dense linear transformations, improving link prediction performance on standard benchmarks.