用强化学习让大模型推荐系统灵活响应用户需求
FlexRec: Adapting LLM-based Recommenders for Flexible Needs via Reinforcement Learning
- 基于反事实交换设计细粒度奖励,精准指导排序优化
- 提升59%的NDCG@5和109.4%的Recall@5,显著优于传统方法
- 适合需要动态调整推荐策略的场景,如个性化导购
现代推荐系统需适应多变的、以需求为导向的目标,但多数传统系统仅针对单一静态目标优化,难以实时调整行为。近期基于强化学习的大模型后训练技术使大模型具备强指令遵循与推理能力,为对齐复杂推荐目标提供了新路径。本文研究封闭集自回归排序任务,即让大模型根据用户上下文和显式需求指令生成候选集的排列。然而,将强化学习应用于该场景面临两大挑战:(i) 序列级奖励导致信用分配粗略,无法提供精细训练信号;(ii) 交互反馈稀疏且噪声大,造成学习效率低且不稳定。为此,我们提出 FlexRec,一种后训练强化学习框架,通过(1)基于反事实交换的因果项级奖励机制,实现细粒度优化;(2)采用批评者引导的不确定性感知缩放,显式建模奖励不确定性并降低低置信度奖励权重,从而在稀疏监督下稳定学习。在多种推荐场景与目标下,FlexRec均取得显著提升:在需求特定排序中,NDCG@5最高提升59%,Recall@5最高提升109.4%;在泛化设置下,Recall@5最高提升24.1%,超越强基线传统推荐系统与大模型基准。
原文摘要 · Abstract (English)
Modern recommender systems must adapt to dynamic, need-specific objectives for diverse recommendation scenarios, yet most traditional recommenders are optimized for a single static target and struggle to reconfigure behavior on demand. Recent advances in reinforcement-learning-based post-training have unlocked strong instruction-following and reasoning capabilities in LLMs, suggesting a principled route for aligning them to complex recommendation goals. Motivated by this, we study closed-set autoregressive ranking, where an LLM generates a permutation over a fixed candidate set conditioned on user context and an explicit need instruction. However, applying RL to this setting faces two key obstacles: (i) sequence-level rewards yield coarse credit assignment that fails to provide fine-grained training signals, and (ii) interaction feedback is sparse and noisy, which together lead to inefficient and unstable updates. We propose FlexRec, a post-training RL framework that addresses both issues with (1) a causally grounded item-level reward based on counterfactual swaps within the remaining candidate pool, and (2) critic-guided, uncertainty-aware scaling that explicitly models reward uncertainty and down-weights low-confidence rewards to stabilize learning under sparse supervision. Across diverse recommendation scenarios and objectives, FlexRec achieves substantial gains: it improves NDCG@5 by up to \textbf{59\%} and Recall@5 by up to \textbf{109.4\%} in need-specific ranking, and further achieves up to \textbf{24.1\%} Recall@5 improvement under generalization settings, outperforming strong traditional recommenders and LLM-based baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。