Edge-compatible Reinforcement Learning For Recommendations

Abstract

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 \citep\{kostas2020asynchronous\} 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

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keykostas2021edge

Related papers

• Fully Asynchronous Policy Evaluation In Distributed Reinforcement Learning Over Networks (2020)9.03
• Federated Reinforcement Learning At The Edge (2021)0.00
• Model-enhanced Contrastive Reinforcement Learning For Sequential Recommendation (2023)0.00
• Asynchronous Policy Gradient Aggregation For Efficient Distributed Reinforcement Learning (2025)0.00
• Ubiquitous Distributed Deep Reinforcement Learning At The Edge: Analyzing Byzantine Agents In Discrete Action Spaces (2020)0.00
• Edgerl: Reinforcement Learning-driven Deep Learning Model Inference Optimization At Edge (2024)0.00
• Communication-efficient Policy Gradient Methods For Distributed Reinforcement Learning (2018)13.05
• Federated Ensemble Model-based Reinforcement Learning In Edge Computing (2021)11.58