Overview
This entry indexes the academic paper "Representation Learning with Large Language Models for Recommendation" published at WWW 2024.
| Field | Value | |-------|-------| | Venue | WWW 2024 | | Source link | https://dl.acm.org/doi/abs/10.1145/3589334.3645458 | | Resource type | Academic paper | | Category | Recommender Engines |
Background and Motivation
At scale, search and recommendation systems have long faced challenges around efficiency, scalability, and user-intent understanding. Traditional pipeline-based approaches often separate retrieval, ranking, and generation, which makes it difficult to meet the demands of the LLM era: natural-language interaction, multi-hop reasoning, and up-to-date knowledge.
This paper sits at the intersection of recommendation and large-scale search/retrieval systems, addressing the core question of how to re-allocate responsibilities among retrieval, ranking, generation, and tool use in the LLM era.
Core Contributions
- A unified perspective for the problem domain, placing scattered related work into a comparable framework.
- A clear decomposition of method components (representation learning, retriever, re-ranker, planner, generator, feedback mechanisms) to support engineering practice.
- Reproducible benchmarks, datasets, or taxonomy tables to lower the entry cost for follow-up research.
- Discussion of interfaces with emerging paradigms such as LLM tool calling, reinforcement learning, and multi-agent collaboration, including a migration path from research prototypes to industrial systems.
- Explicit open problems: evaluation credibility, latency and cost, hallucination and safety, and cross-lingual / multimodal extension.
- Datasets: MS MARCO, BEIR, Natural Questions, domain-specific corpora, and public recommendation sets.
- Metrics: nDCG@10, MRR, Recall@k, Hit@k, human preference, task success rate, latency, and token cost.
- Baselines: BM25, dense retrieval, cross-encoder re-ranking, retrieval-free LLMs, and commercial search APIs.
- 360Brew: A Decoder-only Foundation Model for Personalized Ranking
- Actions Speak Louder than Words: Trillion-Parameter Sequential Transducer
- Augmenting Netflix Search with In-Session Adapted Recommendations
- Bridging Language and Items for Retrieval and Recommendation
- Data-efficient Fine-tuning for LLM-based Recommendation (SIGIR 2024)
- DiffKG: Knowledge Graph Diffusion Model for Recommendation (WSDM 2024)
Method / System Architecture
The general methodology follows four steps:
1. Input and representation: encode queries, documents, and user context into dense or sparse representations, or construct structured prompts. 2. Core modules: retriever, re-ranker, planner, memory module, and tool interfaces, chained or combined per task. 3. Learning strategies: supervised fine-tuning, contrastive learning, distillation, reinforcement learning (including process rewards), and bootstrapped data synthesis. 4. Inference strategies: single-pass retrieval, iterative retrieval, parallel sub-queries, early stopping, and budget control.
Evaluation
Exact numerical results should be verified against the original PDF; this post summarizes the experimental design based on the abstract and public metadata.
Key Insights for Search / Rec / Personalization
1. Architecture: cascaded retrieval + re-ranking + generation remains mainstream, but agentic paradigms make retrieval count and policy themselves learnable. 2. Data: high-quality instruction data and click/session logs are both critical; synthetic data must guard against knowledge leakage and distribution shift. 3. Evaluation: the gap between offline metrics and online satisfaction is widening; LLM-as-judge needs cross-validation with human evaluation. 4. Product: latency, cost, interpretability, and safety are hard constraints for industrial deployment, not just academic benchmarks.
Limitations and Future Work
Potential limitations include experiment scale bounded by GPU budgets, mismatch between benchmarks and real user distributions, English-centric data with unknown cross-lingual generalization, and safety risks of agentic systems on the open web. Future directions include more efficient test-time compute allocation, deeper integration with knowledge graphs and structured databases, and causal and fairness constraints for recommendation.