Edge-Compatible Reinforcement Learning for Recommendations
Not on the map. Why?
Abstract (arXiv)
Most reinforcement learning (RL) recommendation systems designed for edge computing must either synchronize during recommendation selection or depend on an unprincipled patchwork collection of algorithms. In this work, we build on asynchronous coagent policy gradient algorithms citepkostas2020asynchronous to propose a principled solution to this problem. The class of algorithms that we propose can be distributed over the internet and run asynchronously and in real-time. When a given edge fails to respond to a request for data with sufficient speed, this is not a problem; the algorithm is designed to function and learn in the edge setting, and network issues are part of this setting. The result is a principled, theoretically grounded RL algorithm designed to be distributed in and learn in this asynchronous environment. In this work, we describe this algorithm and a proposed class of architectures in detail, and demonstrate that they work well in practice in the asynchronous setting, even as the network quality degrades.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 10 Dec 2021.
Builds on
11 of 19 references.
References · 11
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 182
- 2016Off-policy evaluation for slate recommendationcited by 103
- 2018Deep Reinforcement Learning for Page-wise Recommendationscited by 100
- 2021Federated Reinforcement Learning: Techniques, Applications, and Open Challengescited by 81
- 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
- 2018Seq2Slate: Re-ranking and Slate Optimization with RNNscited by 39
- 2018Beyond Greedy Ranking: Slate Optimization via List-CVAEcited by 21
- 2018Reinforcement Learning based Recommender System using Biclustering Techniquecited by 12
- 2020Reinforcement Learning for Strategic Recommendationscited by 8
- 2020Algorithms for slate bandits with non-separable reward functionscited by 6
- 2019Asynchronous Coagent Networkscited by 4
Built on by
Not cited yet.