Decomposed Prompting (DECOMP)

Decomposed Prompting is similar to Least-to-Most Prompting, but uses Few-Shot Chain-of-Thought (CoT) to guide the LLM in breaking down complex problems into sub-problems. This modular framework accommodates diverse decomposition structures, including recursion and hierarchical decomposition, besides the linear left-to-right decomposition of Least-to-Most Prompting. When evaluated on various programming and question-answering tasks, DECOMP surpasses the Least-to-Most method in performance.

Footnotes

1. Tushar Khot. (2023). Decomposed Prompting: A Modular Approach for Solving Complex Tasks. ↩