Top-K Off-Policy Correction for a REINFORCE Recommender System
arXiv:1812.02353
Abstract
Industrial recommender systems deal with extremely large action spaces -- many millions of items to recommend. Moreover, they need to serve billions of users, who are unique at any point in time, making a complex user state space. Luckily, huge quantities of logged implicit feedback (e.g., user clicks, dwell time) are available for learning. Learning from the logged feedback is however subject to biases caused by only observing feedback on recommendations selected by the previous versions of the recommender. In this work, we present a general recipe of addressing such biases in a production top-K recommender system at Youtube, built with a policy-gradient-based algorithm, i.e. REINFORCE. The contributions of the paper are: (1) scaling REINFORCE to a production recommender system with an action space on the orders of millions; (2) applying off-policy correction to address data biases in learning from logged feedback collected from multiple behavior policies; (3) proposing a novel top-K off-policy correction to account for our policy recommending multiple items at a time; (4) showcasing the value of exploration. We demonstrate the efficacy of our approaches through a series of simulations and multiple live experiments on Youtube.
References in corpus (10)
- Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
- Playing Atari with Deep Reinforcement Learning
- Trust Region Policy Optimization
- Session-based Recommendations with Recurrent Neural Networks
- Deep Reinforcement Learning for Page-wise Recommendations
- Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
- Constrained Policy Optimization
- Learning from Logged Implicit Exploration Data
- Quantization based Fast Inner Product Search
- A recurrent neural network without chaos