Loading...
Least-to-Most Prompting(LtM)
Progressive problem decomposition from simple to complex components
๐ฏ 30-Second Overview
Pattern: Problem decomposition strategy that solves complex tasks by breaking them into simpler subproblems solved sequentially
Why: Enables tackling complex problems by building solutions incrementally from simple to complex components
Key Insight: Decompose complex problem โ Solve simplest first โ Use previous solutions โ Build up to final answer
โก Quick Implementation
๐ Do's & Don'ts
๐ฆ When to Use
Use When
- โข Complex problems with clear hierarchical structure
- โข Multi-step reasoning with dependencies
- โข Mathematical proofs and derivations
- โข Programming problems with modular solutions
- โข Compositional reasoning tasks
Avoid When
- โข Simple problems solvable in one step
- โข Highly interconnected problems without clear decomposition
- โข Real-time applications requiring immediate answers
- โข Problems where context accumulation hurts performance
- โข When Chain-of-Thought is sufficient
๐ Key Metrics
๐ก Top Use Cases
References & Further Reading
Deepen your understanding with these curated resources
Academic Papers
Least-to-Most Prompting Enables Complex Reasoning in Large Language Models (Zhou et al., 2022)
Chain-of-Thought Prompting Elicits Reasoning in Large Language Models (Wei et al., 2022)
Decomposed Prompting: A Modular Approach for Solving Complex Tasks (Khot et al., 2022)
Maieutic Prompting: Logically Consistent Reasoning (Jung et al., 2022)
Contribute to this collection
Know a great resource? Submit a pull request to add it.
Least-to-Most Prompting(LtM)
Progressive problem decomposition from simple to complex components
๐ฏ 30-Second Overview
Pattern: Problem decomposition strategy that solves complex tasks by breaking them into simpler subproblems solved sequentially
Why: Enables tackling complex problems by building solutions incrementally from simple to complex components
Key Insight: Decompose complex problem โ Solve simplest first โ Use previous solutions โ Build up to final answer
โก Quick Implementation
๐ Do's & Don'ts
๐ฆ When to Use
Use When
- โข Complex problems with clear hierarchical structure
- โข Multi-step reasoning with dependencies
- โข Mathematical proofs and derivations
- โข Programming problems with modular solutions
- โข Compositional reasoning tasks
Avoid When
- โข Simple problems solvable in one step
- โข Highly interconnected problems without clear decomposition
- โข Real-time applications requiring immediate answers
- โข Problems where context accumulation hurts performance
- โข When Chain-of-Thought is sufficient
๐ Key Metrics
๐ก Top Use Cases
References & Further Reading
Deepen your understanding with these curated resources
Academic Papers
Least-to-Most Prompting Enables Complex Reasoning in Large Language Models (Zhou et al., 2022)
Chain-of-Thought Prompting Elicits Reasoning in Large Language Models (Wei et al., 2022)
Decomposed Prompting: A Modular Approach for Solving Complex Tasks (Khot et al., 2022)
Maieutic Prompting: Logically Consistent Reasoning (Jung et al., 2022)
Contribute to this collection
Know a great resource? Submit a pull request to add it.