ConceptReciprocal Rank Fusion / RRF

Reciprocal Rank Fusion

A hybrid retrieval result fusion algorithm that merges results from multiple recall channels by summing the reciprocals of their ranks. It effectively combines dense and sparse retrieval rankings without requiring parameter tuning.

Timeline (last 90 days)

Oct 18

Reciprocal rank fusion (RRF) takes 1/(k + rank) for each document in each result list (k is usually 60), sums them, and reranks by total score; it relies only on ranks and requires no normalization.

Unverified50%

All Facts (1)

Unverified

Reciprocal rank fusion (RRF) takes 1/(k + rank) for each document in each result list (k is usually 60), sums them, and reranks by total score; it relies only on ranks and requires no normalization.

50%

Source Articles

Naive RAG Is Lying to You: 7 RAG Architectures That Survive ProductionOct 18 RAG in Production: 7 Lessons</br>Key Pitfalls This Tutorial Won't Tell YouOct 15