Gpu-accelerated Multi-relational Parallel Graph Retrieval For Web-scale Recommendations

Abstract

Web recommendations provide personalized items from massive catalogs for users, which rely heavily on retrieval stages to trade off the effectiveness and efficiency of selecting a small relevant set from billion-scale candidates in online digital platforms. As one of the largest Chinese search engine and news feed providers, Baidu resorts to Deep Neural Network (DNN) and graph-based Approximate Nearest Neighbor Search (ANNS) algorithms for accurate relevance estimation and efficient search for relevant items. However, current retrieval at Baidu fails in comprehensive user-item relational understanding due to dissected interaction modeling, and performs inefficiently in large-scale graph-based ANNS because of suboptimal traversal navigation and the GPU computational bottleneck under high concurrency. To this end, we propose a GPU-accelerated Multi-relational Parallel Graph Retrieval (GMP-GR) framework to achieve effective yet efficient retrieval in web-scale recommendations. First, we p

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyguo2025gpu

Related papers

• Hierarchical Structured Neural Network: Efficient Retrieval Scaling For Large Scale Recommendation (2024)0.00
• Deep Retrieval: Learning A Retrievable Structure For Large-scale Recommendations (2020)0.00
• CAGRA: Highly Parallel Graph Construction And Approximate Nearest Neighbor Search For Gpus (2023)12.17
• Rankgraph: Unified Heterogeneous Graph Learning For Cross-domain Recommendation (2025)3.58
• An Efficient Embedding Based Ad Retrieval With Gpu-powered Feature Interaction (2025)0.00
• Lightsage: Graph Neural Networks For Large Scale Item Retrieval In Shopee's Advertisement Recommendation (2023)6.77
• GUITAR: Gradient Pruning Toward Fast Neural Ranking (2023)2.26
• A Real-time Adaptive Multi-stream GPU System For Online Approximate Nearest Neighborhood Search (2024)5.84