Beam Search as an Approximate Search Method
Beam search is a heuristic search procedure that keeps only the top K partial candidates after each expansion step. Since it prunes away many possibilities, it can miss the globally best output and is therefore not exact.
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
Beam Search as an Approximate Search Method
Why is it usually impractical to score every possible output sequence and choose the best one exactly?
True or False: Approximate search methods used during scored inference are guaranteed to return the highest-scoring result.
Because checking every possible output is impractical, a scored inference system must use a(n) _____ method to locate a high-scoring result.
Why is exact search impractical in a scored sentence-generation system?
Approximate search methods in scored inference are guaranteed to return the candidate S with the highest value of Score_A(S).
Search target in scored decoding
Match each inference term to its role in a scored output system.
Order the steps a speech transcription system uses to convert a recorded message into text.
Meaning of a Conditional Score in Classification
If each of N positions can be filled by any one of 50,000 words, then the number of distinct sequences of length N is (50,000)^N.
Approximate Search and Score Maximization
Match each search challenge to the concept that best describes it.
Order the reasoning steps that explain why approximate search is needed in scored inference.
Why exhaustive search is impractical in scored inference
Find out why an approximate decoder missed a better-scoring output.
State the cost of approximate search in large-scale scoring problems.
Learn After
What set of candidates does beam search keep after each expansion?
True or False: Beam search is guaranteed to return the highest-scoring sequence under its scoring rule.
Beam search is a form of _____ search that keeps only the K highest-scoring partial candidates at each step.
In beam search, which partial candidates are kept after each expansion step?
Beam search is always guaranteed to return the sequence with the highest value of Score_A.
In beam search, the algorithm retains only the top _____ partial candidates at each step.
Match each beam-search concept with its description.
Put the beam-search inference steps in a sensible order.
Why is beam search considered approximate rather than exact?
Beam Search as an Approximate Decoder
Beam search may fail to _____ the sequence with the maximum Score_A(S).
Match each beam search property to its main consequence.
Put the beam search reasoning in the right order.
Why beam search is useful but not exact during decoding
Why a beam-search run can miss the best-scoring result
Beam search does not guarantee the best sequence