Also known as: Least to most Prompting
Least-to-most prompting is a prompt chaining method that decomposes a complex task into a sequence of simpler subproblems. Each step uses the result of the previous step as context for the next, so the model builds toward a final answer through ordered intermediate solutions. It is useful when a task is too complex to solve reliably in a single prompt.
A form of prompt chaining that divides complex problems into an ordered set of simpler problems. For example, here's a least-to-most prompting strategy for a certain problem: 1. Divide a complex problem into an ordered list of simpler sub-problems. For this example, assume it is three sub-problems. 2. Prompt 1: Ask the LLM to solve the first sub-problem. The LLM returns Response 1. 3. Prompt 2: Integrate all or part of Response 1 into the prompt to solve the second sub-problem. The LLM returns Response 2. 4. Prompt 3: Integrate all or part of Response 2 into the prompt to solve the third sub-problem. The LLM's response to Prompt 3 is the "final" answer to the initial complex problem. Note that each step depends on the solution to the preceding step. Contrast with tree-of-thought prompting.