Hybrid search strategies in Prompt Engineering / GenAI - Model Pipeline Trace

Model Pipeline - Hybrid search strategies

This pipeline combines two search methods: a fast approximate search and a precise exact search. It first narrows down options quickly, then carefully picks the best match. This helps find answers faster and more accurately.

Data Flow - 4 Stages

1Input query

1 query string→Receive user search query→1 query string

"Find articles about climate change effects"

↓

2Approximate search

1 query string→Use fast vector similarity to find top 100 candidates→100 candidate documents

Top 100 documents with vectors close to query vector

↓

3Exact search rerank

100 candidate documents→Apply precise scoring (e.g., BM25 or cross-encoder) to rerank candidates→Top 10 ranked documents

Top 10 documents ranked by exact relevance score

↓

4Final output

Top 10 ranked documents→Return best matching documents to user→10 documents

10 most relevant articles about climate change effects

Training Trace - Epoch by Epoch

Loss
1.0 | *       
0.8 |  *      
0.6 |   *     
0.4 |    *    
0.2 |     *   
0.0 +---------
      1 2 3 4 5 Epochs

Epoch	Loss ↓	Accuracy ↑	Observation
1	0.85	0.60	Initial training with random weights, loss high, accuracy moderate
2	0.65	0.72	Model learns basic patterns, loss decreases, accuracy improves
3	0.50	0.80	Better ranking ability, loss continues to drop, accuracy rises
4	0.40	0.85	Model converging, loss lower, accuracy higher
5	0.35	0.88	Training stabilizes, good balance of speed and precision

Prediction Trace - 4 Layers

Layer 1: Query vectorization

Layer 2: Approximate search

Layer 3: Exact reranking

Layer 4: Return results

Model Quiz - 3 Questions

Why does the hybrid search first use approximate search before exact reranking?

A To avoid using any scoring methods

B To increase the number of documents searched

C To quickly reduce the number of documents to a manageable set

D To return results without ranking

Key Insight

Hybrid search strategies combine speed and accuracy by first quickly filtering many options with approximate search, then carefully selecting the best matches with exact reranking. This balance improves search quality and user experience.

Practice

1.

What is the main benefit of using a hybrid search strategy in AI?

easy

A. It relies solely on embedding similarity for accuracy.

B. It uses only keyword matching for faster results.

C. It combines different search methods to improve results.

D. It avoids using any search algorithms.

Solution

1. Step 1: Understand hybrid search purpose

   Hybrid search mixes different search methods to get better results than using one method alone.

2. Step 2: Compare options

   It combines different search methods to improve results. correctly states the benefit. The other options either describe single-method approaches or are incorrect.

3. Final Answer:

   It combines different search methods to improve results. -> Option C

4. Quick Check:

   Hybrid search = mix methods [OK]

Hint: Hybrid means mixing methods for better results [OK]

Common Mistakes:

• Thinking hybrid means using only one search method
• Confusing hybrid search with keyword-only search
• Ignoring the benefit of combining methods

2.

Which of the following is the correct way to combine keyword and embedding search scores in a hybrid search?

final_score = ?

easy

A. final_score = 0.5 * keyword_score + 0.5 * embedding_score

B. final_score = keyword_score * embedding_score

C. final_score = max(keyword_score, embedding_score)

D. final_score = keyword_score - embedding_score

Solution

1. Step 1: Understand score combination

   Hybrid search often combines scores by weighted sum to balance keyword and embedding contributions.

2. Step 2: Evaluate options

   final_score = 0.5 * keyword_score + 0.5 * embedding_score uses weighted sum, which is common. Multiplying scores can distort results. Taking the max ignores combined info. Subtracting can give negative scores.

3. Final Answer:

   final_score = 0.5 * keyword_score + 0.5 * embedding_score -> Option A

4. Quick Check:

   Weighted sum combines scores [OK]

Hint: Use weighted sum to combine scores in hybrid search [OK]

Common Mistakes:

• Multiplying scores causing skewed results
• Using max ignores combined info
• Subtracting scores can produce negatives

3.

Given the following Python code snippet for hybrid search scoring, what is the output?

keyword_scores = [0.8, 0.6, 0.9]
embedding_scores = [0.7, 0.9, 0.5]
final_scores = [0.5 * k + 0.5 * e for k, e in zip(keyword_scores, embedding_scores)]
print(final_scores)

medium

A. [0.8, 0.9, 0.5]

B. [0.75, 0.75, 0.7]

C. [0.56, 0.54, 0.7]

D. [1.5, 1.5, 1.4]

Solution

1. Step 1: Calculate each final score

   For each pair: (0.8+0.7)/2=0.75, (0.6+0.9)/2=0.75, (0.9+0.5)/2=0.7

2. Step 2: Verify output list

   The list is [0.75, 0.75, 0.7], matching [0.75, 0.75, 0.7].

3. Final Answer:

   [0.75, 0.75, 0.7] -> Option B

4. Quick Check:

   Average scores = [0.75, 0.75, 0.7] [OK]

Hint: Average keyword and embedding scores for final score [OK]

Common Mistakes:

• Adding scores without dividing by 2
• Mixing order of scores
• Printing original scores instead of combined

4.

Identify the error in this hybrid search score calculation code and select the fix:

keyword_scores = [0.9, 0.7]
embedding_scores = [0.6]
final_scores = [0.5 * k + 0.5 * e for k, e in zip(keyword_scores, embedding_scores)]
print(final_scores)

medium

A. No error; code runs fine.

B. Use '+' instead of '*' in score calculation.

C. Replace zip with map to fix length mismatch.

D. Lists have different lengths; use min length or pad shorter list.

Solution

1. Step 1: Check list lengths

   keyword_scores has 2 elements, embedding_scores has 1 element, causing zip to truncate to 1 element.

2. Step 2: Fix length mismatch

   Lists have different lengths; use min length or pad shorter list. suggests using min length or padding shorter list to avoid losing data.

3. Final Answer:

   Lists have different lengths; use min length or pad shorter list. -> Option D

4. Quick Check:

   Length mismatch needs handling [OK]

Hint: Check list lengths before zipping in hybrid search [OK]

Common Mistakes:

• Ignoring length mismatch causing data loss
• Changing operators incorrectly
• Assuming zip auto-fills missing values

5.

You want to build a hybrid search system that first filters documents by keywords, then reranks them by embedding similarity. Which approach best fits this goal?

hard

A. Filter documents by keywords, then rerank filtered set by embedding similarity.

B. Run embedding search first, then filter results by keywords.

C. Combine keyword and embedding scores equally on all documents without filtering.

D. Use only keyword search for filtering and ignore embeddings.

Solution

1. Step 1: Understand filtering and reranking

   Filtering by keywords narrows down documents quickly; reranking by embeddings improves relevance.

2. Step 2: Match approach to goal

   Filter documents by keywords, then rerank filtered set by embedding similarity. matches the goal: filter first, then rerank. Run embedding search first, then filter results by keywords. reverses order, less efficient. Combine keyword and embedding scores equally on all documents without filtering. skips filtering, less efficient. Use only keyword search for filtering and ignore embeddings. ignores embeddings, losing semantic power.

3. Final Answer:

   Filter documents by keywords, then rerank filtered set by embedding similarity. -> Option A

4. Quick Check:

   Filter then rerank = best hybrid approach [OK]

Hint: Filter first, rerank second for efficient hybrid search [OK]

Common Mistakes:

• Reranking before filtering wastes resources
• Ignoring filtering step reduces speed
• Using only one method loses hybrid benefits