Formula for Problem Decomposition in Least-to-Most Prompting
In the context of least-to-most prompting, the decomposition of an initial problem, , into a set of sub-problems, , is represented by the formula . The function in this equation symbolizes the decomposition method used to break down the original problem into its constituent parts.
0
1
Tags
Ch.3 Prompting - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Related
Symbol p0 in Problem Decomposition
A complex reasoning problem is presented to a large language model. The goal is to break the problem down into a series of simpler, sequential sub-problems to guide the model to the correct answer.
Problem: "Alice, Bob, and Carol are a doctor, a lawyer, and an engineer, but not necessarily in that order. The doctor is Carol's sister. Bob is not the lawyer. Who is the engineer?"
Which of the following sequences of sub-problems represents the most effective decomposition and problem-solving path for the model to follow?
Critiquing a Problem-Solving Path
Analyzing a Flawed Problem Decomposition Strategy
To solve a complex reasoning problem, it is often broken down into a series of simpler sub-problems that are solved sequentially. For the main problem below, arrange the provided sub-problems into the most logical and effective sequence for a model to follow.
Main Problem: A company has two data centers, A and B. Data center A has 500 servers, and each server consumes 400 watts of power. Data center B has 300 servers, and each server consumes 600 watts. If the cost of electricity is $0.12 per kilowatt-hour (kWh), what is the total daily electricity cost for both data centers combined?
Formula for Problem Decomposition in Least-to-Most Prompting
A complex computational problem is broken down into three distinct, smaller parts to make it easier to solve. Using the standard formal notation for problem decomposition, which of the following correctly represents the set of these three resulting parts?
When an initial problem, denoted as , is broken down into a series of
nsmaller parts, the standard formal notation used to represent the collection or set of these resulting parts is ____.In the formal notation for problem decomposition, the expression
{p_1, ..., p_n}signifies the specific, ordered sequence in which the sub-problems derived from an initial problemp_0must be solved.Formula for Problem Decomposition in Least-to-Most Prompting
Learn After
Recursive Formula for Sub-Problem Generation
Formula for Sequential Sub-Problem Generation
A user wants a language model to write a comprehensive travel guide for Paris. To manage this complex task, they first prompt the model to create a list of key sections to cover, such as 'Famous Landmarks,' 'Local Cuisine,' and 'Transportation Tips.' This process of breaking down the main task into a set of smaller, structured parts can be represented by the formula {p_1, ..., p_n} = G(p_0). In this scenario, what does the function G represent?
Decomposition of a Planning Task
Explaining the Problem Decomposition Formula