mlsanityData to 7 Oct 2026

Supervised Advantage Actor-Critic for Recommender Systems

arXiv 2111.03474 ↗First posted 5 Nov 2021cs.LG cs.IRcited by 8

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

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  4. 2016Generative Adversarial Imitation Learningcited by 1,576
  5. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  6. 2018Self-Attentive Sequential Recommendationcited by 1,169
  7. 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 745
  8. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  9. 2018Behavioral Cloning from Observationcited by 482
  10. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  11. 2019Stabilizing Transformers for Reinforcement Learningcited by 262
  12. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
14 more
  1. 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
  2. 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
  3. 2018A Simple Convolutional Generative Network for Next Item Recommendationcited by 120
  4. 2019Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systemscited by 90
  5. 2018Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learningcited by 80
  6. 2018Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learningcited by 71
  7. 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
  8. 2018Generative Adversarial User Model for Reinforcement Learning Based Recommendation Systemcited by 64
  9. 2016Model-Free Imitation Learning with Policy Optimizationcited by 52
  10. 2020Self-Supervised Reinforcement Learning for Recommender Systemscited by 49
  11. 2018Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Applicationcited by 33
  12. 2019Environment Reconstruction with Hidden Confounders for Reinforcement Learning based Recommendationcited by 16
  13. 2019Exact-K Recommendation via Maximal Clique Optimizationcited by 14
  14. 2014General factorization framework for context-aware recommendationscited by 5

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 4; 2024: 0; 2025: 1.

8 papers.