Improving Long-Term Metrics in Recommendation Systems using Short-Horizon Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
We study session-based recommendation scenarios where we want to recommend items to users during sequential interactions to improve their long-term utility. Optimizing a long-term metric is challenging because the learning signal (whether the recommendations achieved their desired goals) is delayed and confounded by other user interactions with the system. Targeting immediately measurable proxies such as clicks can lead to suboptimal recommendations due to misalignment with the long-term metric. We develop a new reinforcement learning algorithm called Short Horizon Policy Improvement (SHPI) that approximates policy-induced drift in user behavior across sessions. SHPI is a straightforward modification of episodic RL algorithms for session-based recommendation, that additionally gives an appropriate termination bonus in each session. Empirical results on four recommendation tasks show that SHPI can outperform state-of-the-art recommendation techniques like matrix factorization with offline proxy signals, bandits with myopic online proxies, and RL baselines with limited amounts of user interaction.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 42 references that are in the map. First posted on arXiv 1 Jun 2021.
Builds on
20 of 42 references.
References · 20
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2015Trust Region Policy Optimizationcited by 2,580
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,809
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
- 2019DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Correctionscited by 254
- 2017Neural Attentive Session-based Recommendationcited by 237
- 2017Safe Policy Improvement with Baseline Bootstrappingcited by 144
- 2015Sample Complexity of Episodic Fixed-Horizon Reinforcement Learningcited by 106
- 2020Provably Good Batch Reinforcement Learning Without Great Explorationcited by 77
- 2019Personalized HeartSteps: A Reinforcement Learning Algorithm for Optimizing Physical Activitycited by 70
- 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
8 more
- 2021Near-Optimal Offline Reinforcement Learning via Double Variance Reductioncited by 56
- 2018Truncated Horizon Policy Search: Combining Reinforcement Learning & Imitation Learningcited by 39
- 2020Adaptive Estimator Selection for Off-Policy Evaluationcited by 38
- 2018Evaluation of Session-based Recommendation Algorithmscited by 37
- 2018Policy Gradients for Contextual Recommendationscited by 21
- 2018Representation Balancing MDPs for Off-Policy Policy Evaluationcited by 20
- 2019Separating value functions across time-scalescited by 15
- 2020Batch-Constrained Distributional Reinforcement Learning for Session-based Recommendationcited by 4
Built on by
Citing papers per year: 2022: 2.
2 papers.