最新资讯
stackoverflow.blog 欢迎来到芯片时代:半导体制造、AI 数据中心与芯片设计的未来 www.youtube.com AI Agent 总犯同样的错:CentralAgent AI 将记忆重构为经验系统 pub.towardsai.net Netflix 科学家建议重采样 LLM 评判:5 次仅将误差棒缩小 13% pub.towardsai.net Jev 作为 LLM 前的静默层:构建提示感知的模型路由器 reddit.com OpenAI 称 Astra 仅满足 10% 安全任务标准 dev.to FreeToken:在自有 GPU 上运行前沿 MoE 模型及其内存需求 dev.to 当 AI Agent 说“完成”时,究竟完成了什么? dev.to 部署 Underdog Bark 3.0 Pro:逐字转写、自定义后端与分块设置 dev.to 为艰难对话构建 AI:五个 Agent、一条安全正则与一位盲评监督者 techcrunch.com Palo Alto Networks 洽谈以 5 亿美元收购 AI Agent 安全初创公司 Clutch theinformation.com 黄仁勋被要求就涉华间谍指控向国会作简报 www.infoq.com Edera 推出 Object Capability Bounded Authority,试图将凭证与 AI Agent 工作负载隔离
多元动态
登录 注册
智能体 arxiv.org ·

RRCM:面向 LLM 推荐的排序驱动协同记忆与元记忆检索

原文 我的收藏

该论文提出 RRCM,一个面向 LLM 智能体推荐的排序驱动检索与推理框架。针对现有方法依赖固定上下文构建策略、以及异构证据(协同行为记录与物品元数据)易撑爆上下文窗口的问题,RRCM 从轻量用户历史上下文出发,学习在直接推荐、检索协同证据、检索物品元数据或两者交错之间做决策;两类记忆均以自然语言表示并通过统一检索接口访问。其记忆读取策略以最终 top-k 推荐质量作为唯一排序奖励,采用 group relative policy optimization 优化。摘要称实验显示 RRCM 显著优于传统基线与多种 LLM 推荐方法,但未披露具体数据集与指标数值。

AI推荐理由 arXiv 论文(cs.IR/cs.AI/cs.LG),有明确作者、提交与修订记录和摘要,事实信息密度较高。核心新信息是提出 RRCM:以排序结果(top-k 推荐质量)作为唯一奖励,用 group relative policy optimization 学习“直接推荐 / 检索协同证据 / 检索物品元数据 / 两者交错”的记忆读取策略,从而避免固定 prompt 与手工 CF 注入。局限在于摘要仅称“显著优于基线和多种 LLM 推荐方法”,未给出数据集、指标数值或消融细节,效果无法独立核验;且属推荐系统方向,对通用 Agent 与开发工具的迁移价值需进一步验证。

72

正文

Computer Science > Information Retrieval arXiv:2605.07129 (cs) [Submitted on 8 May 2026 (v1), last revised 27 Sep 2026 (this version, v2)] Title:RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation Authors:Shijun Li, Pranav Belligundu, Tianxin Wei, Wooseong Yang, Yu Wang, Joydeep Ghosh View a PDF of the paper titled RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation, by Shijun Li and 5 other authors View PDF HTML (experimental) Abstract: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. Subjects: Information Retrieval (cs.IR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2605.07129 [cs.IR] (or arXiv:2605.07129v2 [cs.IR] for this version) https://doi.org/10.48550/arXiv.2605.07129 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Shijun Li [view email] [v1] Fri, 8 May 2026 02:07:30 UTC (2,103 KB) [v2] Sun, 27 Sep 2026 19:16:36 UTC (2,119 KB) Full-text links: Access Paper: View a PDF of the paper titled RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation, by Shijun Li and 5 other authors View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.IR new | recent | 2026-05 Change to browse by: cs cs.AI cs.LG References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

来源报道 · 1 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容