Tree of Problems: Improving structured problem solving with compositionality
Armel Zebaze, Benoît Sagot, Rachel Bawden
2024-10-15

Summary
This paper talks about Tree of Problems (ToP), a new method designed to help large language models (LLMs) solve complex problems by breaking them down into simpler, similar tasks.
What's the problem?
While LLMs can perform well on many tasks, they still struggle with complex reasoning that requires step-by-step thinking. Existing methods like Tree of Thoughts (ToT) and Graph of Thoughts (GoT) try to tackle this by dividing problems into smaller parts, but they can be too complicated for some tasks. This makes it hard for LLMs to effectively solve these complex challenges.
What's the solution?
The authors propose ToP as a simpler alternative that organizes problems into a tree structure, where each branch represents a similar subproblem. This approach allows LLMs to focus on solving these easier components one at a time, which leads to better overall performance. Their experiments show that ToP outperforms both ToT and GoT, as well as the traditional Chain-of-Thought (CoT) method, especially on complex reasoning tasks.
Why it matters?
This research is important because it provides a more effective way for AI models to handle complicated problems. By simplifying the problem-solving process, ToP can help improve the accuracy and efficiency of LLMs in various applications, making them more useful in real-world situations.
Abstract
Large Language Models (LLMs) have demonstrated remarkable performance across multiple tasks through in-context learning. For complex reasoning tasks that require step-by-step thinking, Chain-of-Thought (CoT) prompting has given impressive results, especially when combined with self-consistency. Nonetheless, some tasks remain particularly difficult for LLMs to solve. Tree of Thoughts (ToT) and Graph of Thoughts (GoT) emerged as alternatives, dividing the complex problem into paths of subproblems. In this paper, we propose Tree of Problems (ToP), a simpler version of ToT, which we hypothesise can work better for complex tasks that can be divided into identical subtasks. Our empirical results show that our approach outperforms ToT and GoT, and in addition performs better than CoT on complex reasoning tasks. All code for this paper is publicly available here: https://github.com/ArmelRandy/tree-of-problems.