Bridging Search and Recommendation in Generative Retrieval: Does One Task Help the Other?
Not on the map. Why?
Abstract (arXiv)
Generative retrieval for search and recommendation is a promising paradigm for retrieving items, offering an alternative to traditional methods that depend on external indexes and nearest-neighbor searches. Instead, generative models directly associate inputs with item IDs. Given the breakthroughs of Large Language Models (LLMs), these generative systems can play a crucial role in centralizing a variety of Information Retrieval (IR) tasks in a single model that performs tasks such as query understanding, retrieval, recommendation, explanation, re-ranking, and response generation. Despite the growing interest in such a unified generative approach for IR systems, the advantages of using a single, multi-task model over multiple specialized models are not well established in the literature. This paper investigates whether and when such a unified approach can outperform task-specific models in the IR tasks of search and recommendation, broadly co-existing in multiple industrial online platforms, such as Spotify, YouTube, and Netflix. Previous work shows that (1) the latent representations of items learned by generative recommenders are biased towards popularity, and (2) content-based and collaborative-filtering-based information can improve an item's representations. Motivated by this, our study is guided by two hypotheses: [H1] the joint training regularizes the estimation of each item's popularity, and [H2] the joint training regularizes the item's latent representations, where search captures content-based aspects of an item and recommendation captures collaborative-filtering aspects. Our extensive experiments with both simulated and real-world data support both [H1] and [H2] as key contributors to the effectiveness improvements observed in the unified search and recommendation generative models over the single-task approaches.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Oct 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 3; 2026: 4.
7 papers.
- 2025MemInsight: Autonomous Memory Augmentation for LLM Agentscited by 85
- 2025Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representationscited by 35
- 2025Continual Recommender Systemscited by 2
- 2026MTServe: Efficient Serving for Generative Recommendation Models with Hierarchical Cachescited by 2
- 2026From Relevance to Authority: Authority-aware Generative Retrieval in Web Search Enginescited by 1
- 2026Learning from Unreachable Rewards: Hint-Conditioned Reinforcement Learning for Generative Recommendationcited by 1
- 2026Dear Algo: A Precision-First Agentic Intent Layer for Unified Search and Recommendationcited by 0
- 2026Dear Algo: A Precision-First Agentic Intent Layer for Unified Search and Recommendation16 Aug 2026
- 2026Learning from Unreachable Rewards: Hint-Conditioned Reinforcement Learning for Generative Recommendation12 Aug 2026
- 2026MTServe: Efficient Serving for Generative Recommendation Models with Hierarchical Caches24 Apr 2026
- 2026From Relevance to Authority: Authority-aware Generative Retrieval in Web Search Engines15 Apr 2026
- 2025Continual Recommender Systems5 Jul 2025
- 2025MemInsight: Autonomous Memory Augmentation for LLM Agents27 Mar 2025
- 2025Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations4 Mar 2025