NLGR: Utilizing Neighbor Lists for Generative Rerank in Personalized Recommendation Systems

• URL: http://arxiv.org/abs/2502.06097v2
• Date: Tue, 11 Feb 2025 14:44:47 GMT
• Title: NLGR: Utilizing Neighbor Lists for Generative Rerank in Personalized Recommendation Systems
• Authors: Shuli Wang, Xue Wei, Senjie Kou, Chi Wang, Wenshuai Chen, Qi Tang, Yinhua Zhu, Xiong Xiao, Xingxing Wang,
• Abstract summary: Neighbor Lists model for Generative Reranking aims to improve the performance of the generator in the space. We propose a novel sampling-based non-autoregressive generation method, which allows the generator to jump flexibly from the current list to any neighbor list. Experiments on public and industrial datasets validate NLGR's effectiveness and we have successfully deployed NLGR on the Meituan food delivery platform.
• Score: 13.848284819312953
• License:
• Abstract: Reranking plays a crucial role in modern multi-stage recommender systems by rearranging the initial ranking list. Due to the inherent challenges of combinatorial search spaces, some current research adopts an evaluator-generator paradigm, with a generator generating feasible sequences and an evaluator selecting the best sequence based on the estimated list utility. However, these methods still face two issues. Firstly, due to the goal inconsistency problem between the evaluator and generator, the generator tends to fit the local optimal solution of exposure distribution rather than combinatorial space optimization. Secondly, the strategy of generating target items one by one is difficult to achieve optimality because it ignores the information of subsequent items. To address these issues, we propose a utilizing Neighbor Lists model for Generative Reranking (NLGR), which aims to improve the performance of the generator in the combinatorial space. NLGR follows the evaluator-generator paradigm and improves the generator's training and generating methods. Specifically, we use neighbor lists in combination space to enhance the training process, making the generator perceive the relative scores and find the optimization direction. Furthermore, we propose a novel sampling-based non-autoregressive generation method, which allows the generator to jump flexibly from the current list to any neighbor list. Extensive experiments on public and industrial datasets validate NLGR's effectiveness and we have successfully deployed NLGR on the Meituan food delivery platform.

Related papers

• End-to-End Learnable Item Tokenization for Generative Recommendation [51.82768744368208]
  We propose ETEGRec, a novel End-To-End Generative Recommender by seamlessly integrating item tokenization and generative recommendation. Our framework is developed based on the dual encoder-decoder architecture, which consists of an item tokenizer and a generative recommender.
  arXiv  Detail & Related papers  (2024-09-09T12:11:53Z)
• Non-autoregressive Generative Models for Reranking Recommendation [9.854541524740549]
  In a recommendation system, reranking plays a crucial role by modeling the intra-list correlations among items. We propose a Non-AutoRegressive generative model for reranking Recommendation (NAR4Rec) designed to enhance efficiency and effectiveness. NAR4Rec has been fully deployed in a popular video app Kuaishou with over 300 million daily active users.
  arXiv  Detail & Related papers  (2024-02-10T03:21:13Z)
• GANs Settle Scores! [16.317645727944466]
  We propose a unified approach to analyzing the generator optimization through variational approach. In $f$-divergence-minimizing GANs, we show that the optimal generator is the one that matches the score of its output distribution with that of the data distribution. We propose novel alternatives to $f$-GAN and IPM-GAN training based on score and flow matching, and discriminator-guided Langevin sampling.
  arXiv  Detail & Related papers  (2023-06-02T16:24:07Z)
• MGR: Multi-generator Based Rationalization [14.745836934156427]
  Rationalization is to employ a generator and a predictor to construct a self-explaining NLP model. In this paper, we propose a simple yet effective method named MGR to simultaneously solve the two problems. We show that MGR improves the F1 score by up to 20.9% as compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-08T06:36:46Z)
• Joint Generator-Ranker Learning for Natural Language Generation [99.16268050116717]
  JGR is a novel joint training algorithm that integrates the generator and the ranker in a single framework. By iteratively updating the generator and the ranker, JGR can effectively harmonize their learning and enhance their quality jointly.
  arXiv  Detail & Related papers  (2022-06-28T12:58:30Z)
• An Evaluation Study of Generative Adversarial Networks for Collaborative Filtering [75.83628561622287]
  This work successfully replicates the results published in the original paper and discusses the impact of certain differences between the CFGAN framework and the model used in the original evaluation. The work further expands the experimental analysis comparing CFGAN against a selection of simple and well-known properly optimized baselines, observing that CFGAN is not consistently competitive against them despite its high computational cost.
  arXiv  Detail & Related papers  (2022-01-05T20:53:27Z)
• Highly Parallel Autoregressive Entity Linking with Discriminative Correction [51.947280241185]
  We propose a very efficient approach that parallelizes autoregressive linking across all potential mentions. Our model is >70 times faster and more accurate than the previous generative method.
  arXiv  Detail & Related papers  (2021-09-08T17:28:26Z)
• Sampling-Decomposable Generative Adversarial Recommender [84.05894139540048]
  We propose a Sampling-Decomposable Generative Adversarial Recommender (SD-GAR) In the framework, the divergence between some generator and the optimum is compensated by self-normalized importance sampling. We extensively evaluate the proposed algorithm with five real-world recommendation datasets.
  arXiv  Detail & Related papers  (2020-11-02T13:19:10Z)
• Sequential Recommendation with Self-Attentive Multi-Adversarial Network [101.25533520688654]
  We present a Multi-Factor Generative Adversarial Network (MFGAN) for explicitly modeling the effect of context information on sequential recommendation. Our framework is flexible to incorporate multiple kinds of factor information, and is able to trace how each factor contributes to the recommendation decision over time.
  arXiv  Detail & Related papers  (2020-05-21T12:28:59Z)
• Improving GANs for Speech Enhancement [19.836041050328102]
  We propose to use multiple generators chained to perform multi-stage enhancement mapping. We demonstrate that the proposed multi-stage enhancement approach outperforms the one-stage SEGAN baseline.
  arXiv  Detail & Related papers  (2020-01-15T19:57:03Z)

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.