Learn Before
Choosing a Solution-Checking Method
A startup is building a system to generate short, positive product descriptions. For each product, the system creates 10 candidate descriptions. The company has very limited computing power and only a small collection of example descriptions to learn from. They need to implement a final component to select the best description from the 10 candidates. Would a checker that relies on a set of simple, predefined rules (e.g., 'must contain the product name', 'must be under 15 words', 'must not contain negative words') be a more suitable choice for this startup than a checker that learns complex patterns from data? Justify your answer by considering the startup's specific constraints.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Evaluation in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
Majority Voting as a Verification Heuristic
A system is designed to answer simple factual questions. For any given question, it generates a list of five potential answers. The system must then choose the best final answer from this list. Which of the following methods for choosing the final answer relies on a simple, predefined rule rather than on complex patterns learned from a large dataset?
Choosing a Solution-Checking Method
A system designed to solve math problems generates multiple final answers. To select the best one, it uses a verifier that simply checks which answer is most frequently generated. This type of verifier is considered a complex, data-driven model because its selection is determined by the data (the generated answers).