मुख्य सामग्री पर जाएँ

परिणाम पुनःक्रमण

उम्मीदवारों को वास्तविक प्रासंगिकता से दोबारा क्रमबद्ध करना

भाषा और ज्ञानमध्यवर्ती #10
इनपुटटेक्स्टटेबल

यह पृष्ठ अंग्रेज़ी में प्रस्तुत है; शीर्षक और सारांश का स्थानीयकरण किया गया है।

यह क्षमता क्या है

Takes a query and a short list of recalled candidates, and returns a reordered ranking with relevance scores. Its division of labour differs from embedding retrieval: retrieval uses cheap vector neighbours to pull dozens from tens of thousands, whereas reranking applies a costlier model to score those dozens carefully, so it only runs over the candidate set.

तकनीकी रूप से कैसे

The typical approach is a cross-encoder: query and candidate are concatenated into one sequence and a single model outputs a relevance score; seeing both at once is more accurate than two-tower encoders, but it cannot be pre-computed and must run per pair. To control latency, a common pattern truncates with a small model first and reranks with a larger one — or simply prompts a large model to score.

प्रतिनिधि उत्पाद

4

संबंधित संस्थान

सामान्य उपयोग

  • Improving evidence quality after RAG retrieval
  • Final ranking in e-commerce and content search
  • Selecting the most relevant passages for a QA system
  • Deduplicating and choosing among candidate answers

इसका मूल्यांकन कैसे होता है

nDCG@k
Discounted gain in the top-k after reranking, rewarding better placement
MAP
Mean of average precision over all relevant items
MRR
Quality of the position of the first relevant result

सीमाएँ और कठिनाइयाँ

  • Cross-encoders score each candidate separately, so latency climbs steeply with candidate count
  • Judgements are unstable on out-of-distribution queries, and truncating long documents causes errors
  • It can only reorder what was recalled; anything retrieval missed cannot be recovered

इसके पीछे की अवधारणाएँ