Formula for a Candidate Solution Set
A search algorithm can efficiently explore the space of possible output sequences to generate a set of candidate solutions. This set of candidate solutions is formally represented as , where each represents an individual candidate solution.

0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Related
Formula for a Candidate Solution Set
A developer is building a text generation system to find the single most probable 20-word summary of a given document. Their proposed method is to generate every possible 20-word sequence, calculate the probability of each one, and then select the sequence with the highest probability. Which statement best analyzes the fundamental limitation of this approach?
Selecting a Generation Strategy for a Real-Time Application
The Role of Search Algorithms in Text Generation
An engineer is developing a system to generate a 10-word sentence. They are comparing two approaches:
- Approach 1: Systematically generate every possible 10-word sequence from the system's vocabulary, calculate a probability score for each, and select the one with the highest score.
- Approach 2: Generate the first word, then, given that first word, generate the most probable second word, and so on, making a locally optimal choice at each of the 10 steps.
Which statement best analyzes the relationship between these two approaches?
Trade-offs of Greedy Search in Inference
Learn After
A language model is used to generate potential summaries for a long document. The model produces 5 different summaries for consideration. If this collection of summaries is treated as a set of candidate solutions, which expression below correctly represents this specific set?
Given the formal representation of a set of potential solutions, , match each symbol to its correct description.
Representing a Set of Generated Textual Responses