动态调整奖励函数,让推荐系统更准更稳。
DARLR: Dual-Agent Offline Reinforcement Learning for Recommender Systems with Dynamic Reward
- 双代理机制:选用户+推推荐,动态优化奖励估计
- 在4个数据集上超越现有方法,显著提升推荐效果
- 适合做离线强化学习推荐的开发者和研究者
基于模型的离线强化学习在推荐系统中展现出巨大潜力,通过与冻结的世界模型交互实现有效策略学习。然而,这些世界模型中的奖励函数由稀疏离线日志训练,常存在不准确问题。现有方法面临两大局限:(1)将奖励函数当作静态查表使用,导致错误在策略学习中传播;(2)不确定性设计固定,无法有效捕捉决策风险并缓解误差影响。本文提出双代理框架DARLR,通过引入选择器识别兼顾相似性与多样性的参考用户,使推荐器聚合其信息,迭代优化奖励估计,实现动态奖励塑造。同时,所选用户的统计特征用于动态调节不确定性惩罚,更好适应推荐需求变化。在四个基准数据集上的大量实验验证了DARLR的优越性能。代码已开源。
原文摘要 · Abstract (English)
Model-based offline reinforcement learning (RL) has emerged as a promising approach for recommender systems, enabling effective policy learning by interacting with frozen world models. However, the reward functions in these world models, trained on sparse offline logs, often suffer from inaccuracies. Specifically, existing methods face two major limitations in addressing this challenge: (1) deterministic use of reward functions as static look-up tables, which propagates inaccuracies during policy learning, and (2) static uncertainty designs that fail to effectively capture decision risks and mitigate the impact of these inaccuracies. In this work, a dual-agent framework, DARLR, is proposed to dynamically update world models to enhance recommendation policies. To achieve this, a \textbf{\textit{selector}} is introduced to identify reference users by balancing similarity and diversity so that the \textbf{\textit{recommender}} can aggregate information from these users and iteratively refine reward estimations for dynamic reward shaping. Further, the statistical features of the selected users guide the dynamic adaptation of an uncertainty penalty to better align with evolving recommendation requirements. Extensive experiments on four benchmark datasets demonstrate the superior performance of DARLR, validating its effectiveness. The code is available at https://github.com/ArronDZhang/DARLR.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。