用强化学习优化推荐系统缓存分配,提升用户参与度。
RPAF: A Reinforcement Prediction-Allocation Framework for Cache Allocation in Large-Scale Recommender Systems
- 两阶段强化学习框架,预测缓存价值并动态分配
- 在计算预算约束下,用户参与度显著提升
- 适合大规模推荐系统资源调度场景
现代推荐系统依赖高计算强度的基础设施,受限于计算资源,在高峰时段难以对每个请求进行实时计算。当系统无法承担实时推荐时,常采用基于用户的推荐结果缓存。然而,如何在实时推荐与缓存推荐之间合理分配以最大化用户整体参与度仍具挑战。本文指出缓存分配面临两大难题:价值-策略依赖性与流式分配问题。为此,提出基于强化学习的预测-分配框架(RPAF),包含预测与分配两个阶段。预测阶段考虑价值-策略依赖性,估计不同缓存选择的价值;分配阶段为每个请求确定缓存选择,同时满足全局预算约束。实验表明,RPAF在计算预算限制下显著提升了用户参与度。
原文摘要 · Abstract (English)
Modern recommender systems are built upon computation-intensive infrastructure, and it is challenging to perform real-time computation for each request, especially in peak periods, due to the limited computational resources. Recommending by user-wise result caches is widely used when the system cannot afford a real-time recommendation. However, it is challenging to allocate real-time and cached recommendations to maximize the users' overall engagement. This paper shows two key challenges to cache allocation, i.e., the value-strategy dependency and the streaming allocation. Then, we propose a reinforcement prediction-allocation framework (RPAF) to address these issues. RPAF is a reinforcement-learning-based two-stage framework containing prediction and allocation stages. The prediction stage estimates the values of the cache choices considering the value-strategy dependency, and the allocation stage determines the cache choices for each individual request while satisfying the global budget constraint. We show that the challenge of training RPAF includes globality and the strictness of budget constraints, and a relaxed local allocator (RLA) is proposed to address this issue. Moreover, a PoolRank algorithm is used in the allocation stage to deal with the streaming allocation problem. Experiments show that RPAF significantly improves users' engagement under computational budget constraints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。