RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation

• URL: http://arxiv.org/abs/2605.07129v1
• Date: Fri, 08 May 2026 02:07:30 GMT
• Title: RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation
• Abstract summary: Large Language Models (LLMs) have emerged as a promising paradigm for next-generation recommender systems.<n>We propose RRCM, a ranking-driven retrieval-and-reasoning framework for LLM-based agentic recommendation.
• Score: 14.301653810918713
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• NaviRAG: Towards Active Knowledge Navigation for Retrieval-Augmented Generation [50.16741209529908]
  NaviRAG is a novel framework that shifts from passive segment retrieval to active knowledge navigation.<n>We show that NaviRAG consistently improves both retrieval recall and end-to-end answer performance over conventional RAG baselines.
  arXiv  Detail & Related papers  (2026-04-14T14:07:01Z)
• Retrieval Augmented Conversational Recommendation with Reinforcement Learning [43.40183980321253]
  Large language models (LLMs) exhibit enhanced capabilities in language understanding and generation.<n>We present RAR, a novel two-stage retrieval augmented conversational recommendation framework.
  arXiv  Detail & Related papers  (2026-04-06T06:08:03Z)
• Give Users the Wheel: Towards Promptable Recommendation Paradigm [21.39017335979666]
  Decoupled Promptable Sequential Recommendation (DPR) is a model-agnostic framework that empowers conventional sequential backbones to support Promptable Recommendation.<n>DPR modulates the latent user representation directly within the retrieval space.<n>It significantly outperforms state-of-the-art baselines in prompt-guided tasks.
  arXiv  Detail & Related papers  (2026-02-21T18:41:28Z)
• M-RAG: Making RAG Faster, Stronger, and More Efficient [15.147969102210759]
  We propose M-RAG, a novel Chunk-free retrieval strategy for large language models.<n>M-RAG extracts structured, k-v decomposition meta-markers, with a lightweight, intent-aligned retrieval key.<n>We show that M-RAG retrieves more answer-friendly evidence with high efficiency.
  arXiv  Detail & Related papers  (2026-01-06T15:14:54Z)
• KBQA-R1: Reinforcing Large Language Models for Knowledge Base Question Answering [64.62317305868264]
  We present textbfKBQA-R1, a framework that shifts the paradigm from text imitation to interaction optimization via Reinforcement Learning.<n>Treating KBQA as a multi-turn decision process, our model learns to navigate the knowledge base using a list of actions.<n>Experiments on WebQSP, GrailQA, and GraphQuestions demonstrate that KBQA-R1 achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-12-10T17:45:42Z)
• Rethinking On-policy Optimization for Query Augmentation [49.87723664806526]
  We present the first systematic comparison of prompting-based and RL-based query augmentation across diverse benchmarks.<n>We introduce a novel hybrid method, On-policy Pseudo-document Query Expansion (OPQE), which learns to generate a pseudo-document that maximizes retrieval performance.
  arXiv  Detail & Related papers  (2025-10-20T04:16:28Z)
• Towards Context-aware Reasoning-enhanced Generative Searching in E-commerce [61.03081096959132]
  We propose a context-aware reasoning-enhanced generative search framework for better textbfunderstanding the complicated context.<n>Our approach achieves superior performance compared with strong baselines, validating its effectiveness for search-based recommendation.
  arXiv  Detail & Related papers  (2025-10-19T16:46:11Z)
• Improving Context Fidelity via Native Retrieval-Augmented Reasoning [35.50952279309109]
  Large language models (LLMs) often struggle with context fidelity, producing inconsistent answers when responding to questions based on provided information.<n>We propose CARE, a novel native retrieval-augmented reasoning framework that teaches LLMs to explicitly integrate in-context evidence within their reasoning process with the model's own retrieval capabilities.<n>Our method requires limited labeled evidence data while significantly enhancing both retrieval accuracy and answer generation performance through strategically retrieved in-context tokens in the reasoning chain.
  arXiv  Detail & Related papers  (2025-09-17T04:28:07Z)
• Tree-Based Text Retrieval via Hierarchical Clustering in RAGFrameworks: Application on Taiwanese Regulations [0.0]
  We propose a hierarchical clustering-based retrieval method that eliminates the need to predefine k.<n>Our approach maintains the accuracy and relevance of system responses while adaptively selecting semantically relevant content.<n>Our framework is simple to implement and easily integrates with existing RAG pipelines, making it a practical solution for real-world applications under limited resources.
  arXiv  Detail & Related papers  (2025-06-16T15:34:29Z)
• Lightweight and Direct Document Relevance Optimization for Generative Information Retrieval [49.669503570350166]
  Generative information retrieval (GenIR) is a promising neural retrieval paradigm that formulates document retrieval as a document identifier (docid) generation task.<n>Existing GenIR models suffer from token-level misalignment, where models trained to predict the next token often fail to capture document-level relevance effectively.<n>We propose direct document relevance optimization (DDRO), which aligns token-level docid generation with document-level relevance estimation through direct optimization via pairwise ranking.
  arXiv  Detail & Related papers  (2025-04-07T15:27:37Z)
• Synergistic Interplay between Search and Large Language Models for Information Retrieval [141.18083677333848]
  InteR allows RMs to expand knowledge in queries using LLM-generated knowledge collections. InteR achieves overall superior zero-shot retrieval performance compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-12T11:58:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.