Supervised Advantage Actor-Critic for Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Casting session-based or sequential recommendation as reinforcement learning (RL) through reward signals is a promising research direction towards recommender systems (RS) that maximize cumulative profits. However, the direct use of RL algorithms in the RS setting is impractical due to challenges like off-policy training, huge action spaces and lack of sufficient reward signals. Recent RL approaches for RS attempt to tackle these challenges by combining RL and (self-)supervised sequential learning, but still suffer from certain limitations. For example, the estimation of Q-values tends to be biased toward positive values due to the lack of negative reward signals. Moreover, the Q-values also depend heavily on the specific timestamp of a sequence. To address the above problems, we propose negative sampling strategy for training the RL component and combine it with supervised sequential learning. We call this method Supervised Negative Q-learning (SNQN). Based on sampled (negative) actions (items), we can calculate the "advantage" of a positive action over the average case, which can be further utilized as a normalized weight for learning the supervised sequential part. This leads to another learning framework: Supervised Advantage Actor-Critic (SA2C). We instantiate SNQN and SA2C with four state-of-the-art sequential recommendation models and conduct experiments on two real-world datasets. Experimental results show that the proposed approaches achieve significantly better performance than state-of-the-art supervised methods and existing self-supervised RL methods . Code will be open-sourced.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 26 of its 49 references that are in the map. First posted on arXiv 5 Nov 2021.
Builds on
26 of 49 references.
References · 26
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
- 2018Self-Attentive Sequential Recommendationcited by 1,169
- 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 745
- 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
- 2018Behavioral Cloning from Observationcited by 482
- 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
- 2019Stabilizing Transformers for Reinforcement Learningcited by 262
- 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
14 more
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
- 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
- 2018A Simple Convolutional Generative Network for Next Item Recommendationcited by 120
- 2019Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systemscited by 90
- 2018Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learningcited by 80
- 2018Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learningcited by 71
- 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
- 2018Generative Adversarial User Model for Reinforcement Learning Based Recommendation Systemcited by 64
- 2016Model-Free Imitation Learning with Policy Optimizationcited by 52
- 2020Self-Supervised Reinforcement Learning for Recommender Systemscited by 49
- 2018Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Applicationcited by 33
- 2019Environment Reconstruction with Hidden Confounders for Reinforcement Learning based Recommendationcited by 16
- 2019Exact-K Recommendation via Maximal Clique Optimizationcited by 14
- 2014General factorization framework for context-aware recommendationscited by 5
Built on by
Citing papers per year: 2022: 3; 2023: 4; 2024: 0; 2025: 1.
8 papers.
- 2025Rec-R1: Bridging Generative Large Language Models and User-Centric Recommendation Systems via Reinforcement Learningcited by 32
- 2023Two-Stage Constrained Actor-Critic for Short Video Recommendationcited by 16
- 2022Local Policy Improvement for Recommender Systemscited by 8
- 2022A Survey on Explainable Reinforcement Learning: Concepts, Algorithms, Challengescited by 3
- 2022Examining Policy Entropy of Reinforcement Learning Agents for Personalization Taskscited by 3
- 2023Model-enhanced Contrastive Reinforcement Learning for Sequential Recommendationcited by 1
- 2023Recommender Systems: A Primercited by 0
- 2023Robust Reinforcement Learning Objectives for Sequential Recommender Systemscited by 0
- 2025Rec-R1: Bridging Generative Large Language Models and User-Centric Recommendation Systems via Reinforcement Learning31 Mar 2025
- 2023Model-enhanced Contrastive Reinforcement Learning for Sequential Recommendation25 Oct 2023
- 2023Robust Reinforcement Learning Objectives for Sequential Recommender Systems30 May 2023
- 2023Recommender Systems: A Primer6 Feb 2023
- 2023Two-Stage Constrained Actor-Critic for Short Video Recommendation3 Feb 2023
- 2022Local Policy Improvement for Recommender Systems22 Dec 2022
- 2022Examining Policy Entropy of Reinforcement Learning Agents for Personalization Tasks21 Nov 2022
- 2022A Survey on Explainable Reinforcement Learning: Concepts, Algorithms, Challenges12 Nov 2022