The Computational Challenge of Early Sequence Generation
Early systems for tasks like speech recognition or machine translation faced a significant challenge: for any given input, the number of possible output sequences could be astronomically large. Explain why exhaustively evaluating every single possible output sequence was not a feasible strategy. Then, describe the fundamental principle behind the techniques developed to overcome this computational barrier, without naming specific algorithms.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Computing Sciences
Foundations of Large Language Models Course
Analysis in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
Historical Focus on Search Algorithms due to Weaker Models
Imagine you are designing an early system to translate sentences. For a single 10-word sentence, your system identifies 5 possible translations for each word. This results in nearly 10 million (5^10) potential full-sentence translations. Evaluating the quality of every single one of these potential sentences to find the best one would be computationally prohibitive. Which of the following statements best identifies the core problem that pioneering search techniques were developed to solve in this context?
The Computational Challenge of Early Sequence Generation
Optimizing a Route-Planning Algorithm
Impact of Powerful Deep Learning Models on Search Algorithm Requirements