Comparing Computational Challenges in AI Tasks
Consider two AI tasks. Task A is to classify an image into one of 10 predefined categories (e.g., 'cat', 'dog', 'car'). Task B is to generate a one-sentence summary of a given news article. Both tasks aim to find the single most probable output for a given input. Explain why the computational challenge of finding this most probable output is fundamentally different and significantly greater for Task B compared to Task A.
0
1
Tags
Ch.5 Inference - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Analysis in Bloom's Taxonomy
Cognitive Psychology
Psychology
Social Science
Empirical Science
Science
Related
Model-Specific Optimizations for LLM Inference
Modeling and Efficient Computation of Conditional Token Probabilities
Efficient Generation of Candidate Solutions via Search Algorithms
An AI research team is developing a new generative model for creating complex musical compositions. They find that while their model can accurately calculate the probability of any given short musical phrase, generating a full, high-quality, multi-minute symphony is computationally intractable because they cannot feasibly check every possible combination of notes to find the absolute best one. How does this team's challenge relate to the broader field of artificial intelligence?
Comparing Computational Challenges in AI Tasks
Identifying Common Computational Structures in AI
Accuracy-Efficiency Trade-off in LLM Inference