Learn Before
Analyzing Code Generation as a Search Problem
An AI-powered coding assistant is tasked with writing a function to sort a list of numbers. It generates three different implementations of the sorting algorithm. To select the best one, it runs a series of tests on each implementation, measuring its execution speed and memory usage. The implementation that is fastest while using the least memory is chosen. Analyze this entire process by framing it as a search problem. In your analysis, identify and describe the following components: 1) the search space, 2) the evaluation metric used to define the 'best' solution, and 3) the search strategy.
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
Self-Consistency as a Minimum Bayes Risk Search Process
Framing Answer Selection as a Search Problem
An LLM generates five different step-by-step solutions to a complex algebra problem. A separate verification model then evaluates each solution by checking if the final answer is correct and if each intermediate step logically follows from the previous one. The solution with the highest score from the verifier is chosen as the final output. Match the components of this process, when framed as a search problem, to their correct descriptions.
Analyzing Code Generation as a Search Problem
Best-of-N Sampling
Best-of-N Sampling (Parallel Scaling)
Search Algorithm for Solution Selection