让大模型自己决定该查用户行为还是物品信息,提升推荐准确率。
RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation

- 基于排名反馈动态决定是否检索用户行为或物品元数据
- 在多个数据集上显著超越传统推荐与现有大模型方法
- 适合研究大模型推荐系统中上下文构建的新思路
大语言模型(LLM)为下一代推荐系统提供了强大的语义理解与自然语言推理能力。然而,现有基于LLM的推荐方法在从异构证据中构建决策相关上下文时仍面临两大挑战:一是固定上下文构建策略难以判断每条实例的真实有效信息;二是异构证据导致上下文效率严重下降,丰富元数据和交互记录易填满上下文窗口,而过度压缩或启发式过滤可能丢失关键细粒度信息。为此,我们提出RRCM,一种面向代理型推荐的、基于协同与元记忆的排名驱动检索-推理框架。RRCM从轻量用户历史开始,通过推理学习直接推荐、检索协同证据、检索物品元数据或两者混合的决策。两种记忆以自然语言表示,通过统一检索接口访问,避免手工协同过滤注入与固定检索规则。我们使用仅基于结果的排名奖励(群体相对策略优化)优化记忆读取策略,使检索决策直接由最终top-k推荐质量驱动。大量实验表明,RRCM显著优于传统基线与多种LLM推荐方法。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have emerged as a promising paradigm for next-generation recommender systems, offering strong semantic understanding and natural-language reasoning abilities. Despite recent progress, current LLM-based recommenders still face key challenges in constructing decision-relevant contexts from heterogeneous evidence. First, existing methods often rely on fixed context construction strategies: collaborative behavioral evidence and item-side metadata are typically incorporated through predefined prompts, static retrieval pipelines, or handcrafted injection mechanisms, making it difficult to determine what information is truly beneficial for each instance. Second, heterogeneous evidence introduces a severe context-efficiency bottleneck. Rich metadata and collaborative interaction records can quickly overwhelm the context window, while aggressive compression or heuristic filtering may discard fine-grained evidence critical for accurate recommendation. To address these challenges, we propose RRCM, a ranking-driven retrieval-and-reasoning framework over collaborative and metadata memories for LLM-based agentic recommendation. RRCM starts from a lightweight user-history context and learns whether to recommend directly, retrieve collaborative evidence, retrieve item metadata, or interleave both through reasoning. Both memories are represented in natural language and accessed through a unified retrieval interface, enabling flexible evidence acquisition without handcrafted CF injection or fixed retrieval rules. We optimize this memory-reading policy with an outcome-only ranking reward, instantiated using group relative policy optimization, so that retrieval decisions are directly driven by final top-k recommendation quality. Extensive experiments show that RRCM significantly outperforms traditional baselines and diverse LLM-based recommendation approaches.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。