Learn Before
Beam search is one example of an approximate search algorithm used to optimize a scoring function during inference.
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
What does beam search retain at each step of the search process when optimizing a scoring function?
True or False: Beam search is guaranteed to find the output that maximizes the scoring function.
Beam search is an example of an _____ search algorithm that keeps only the top K candidates during the search process.
During beam search, which candidates are retained at each step of the search process?
Beam search is guaranteed to find the output S that maximizes Score_A(S).
Beam search keeps only the top _____ candidates during the search process.
Match each beam search term to its correct description.
Arrange the steps of applying approximate search in a scored inference pipeline.
Why is beam search classified as an 'approximate' search algorithm rather than an exact one?
Beam search is one example of an approximate search algorithm used to optimize a scoring function during inference.
Because beam search is approximate, it is not guaranteed to find the output that _____ Score_A(S).
Match each property of beam search to the consequence it produces.
Order the reasoning steps that explain why beam search may fail to return the globally optimal output.
Explain the relationship between beam search approximations and scoring function optimization during inference.
Diagnosing search limitations when beam search outputs a sub-optimal candidate.
Describe the limitation of using beam search to optimize a scoring function during inference.