Skip to content
Preprint

SCoRD: Semantic-Assisted Continual Retriever-Reranker Distillation for LLM-Based Recommendation

Aug 2026 · 0 citations · 65 references
Computer Science

TL;DR

Experiments on real-world datasets show that SCoRD enables effective and efficient retriever-reranker co-adaptation and introduces a semantic reasoning assistant that distills the LLM's ability to infer underlying user intents into reusable intent-level guidance.

Abstract

Recommendation systems increasingly adopt a two-stage pipeline, where an ID-based retriever retrieves candidates and an LLM-based reranker refines their rankings. To improve retrieval quality, reranker-to-retriever distillation is commonly used to transfer the reranker's knowledge to the retriever. For practical deployment, however, this pipeline must continually adapt to evolving interests and incoming interactions. A naive solution is to repeatedly update the LLM reranker and distill its latest knowledge, but this incurs prohibitive costs. Updating the retriever alone is cheaper, but its limited capacity makes adaptation from sparse data difficult. We propose SCoRD, a continual knowledge distillation framework for LLM-based reranking pipelines under a non-stationary data stream. SCoRD introduces a semantic reasoning assistant that distills the LLM's ability to infer underlying user intents into reusable intent-level guidance. It selectively distills reranker knowledge to the retriever on low-confidence sequences, guides retriever-only updates without repeated LLM inference, and feeds retriever-derived representations and intent-drift signals back to the reranker. Experiments on real-world datasets show that SCoRD enables effective and efficient retriever-reranker co-adaptation.

View source

Similar papers

Preprint Sep 2026

QReason: Query-Focused Decoupled Chain-of-Thought for Efficient Passage Reranking

Passage reranking plays a crucial role in information retrieval by refining the ordering of candidate passages to better reflect relevance. Existing listwise LLM rerankers with Chain-of-Thought (CoT) reasoning can handle complex queries effectively, but they suffer from substantial redundancy and high latency due to sl...

Yang Zhang, Wen-Han Liu, Qian-Nan Zhu et al. · 0 citations
Open access Oct 2026

Query Expansion Using Wikidata and Hybrid Dense-Sparse Retrieval for Semantic Information Access

Standard information retrieval systems often miss deeper meaning when queries are short, vague, or lack specifics. We propose a hybrid framework that pulls structured data from Wikidata and combines dense and sparse retrieval methods to improve both finding documents and generating answers. Our method first identifies...

Abhishek Dwivedi, Shesh Mani Tiwari, Mohd. Shah Alam et al. · 0 citations
Preprint Sep 2026

Seek: Self-Evaluative Exploration for Knowledge Retrieval

seek, Self-Evaluative Exploration for Knowledge Retrieval, a training-free framework that addresses this limitation through iterative corpus interaction at test time through iterative corpus interaction at test time.

Amin Bigdeli, Radin Hamidi Rad, Negar Arabzadeh et al. · 0 citations
Preprint Sep 2026

VARG: Value-Aware and Ranking-Aligned Generative Retrieval for Dynamic E-commerce Search

Integrating recall and pre-ranking in e-commerce search requires candidate generation to account for relevance, personalization, and business value before final ranking. To this end, we present VARG, a generative retrieval system for Tmall App search that directly admits generated item candidates to the existing final...

Xiao-Peng Chu, Jian-Bo Zhu, Ming-Min Jin et al. · 1 citation
#small language model Preprint Aug 2026

The Retriever Should Remember: Experience-Amortized Reranking for Long-Term Agent Memory

Experiments on long-term conversational memory show that mixed observed-and-estimated reranking improves answer accuracy over semantic retrieval by up to 6.62% and remains effective when only 17.5% of candidates receive direct LLM relevance scores, thereby substantially reducing the inference overhead of LLM reranking.

Qi Feng, Chris Ding, Ji-Cong Fan · 2 citations
#natural language process... Preprint Sep 2026

Q-TIE: A Lightweight and Generalizable Re-ranking Framework for Temporal Information Retrieval

Q-TIE is proposed, a re-ranking framework based on learned Temporal Intent Extraction that generalizes beyond predefined rules via model-based learning while explicitly modeling temporal constraints as a separate signal - jointly achieving what each paradigm typically trades off.

Soyeon Kim, Hyunjin Kim, J. Bak et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.