mlsanityData to 14 Oct 2026

WBT-BGRL: A Non-Contrastive Weighted Bipartite Link Prediction Model for Inductive Learning

arXiv 2510.24927 ↗First posted 28 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Link prediction in bipartite graphs is crucial for applications like recommendation systems and failure detection, yet it is less studied than in monopartite graphs. Contrastive methods struggle with inefficient and biased negative sampling, while non-contrastive approaches rely solely on positive samples. Existing models perform well in transductive settings, but their effectiveness in inductive, weighted, and bipartite scenarios remains untested. To address this, we propose Weighted Bipartite Triplet-Bootstrapped Graph Latents (WBT-BGRL), a non-contrastive framework that enhances bootstrapped learning with a novel weighting mechanism in the triplet loss. Using a bipartite architecture with dual GCN encoders, WBT-BGRL is evaluated against adapted state-of-the-art models (T-BGRL, BGRL, GBT, CCA-SSG). Results on real-world datasets (Industry and E-commerce) show competitive performance, especially when weighting is applied during pretraining-highlighting the value of weighted, non-contrastive learning for inductive link prediction in bipartite graphs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 14 references that are in the map. First posted on arXiv 28 Oct 2025.

Builds on

9 of 14 references.

References · 9

  1. 2018Link Prediction Based on Graph Neural Networkscited by 832
  2. 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 186
  3. 2021From Canonical Correlation Analysis to Self-supervised Graph Neural Networkscited by 141
  4. 2021Graph Barlow Twins: A self-supervised representation learning framework for graphscited by 85
  5. 2022Link Prediction with Non-Contrastive Learningcited by 11
  6. 2025Does GCL Need a Large Number of Negative Samples? Enhancing Graph Contrastive Learning with Effective and Efficient Negative Samplingcited by 8
  7. 2024From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learningcited by 4
  8. 2023Graph Ranking Contrastive Learning: A Extremely Simple yet Efficient Methodcited by 2
  9. 2013Information filtering in sparse online systems: recommendation via semi-local diffusioncited by 1

Built on by

Not cited yet.