mlsanityData to 14 Oct 2026

AURO: Reinforcement Learning for Adaptive User Retention Optimization in Recommender Systems

arXiv 2310.03984 ↗First posted 6 Oct 2023cs.IR cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

The field of Reinforcement Learning (RL) has garnered increasing attention for its ability of optimizing user retention in recommender systems. A primary obstacle in this optimization process is the environment non-stationarity stemming from the continual and complex evolution of user behavior patterns over time, such as variations in interaction rates and retention propensities. These changes pose significant challenges to existing RL algorithms for recommendations, leading to issues with dynamics and reward distribution shifts. This paper introduces a novel approach called Adaptive User Retention Optimization (AURO) to address this challenge. To navigate the recommendation policy in non-stationary environments, AURO introduces an state abstraction module in the policy network. The module is trained with a new value-based loss function, aligning its output with the estimated performance of the current policy. As the policy performance of RL is sensitive to environment drifts, the loss function enables the state abstraction to be reflective of environment changes and notify the recommendation policy to adapt accordingly. Additionally, the non-stationarity of the environment introduces the problem of implicit cold start, where the recommendation policy continuously interacts with users displaying novel behavior patterns. AURO encourages exploration guarded by performance-based rejection sampling to maintain a stable recommendation quality in the cost-sensitive online environment. Extensive empirical analysis are conducted in a user retention simulator, the MovieLens dataset, and a live short-video recommendation platform, demonstrating AURO's superior performance against all evaluated baseline algorithms.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 34 of its 56 references that are in the map. First posted on arXiv 6 Oct 2023.

Builds on

34 of 56 references.

References · 34

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2015Continuous control with deep reinforcement learningcited by 3,407
  3. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
  4. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
  5. 2018Exploration by Random Network Distillationcited by 993
  6. 2021A Minimalist Approach to Offline Reinforcement Learningcited by 899
  7. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
  8. 2020Learning Invariant Representations for Reinforcement Learning without Reconstructioncited by 436
  9. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 389
  10. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
  11. 2021MetaDrive: Composing Diverse Driving Scenarios for Generalizable Reinforcement Learningcited by 290
  12. 2019VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learningcited by 217
22 more
  1. 2021Reinforcement learning based recommender systems: A surveycited by 188
  2. 2020Context-aware Dynamics Model for Generalization in Model-Based Reinforcement Learningcited by 98
  3. 2019RecSim: A Configurable Simulation Platform for Recommender Systemscited by 94
  4. 2019Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systemscited by 90
  5. 2019Better Exploration with Optimistic Actor-Criticcited by 88
  6. 2018Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learningcited by 80
  7. 2020Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimismcited by 76
  8. 2013Hidden Parameter Markov Decision Processes: A Semiparametric Regression Approach for Discovering Latent Task Parametrizationscited by 70
  9. 2020Softmax Deep Double Deterministic Policy Gradientscited by 32
  10. 2018Large-scale Interactive Recommendation with Tree-structured Policy Gradientcited by 30
  11. 2022Factored Adaptation for Non-Stationary Reinforcement Learningcited by 30
  12. 2023KuaiSim: A Comprehensive Simulator for Recommender Systemscited by 30
  13. 2021Regret Minimization Experience Replay in Off-Policy Reinforcement Learningcited by 25
  14. 2023State Regularized Policy Optimization on Data with Dynamics Shiftcited by 23
  15. 2022Multi-Task Fusion via Reinforcement Learning for Long-Term User Satisfaction in Recommender Systemscited by 22
  16. 2023Generative Flow Network for Listwise Recommendationcited by 19
  17. 2023Exploration and Regularization of the Latent Action Space in Recommendationcited by 17
  18. 2023Two-Stage Constrained Actor-Critic for Short Video Recommendationcited by 16
  19. 2023Reinforcing User Retention in a Billion Scale Short Video Recommender Systemcited by 15
  20. 2022ResAct: Reinforcing Long-term Engagement in Sequential Recommendation with Residual Actorcited by 10
  21. 2021Reinforcement Learning to Optimize Lifetime Value in Cold-Start Recommendationcited by 9
  22. 2022Diversified Recommendations for Agents with Adaptive Preferencescited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.