Re-ranking retrieved results in Prompt Engineering / GenAI - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is re-ranking in the context of retrieved results?

Re-ranking means taking an initial list of results and sorting them again to improve their order, so the most relevant results come first.

beginner

Why do we need re-ranking after retrieving results?

Initial retrieval might be fast but rough. Re-ranking uses more detailed checks to better sort results, improving accuracy and user satisfaction.

intermediate

Name a common method used for re-ranking retrieved results.

A common method is using a machine learning model that scores each result based on features, then sorts results by these scores.

intermediate

How does re-ranking improve search engine results?

Re-ranking helps by pushing the most relevant pages higher, based on deeper analysis like user behavior or content quality, making search results more useful.

beginner

What is a simple example of a feature used in re-ranking models?

Features can include how many times the search term appears in a result, the length of the result, or how recent the content is.

What is the main goal of re-ranking retrieved results?

A To remove all results except the first one

B To improve the order of results for better relevance

C To speed up the initial retrieval process

D To translate results into another language

Re-ranking aims to reorder results so the most relevant ones appear first.

Which of these is NOT typically used in re-ranking?

A Machine learning models

B Content quality features

C User feedback signals

D Random shuffling of results

Random shuffling does not improve relevance and is not used in re-ranking.

Re-ranking is usually applied after:

A Data cleaning

B User clicks on a result

C Initial retrieval of results

D Model training

Re-ranking happens after the first set of results is retrieved.

Which feature might a re-ranking model use to score results?

A Number of times the query appears in the result

B The color of the website

C The user's favorite movie

D The time of day

The frequency of query terms in a result is a useful feature for relevance.

What is a benefit of using machine learning for re-ranking?

A It can learn complex patterns to better judge relevance

B It always runs faster than simple sorting

C It removes the need for initial retrieval

D It guarantees 100% accuracy

Machine learning models can capture complex signals to improve ranking quality.

Explain in your own words what re-ranking retrieved results means and why it is useful.

Think about how search results can be improved after they are first found.

List some features or signals that a re-ranking model might use to decide the best order of results.

Consider what information helps decide if a result is good or not.

Practice

1.

What is the main purpose of re-ranking retrieved results in a search system?

easy

A. To sort the initial search results again using a better scoring method

B. To remove duplicate results from the search output

C. To speed up the initial search query processing

D. To translate results into different languages

Solution

1. Step 1: Understand the role of re-ranking

   Re-ranking means sorting results again after the first search to improve order.

2. Step 2: Identify the goal of re-ranking

   The goal is to use a smarter scoring method to show the most relevant results at the top.

3. Final Answer:

   To sort the initial search results again using a better scoring method -> Option A

4. Quick Check:

   Re-ranking = better sorting [OK]

Hint: Re-ranking means sorting results again for better relevance [OK]

Common Mistakes:

• Confusing re-ranking with removing duplicates
• Thinking re-ranking speeds up initial search
• Assuming re-ranking translates results

2.

Which of the following code snippets correctly represents a simple re-ranking step that sorts a list of results by their score in descending order?

results = [{'id': 1, 'score': 0.5}, {'id': 2, 'score': 0.9}, {'id': 3, 'score': 0.7}]
# Re-rank results here

easy

A. results.sort(reverse=True)

B. results.sort(key=lambda x: x['id'])

C. results.sort(key=lambda x: x['score'])

D. results.sort(key=lambda x: x['score'], reverse=True)

Solution

1. Step 1: Identify sorting by score descending

   We want to sort by 'score' in descending order, so reverse=True is needed.

2. Step 2: Check each option

   results.sort(key=lambda x: x['score'], reverse=True) sorts by 'score' with reverse=True, which is correct. Others either sort by 'id' or ascending score or missing key.

3. Final Answer:

   results.sort(key=lambda x: x['score'], reverse=True) -> Option D

4. Quick Check:

   Sort by score descending = results.sort(key=lambda x: x['score'], reverse=True) [OK]

Hint: Sort with key and reverse=True for descending order [OK]

Common Mistakes:

• Forgetting reverse=True for descending sort
• Sorting by wrong key like 'id'
• Using sort without key causing error

3.

Given the following code that re-ranks search results by a new score, what will be the output after re-ranking?

results = [
  {'id': 'a', 'score': 0.3},
  {'id': 'b', 'score': 0.8},
  {'id': 'c', 'score': 0.5}
]

# New scores from a re-ranker
new_scores = {'a': 0.9, 'b': 0.4, 'c': 0.7}

for r in results:
    r['score'] = new_scores[r['id']]

results.sort(key=lambda x: x['score'], reverse=True)
print([r['id'] for r in results])

medium

A. ['b', 'c', 'a']

B. ['a', 'c', 'b']

C. ['c', 'a', 'b']

D. ['a', 'b', 'c']

Solution

1. Step 1: Update scores with new_scores

   Results get scores: 'a' = 0.9, 'b' = 0.4, 'c' = 0.7.

2. Step 2: Sort results by updated score descending

   Sorted order by score: 0.9 ('a'), 0.7 ('c'), 0.4 ('b').

3. Final Answer:

   ['a', 'c', 'b'] -> Option B

4. Quick Check:

   Sort by new scores descending = ['a', 'c', 'b'] [OK]

Hint: Replace scores then sort descending by score [OK]

Common Mistakes:

• Sorting by old scores instead of new
• Sorting ascending instead of descending
• Mixing up ids and scores

4.

Identify the error in this re-ranking code snippet and select the fix:

results = [{'id': 1, 'score': 0.2}, {'id': 2, 'score': 0.5}]
new_scores = {1: 0.7, 2: 0.9}

for r in results:
    r['score'] = new_scores[r['id']]

results.sort(key=lambda x: x['score'], reverse=True)
print(results)

medium

A. Use sorted() instead of sort() to avoid in-place sorting

B. Change new_scores keys to strings to match 'id' type

C. No error; code runs correctly and sorts results

D. Add a try-except block to handle missing keys

Solution

1. Step 1: Check key types in new_scores and results

   Both use integer keys for 'id', so lookup works correctly.

2. Step 2: Verify sorting and printing

   Sorting by updated 'score' descending is valid and prints sorted list.

3. Final Answer:

   No error; code runs correctly and sorts results -> Option C

4. Quick Check:

   Matching key types = no error [OK]

Hint: Check key types match for dictionary lookups [OK]

Common Mistakes:

• Assuming string keys when they are integers
• Thinking sort() causes error without reason
• Adding unnecessary try-except blocks

5.

You have a list of 5 retrieved documents with initial scores. You want to re-rank them using a machine learning model that outputs a relevance score. Which approach best improves the final ranking?

1. Use the model scores to replace initial scores and sort descending.
2. Combine initial and model scores by averaging, then sort descending.
3. Sort only by initial scores, ignoring model scores.
4. Randomly shuffle results to avoid bias.

hard

A. Combine initial and model scores by averaging, then sort descending

B. Use the model scores to replace initial scores and sort descending

C. Sort only by initial scores, ignoring model scores

D. Randomly shuffle results to avoid bias

Solution

1. Step 1: Understand re-ranking with model scores

   Replacing scores fully may ignore useful initial info; combining scores balances both.

2. Step 2: Evaluate options for best ranking

   Averaging initial and model scores uses all info, improving relevance and stability.

3. Final Answer:

   Combine initial and model scores by averaging, then sort descending -> Option A

4. Quick Check:

   Combine scores for best re-ranking [OK]

Hint: Blend initial and model scores for better ranking [OK]

Common Mistakes:

• Replacing scores blindly losing initial info
• Ignoring model scores completely
• Random shuffling breaks relevance