RankGraph: Unified Heterogeneous Graph Learning for Cross-Domain Recommendation
read the original abstract
Cross-domain recommendation systems face the challenge of integrating fine-grained user and item relationships across various product domains. To address this, we introduce RankGraph, a scalable graph learning framework designed to serve as a core component in recommendation foundation models (FMs). By constructing and leveraging graphs composed of heterogeneous nodes and edges across multiple products, RankGraph enables the integration of complex relationships between users, posts, ads, and other entities. Our framework employs a GPU-accelerated Graph Neural Network and contrastive learning, allowing for dynamic extraction of subgraphs such as item-item and user-user graphs to support similarity-based retrieval and real-time clustering. Furthermore, RankGraph integrates graph-based pretrained representations as contextual tokens into FM sequence models, enriching them with structured relational knowledge. RankGraph has demonstrated improvements in click (+0.92%) and conversion rates (+2.82%) in online A/B tests, showcasing its effectiveness in cross-domain recommendation scenarios.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
RankGraph-2: Lifecycle Co-Design for Billion-Node Graph Learning in Recommendation
RankGraph-2 jointly optimizes graph subsampling, pre-computed neighborhoods, and a co-learned cluster index for billion-node recommendation retrieval, reporting 3.8x recall gains and up to +0.96% CTR.
-
RankGraph-2: Lifecycle Co-Design for Billion-Node Graph Learning in Recommendation
RankGraph-2 jointly optimizes graph construction, training, and serving for billion-node recommendation retrieval, reporting 3.8x recall gains and CTR/CVR improvements via subsampling, pre-computed neighborhoods, and ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.