JDRec: Practical Actor-Critic Framework for Online Combinatorial
Recommender System
- URL: http://arxiv.org/abs/2207.13311v1
- Date: Wed, 27 Jul 2022 05:47:12 GMT
- Title: JDRec: Practical Actor-Critic Framework for Online Combinatorial
Recommender System
- Authors: Xin Zhao (1), Zhiwei Fang (1), Yuchen Guo (2), Jie He (1), Wenlong
Chen (1), Changping Peng (1) ((1) JD.com, (2) Tsinghua University)
- Abstract summary: A recommender (CR) system feeds a list of items to a user at a time in the result page, in which the user behavior is affected by both contextual information and items.
Despite its importance, it is still a challenge to build a practical CR system, due to the efficiency, dynamics, personalization requirement in online environment.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A combinatorial recommender (CR) system feeds a list of items to a user at a
time in the result page, in which the user behavior is affected by both
contextual information and items. The CR is formulated as a combinatorial
optimization problem with the objective of maximizing the recommendation reward
of the whole list. Despite its importance, it is still a challenge to build a
practical CR system, due to the efficiency, dynamics, personalization
requirement in online environment. In particular, we tear the problem into two
sub-problems, list generation and list evaluation. Novel and practical model
architectures are designed for these sub-problems aiming at jointly optimizing
effectiveness and efficiency. In order to adapt to online case, a bootstrap
algorithm forming an actor-critic reinforcement framework is given to explore
better recommendation mode in long-term user interaction. Offline and online
experiment results demonstrate the efficacy of proposed JDRec framework. JDRec
has been applied in online JD recommendation, improving click through rate by
2.6% and synthetical value for the platform by 5.03%. We will publish the
large-scale dataset used in this study to contribute to the research community.
Related papers
- A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems [67.52782366565658]
State-of-the-art recommender systems (RSs) depend on categorical features, which ecoded by embedding vectors, resulting in excessively large embedding tables.
Despite the prosperity of lightweight embedding-based RSs, a wide diversity is seen in evaluation protocols.
This study investigates various LERS' performance, efficiency, and cross-task transferability via a thorough benchmarking process.
arXiv Detail & Related papers (2024-06-25T07:45:00Z) - EASRec: Elastic Architecture Search for Efficient Long-term Sequential
Recommender Systems [82.76483989905961]
Current Sequential Recommender Systems (SRSs) suffer from computational and resource inefficiencies.
We develop the Elastic Architecture Search for Efficient Long-term Sequential Recommender Systems (EASRec)
EASRec introduces data-aware gates that leverage historical information from input data batch to improve the performance of the recommendation network.
arXiv Detail & Related papers (2024-02-01T07:22:52Z) - Beyond Two-Tower Matching: Learning Sparse Retrievable
Cross-Interactions for Recommendation [80.19762472699814]
Two-tower models are a prevalent matching framework for recommendation, which have been widely deployed in industrial applications.
It suffers two main challenges, including limited feature interaction capability and reduced accuracy in online serving.
We propose a new matching paradigm named SparCode, which supports not only sophisticated feature interactions but also efficient retrieval.
arXiv Detail & Related papers (2023-11-30T03:13:36Z) - Recommendation Unlearning via Matrix Correction [17.457533987238975]
We propose an Interaction and Mapping Matrices Correction (IMCorrect) method for recommendation unlearning.
We show that IMCorrect is superior in completeness, utility, and efficiency, and is applicable in many recommendation unlearning scenarios.
arXiv Detail & Related papers (2023-07-29T11:36:38Z) - Broad Recommender System: An Efficient Nonlinear Collaborative Filtering
Approach [56.12815715932561]
We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF)
Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items.
Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
arXiv Detail & Related papers (2022-04-20T01:25:08Z) - Building an Efficient and Effective Retrieval-based Dialogue System via
Mutual Learning [27.04857039060308]
We propose to combine the best of both worlds to build a retrieval system.
We employ a fast bi-encoder to replace the traditional feature-based pre-retrieval model.
We train the pre-retrieval model and the re-ranking model at the same time via mutual learning.
arXiv Detail & Related papers (2021-10-01T01:32:33Z) - Leveraging Historical Interaction Data for Improving Conversational
Recommender System [105.90963882850265]
We propose a novel pre-training approach to integrate item- and attribute-based preference sequence.
Experiment results on two real-world datasets have demonstrated the effectiveness of our approach.
arXiv Detail & Related papers (2020-08-19T03:43:50Z) - Self-Supervised Reinforcement Learning for Recommender Systems [77.38665506495553]
We propose self-supervised reinforcement learning for sequential recommendation tasks.
Our approach augments standard recommendation models with two output layers: one for self-supervised learning and the other for RL.
Based on such an approach, we propose two frameworks namely Self-Supervised Q-learning(SQN) and Self-Supervised Actor-Critic(SAC)
arXiv Detail & Related papers (2020-06-10T11:18:57Z) - A Text-based Deep Reinforcement Learning Framework for Interactive
Recommendation [15.723042747172688]
We propose a Text-based Deep Deterministic Policy Gradient framework (TDDPG-Rec) for interactive recommender systems (IRSs)
Specifically, we leverage textual information to map items and users into a feature space, which greatly alleviates the sparsity problem.
We show that TDDPG-Rec achieves state-of-the-art performance over several baselines in a time-efficient manner.
arXiv Detail & Related papers (2020-04-14T16:46:01Z) - RNE: A Scalable Network Embedding for Billion-scale Recommendation [21.6366085346674]
We propose RNE, a data-efficient Recommendation-based Network Embedding method, to give personalized and diverse items to users.
On the one hand, the method is able to preserve the local structure between the users and items while modeling the diversity and dynamic property of the user interest to boost the recommendation quality.
We deploy RNE on a recommendation scenario of Taobao, the largest E-commerce platform in China, and train it on a billion-scale user-item graph.
arXiv Detail & Related papers (2020-03-10T07:08:57Z)
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.