LightSAGE: Graph Neural Networks for Large Scale Item Retrieval in Shopee's Advertisement Recommendation

• URL: http://arxiv.org/abs/2310.19394v1
• Date: Mon, 30 Oct 2023 09:57:06 GMT
• Title: LightSAGE: Graph Neural Networks for Large Scale Item Retrieval in Shopee's Advertisement Recommendation
• Authors: Dang Minh Nguyen, Chenfei Wang, Yan Shen, Yifan Zeng
• Abstract summary: We introduce our simple yet novel and impactful techniques in graph construction, modeling, and handling data skewness. We construct high-quality item graphs by combining strong-signal user behaviors with high-precision collaborative filtering (CF) algorithm. We then develop a new GNN architecture named LightSAGE to produce high-quality items' embeddings for vector search.
• Score: 2.1165011830664677
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Graph Neural Network (GNN) is the trending solution for item retrieval in recommendation problems. Most recent reports, however, focus heavily on new model architectures. This may bring some gaps when applying GNN in the industrial setup, where, besides the model, constructing the graph and handling data sparsity also play critical roles in the overall success of the project. In this work, we report how GNN is applied for large-scale e-commerce item retrieval at Shopee. We introduce our simple yet novel and impactful techniques in graph construction, modeling, and handling data skewness. Specifically, we construct high-quality item graphs by combining strong-signal user behaviors with high-precision collaborative filtering (CF) algorithm. We then develop a new GNN architecture named LightSAGE to produce high-quality items' embeddings for vector search. Finally, we design multiple strategies to handle cold-start and long-tail items, which are critical in an advertisement (ads) system. Our models bring improvement in offline evaluations, online A/B tests, and are deployed to the main traffic of Shopee's Recommendation Advertisement system.

Related papers

• TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning [7.879217146851148]
  We propose an innovative Graph Neural Network (GNN) architecture that integrates a Top-m attention mechanism aggregation component and a neighborhood aggregation component. To assess the effectiveness of our proposed model, we have applied it to citation sentiment prediction, a novel task previously unexplored in the GNN field.
  arXiv  Detail & Related papers  (2024-11-23T05:31:25Z)
• Towards Graph Foundation Models for Personalization [9.405827216171629]
  We present a graph-based foundation modeling approach tailored to personalization. Our approach has been rigorously tested and proven effective in delivering recommendations across a diverse array of products.
  arXiv  Detail & Related papers  (2024-03-12T10:12:59Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking [124.21408098724551]
  Large-scale graph training is a notoriously challenging problem for graph neural networks (GNNs) We present a new ensembling training manner, named EnGCN, to address the existing issues. Our proposed method has achieved new state-of-the-art (SOTA) performance on large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-14T03:43:05Z)
• An Empirical Study of Retrieval-enhanced Graph Neural Networks [48.99347386689936]
  Graph Neural Networks (GNNs) are effective tools for graph representation learning. We propose a retrieval-enhanced scheme called GRAPHRETRIEVAL, which is agnostic to the choice of graph neural network models. We conduct comprehensive experiments over 13 datasets, and we observe that GRAPHRETRIEVAL is able to reach substantial improvements over existing GNNs.
  arXiv  Detail & Related papers  (2022-06-01T09:59:09Z)
• Automatic Relation-aware Graph Network Proliferation [182.30735195376792]
  We propose Automatic Relation-aware Graph Network Proliferation (ARGNP) for efficiently searching GNNs. These operations can extract hierarchical node/relational information and provide anisotropic guidance for message passing on a graph. Experiments on six datasets for four graph learning tasks demonstrate that GNNs produced by our method are superior to the current state-of-the-art hand-crafted and search-based GNNs.
  arXiv  Detail & Related papers  (2022-05-31T10:38:04Z)
• Attention-Based Recommendation On Graphs [9.558392439655012]
  Graph Neural Networks (GNN) have shown remarkable performance in different tasks. In this study, we propose GARec as a model-based recommender system. The presented method outperforms existing model-based, non-graph neural networks and graph neural networks in different MovieLens datasets.
  arXiv  Detail & Related papers  (2022-01-04T21:02:02Z)
• Edge-featured Graph Neural Architecture Search [131.4361207769865]
  We propose Edge-featured Graph Neural Architecture Search to find the optimal GNN architecture. Specifically, we design rich entity and edge updating operations to learn high-order representations. We show EGNAS can search better GNNs with higher performance than current state-of-the-art human-designed and searched-based GNNs.
  arXiv  Detail & Related papers  (2021-09-03T07:53:18Z)
• Graph Neural Networks for Inconsistent Cluster Detection in Incremental Entity Resolution [3.4806267677524896]
  In mature data repositories, the relationships may be mostly correct but require incremental improvements owing to errors in the original data or in the entity resolution system. This paper proposes a novel method for identifying inconsistent clusters (IC), existing groups of related products that do not belong together. We demonstrate that existing Message Passing neural networks perform well at this task, exceeding traditional graph processing techniques.
  arXiv  Detail & Related papers  (2021-05-12T20:39:22Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)
• GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systems [47.51104205511256]
  We develop a Graph Structure Aware Incremental Learning framework, GraphSAIL, to address the commonly experienced catastrophic forgetting problem. Our approach preserves a user's long-term preference (or an item's long-term property) during incremental model updating.
  arXiv  Detail & Related papers  (2020-08-25T04:33:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.