Learn Before
How can a search method return the wrong result even when its score order is correct?
Question: In one to three sentences, explain how a system can still produce an inferior output even if its scoring rule ranks the truly best candidate above that output.
Sample answer: The search procedure may be approximate, so it does not guarantee that it will explore enough possibilities to find the globally best candidate. Even with a correct scoring rule, the search can stop on a lower-scoring option and return that one instead.
Key points:
- The search method is approximate
- It may miss the globally best candidate
- The scoring rule itself can still be correct
Rubric: Full credit: mentions that the search procedure is approximate and can fail to find the true best candidate even when the scoring rule ranks it higher. Partial credit: refers to search failure without clearly stating that the search is approximate. No credit: blames the scoring rule rather than the search process.
0
1
Tags
Machine Learning
Deep Learning
Supervised Learning
Dive into Deep Learning @ D2L
Data Science
Machine Learning Strategy
Machine Learning Yearning @ DeepLearning.AI
Related
A model assigns a higher score to output y_best than to y_found, but the system still returns y_found. What is the most likely issue?
True or False: If a beam search may miss the best candidate, increasing the beam width is a sensible way to reduce that risk.
When a scoring model prefers the correct answer, a _____ can still return a different one if it searches only part of the candidate space.
Match each notation to its meaning when diagnosing a search problem in inference.
Order the steps for telling apart a search problem from a scoring problem.
Why a Better Score Does Not Always Produce the Best Output
Decoding is the likely source of the translation errors.
How can a search method return the wrong result even when its score order is correct?
If a decoder chooses the wrong output even though the score model prefers the right one, what should be improved?
True or False: A search algorithm issue occurs when the search procedure returns the highest-scoring candidate even though a lower-scoring option would be better.