Skip to main content
When a feature search stage queries multiple embedding indexes (e.g., text + image), it produces separate ranked lists that need to be merged. Fusion strategies determine how those lists become one.
Comparison of RRF, Weighted, and Learned fusion strategies

Strategy Reference

Reciprocal Rank Fusion (RRF)

The default strategy. RRF ignores raw similarity scores and uses only rank position. This makes it robust when different features produce scores on different scales. Formula:
Where k = 60 (constant that prevents top-ranked items from dominating) and rank_i is the document’s position in the i-th feature’s result list. Why it works: A document ranked #1 by text search and #3 by image search gets a higher fused score than a document ranked #2 by both. The rank-based approach means you don’t need to calibrate score ranges across features.
RRF scores are small on purpose — read order, not magnitude. Because the score is 1 / (k + rank) with k = 60, the best possible result scores about 1 / (60 + 1) ≈ 0.0164 per search (a little higher when several searches rank the same document). A top score of ~0.017 is expected and healthy — it is a fused rank position, not a similarity or a quality percentage, so a 0.0167 top hit does not mean the search matched poorly. Rank documents by their relative order. If you need an absolute similarity value (e.g. 0.01.0), use a single search without fusion, or a weighted/max strategy that preserves raw scores.
RRF is the best default. Use it unless you have a specific reason to choose another strategy.

Distribution-Based Score Fusion (DBSF)

DBSF normalizes scores from each feature into a common distribution before combining them. This handles cases where one feature produces scores in [0.8, 0.99] and another in [0.1, 0.6]. How it works:
  1. For each feature, compute the mean (μ) and standard deviation (σ) of scores
  2. Normalize each score: normalized = (score - μ) / σ
  3. Sum normalized scores across features
DBSF is useful when features have different score distributions, but the raw scores themselves carry meaningful information (unlike RRF which ignores scores entirely).

Weighted Fusion

You manually assign a weight to each search feature. Scores are multiplied by their weight and summed. Use this when you know from domain expertise that one feature is more important than another. Formula:
Weights don’t need to sum to 1 — they’re relative importance indicators.
Weighted fusion is sensitive to score scale differences. If text scores are in [0.8, 1.0] and image scores are in [0.1, 0.5], a 50/50 weight split will still favor text. Consider DBSF or RRF if score ranges differ significantly.

Max Fusion

Takes the maximum score across all features for each document. A document only needs to be a strong match on one feature to rank highly. Formula:
Use this when any single strong match is sufficient — for example, a product that matches either the text description or the visual similarity should rank high.

Learned Fusion

Learned fusion replaces static weights with weights that adapt automatically from user interaction data. Under the hood, it uses Thompson Sampling with Beta distributions to balance exploration (trying different weight combinations) with exploitation (using what’s known to work). See Learned Fusion for the full deep dive.

Choosing a Strategy

Performance Comparison

All strategies add minimal latency. The real difference is in quality: learned fusion converges toward optimal weights for your specific users and content, while static strategies require manual tuning or accept a one-size-fits-all approach.