mlsanityData to 7 Oct 2026

ResAct: Reinforcing Long-term Engagement in Sequential Recommendation with Residual Actor

arXiv 2206.02620 ↗First posted 1 Jun 2022cs.IR cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Long-term engagement is preferred over immediate engagement in sequential recommendation as it directly affects product operational metrics such as daily active users (DAUs) and dwell time. Meanwhile, reinforcement learning (RL) is widely regarded as a promising framework for optimizing long-term engagement in sequential recommendation. However, due to expensive online interactions, it is very difficult for RL algorithms to perform state-action value estimation, exploration and feature extraction when optimizing long-term engagement. In this paper, we propose ResAct which seeks a policy that is close to, but better than, the online-serving policy. In this way, we can collect sufficient data near the learned policy so that state-action values can be properly estimated, and there is no need to perform online exploration. ResAct optimizes the policy by first reconstructing the online behaviors and then improving it via a Residual Actor. To extract long-term information, ResAct utilizes two information-theoretical regularizers to confirm the expressiveness and conciseness of features. We conduct experiments on a benchmark dataset and a large-scale industrial dataset which consists of tens of millions of recommendation requests. Experimental results show that our method significantly outperforms the state-of-the-art baselines in various long-term engagement optimization tasks.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 25 of its 46 references that are in the map. First posted on arXiv 1 Jun 2022.

Builds on

25 of 46 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2013Auto-Encoding Variational Bayescited by 3,980
  3. 2015Continuous control with deep reinforcement learningcited by 3,279
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,327
  6. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  7. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  8. 2017Constrained Policy Optimizationcited by 928
  9. 2016Deep Variational Information Bottleneckcited by 915
  10. 2021A Minimalist Approach to Offline Reinforcement Learningcited by 882
  11. 2015End-to-End Training of Deep Visuomotor Policiescited by 847
  12. 2020Deep Reinforcement Learning for Autonomous Driving: A Surveycited by 698
13 more
  1. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  2. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  3. 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
  4. 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 158
  5. 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
  6. 2019Sequential Recommender Systems: Challenges, Progress and Prospectscited by 115
  7. 2018Offline A/B testing for Recommender Systemscited by 94
  8. 2019Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systemscited by 90
  9. 2019Learning Action Representations for Reinforcement Learningcited by 75
  10. 2018Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learningcited by 71
  11. 2020Jointly Learning to Recommend and Advertisecited by 27
  12. 2018Adaptive, Personalized Diversity for Visual Discoverycited by 8
  13. 2020Maximizing Cumulative User Engagement in Sequential Recommendation: An Online Optimization Perspectivecited by 8

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 5; 2024: 2; 2025: 2.

10 papers.