Large Scale Retrieval for the LinkedIn Feed using Causal Language Models
Source: https://arxiv.org/abs/2510.14223 (arXiv, October 2025)
Authors: Sudarshan Srinivasa Ramanujam, Antonio Alonso, Saurabh Kataria, Siddharth Dangi, Akhilesh Gupta, Birjodh Singh Tiwana, et al. (23 authors total, LinkedIn)
Category: Retrieval
Overview
This paper presents LinkedIn's approach to large-scale retrieval for the Feed using causal language models. The work addresses a central question for modern search, recommendation, and personalization systems: how to redistribute the responsibilities of retrieval, ranking, generation, and tool calling in the LLM era.
Note: this forum entry is based on the paper's public metadata and a contextual analysis; the original abstract text was not reproduced in the source post. Consult the PDF for exact methods and quantitative results.
Context and Motivation
Traditional pipelines treat retrieval, ranking, and generation as separate stages, which struggles to meet LLM-era demands for natural language interaction, multi-hop reasoning, and up-to-date knowledge. Core scenarios include open-domain retrieval, enterprise knowledge search, conversational search, and semantic understanding in recommendation systems.
Typical Architecture (as analyzed in the post)
1. Input and representation — encode queries, documents, and user context as dense or sparse representations, or structured prompts. 2. Core modules — retriever, reranker, planner, memory, and tool interfaces, chained or run in parallel. 3. Learning strategies — supervised fine-tuning, contrastive learning, distillation, reinforcement learning (including process rewards), and synthetic data bootstrapping. 4. Inference strategies — single-pass retrieval, iterative retrieval, parallel sub-queries, early stopping, and budget control.
Engineering Checklist
| Concern | Question | Suggestion | |---------|----------|------------| | Data | PII in training/index? Version control? | Partitioned indexes, sanitization, rollback-able embedding versions | | Latency | p99 budget? Retrieval steps? | Cascades + early stop, cache popular queries, async reranking | | Quality | Do offline gains transfer to online CTR/satisfaction? | Interleaving experiments, human audits, citation checks | | Safety | Poisoning/bias from open retrieval? | Source whitelists, adversarial detection, output filtering | | Cost | Token and GPU cost per query? | Small-model routing, distillation, hybrid sparse+dense |
Takeaways for Search / Rec / Personalization
- Architecture: cascaded retrieve–rerank–generate remains mainstream, but agentic paradigms make retrieval count and policy learnable.
- Data: high-quality instruction data and click/session logs matter as much as model size; synthetic data risks leakage and distribution shift.
- Evaluation: the gap between offline metrics and online satisfaction is widening; LLM-as-judge needs cross-validation with human evaluation.
- Production: latency, cost, interpretability, and safety are hard constraints — don't optimize only academic benchmarks.
- CAME: Competitively Learning a Mixture-of-Experts Model for First-stage Retrieval
- CoEvo: Coevolution of LLM and Retrieval Model for Domain-Specific Information Retrieval
- DRAMA: Diverse Augmentation from Large Language Models to Smaller Dense Retrievers (arXiv 2502.18460)
- ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance
- Fine-Tuning LLaMA for Multi-Stage Text Retrieval (arXiv 2310.08319)
- How Does Generative Retrieval Scale to Millions of Passages? (Google, arXiv 2305.11841)
Limitations and Open Problems
Potential limitations include experiment scale constrained by GPU budgets, benchmark–production distribution mismatch, English-centric data, and safety risks of agentic systems on the open web. Future directions: better test-time compute allocation, deeper integration with knowledge graphs/structured databases, and causal/fairness constraints for recommenders.