Tree of Problems: Improving structured problem solving with compositionality (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable performance across multipletasks through in-context learning. |
| Approach: | They propose a Tree of Problems (ToP) that is a simpler version of Tree of Thoughts (toT) they propose 'in-context learning' is the ability of Large Language Models (LLMs) to perform a task with the help of a few demonstrations within their context. |
| Outcome: | The proposed approach outperforms ToT and GoT and performs better on complex reasoning tasks. |
Similar Papers
On the Empirical Complexity of Reasoning and Planning in LLMs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Evidence shows that the relative performance of CoT, ToT, and their variants may vary from task to task. |
| Approach: | They propose to use chain-of-thought (CoT), tree-of thought (ToT), and related techniques to solve complex reasoning tasks with Large Language Models. |
| Outcome: | The proposed methods outperform the linear structure of CoT on hard reasoning tasks. |
A Tree-of-Thoughts to Broaden Multi-step Reasoning across Languages (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for eliciting Large Language Models (LLMs) to solve complex tasks are limited to English due to the imbalance in the distribution of pre-training data. |
| Approach: | They propose a method for aligning Cross-lingual CoT reasoning across languages . they propose eliciting Large Language Models to solve complex tasks step-by-step . |
| Outcome: | The proposed method outperforms existing prompting methods by reducing interactions and achieving state-of-the-art performance. |
GoT: Effective Graph-of-Thought Reasoning in Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have been advancing at an unprecedented pace. |
| Approach: | They propose a graph-based approach which models human thought processes as a chain and as 'graphs' by representing thought units as nodes and connections between them as edges, they capture the non-sequential nature of human thinking and allows for a more realistic modeling of thought processes. |
| Outcome: | The proposed model improves on a text-only reasoning task and a multimodal reasoning task. |
Tree-of-Prompts: Abstracting Control-Flow for Prompt Optimization (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing prompt optimization methods struggle with disjoint cases in complex tasks. |
| Approach: | They propose a tree-of-prompts structure which expands child prompts from parent prompts . they propose to use a nested if-else structure to address varying similarities and complexities . |
| Outcome: | The proposed tree-of-prompts outperforms PromptAgent and MoP on Gorilla, MATH and subset of BBH benchmarks. |
Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs (2024.findings-acl)
Copied to clipboard
Bowen Jin, Chulin Xie, Jiawei Zhang, Kashob Kumar Roy, Yu Zhang, Zheng Li, Ruirui Li, Xianfeng Tang, Suhang Wang, Yu Meng, Jiawei Han
| Challenge: | Existing studies suggest augmenting LLMs with external text corpora to alleviate hallucination problems. |
| Approach: | They propose to augment large language models with text units retrieved from external knowledge corpora to alleviate the issue. |
| Outcome: | The proposed framework outperforms baselines on GRBench with three LLMs and shows that iterative reasoning outperformed the baselines. |
COCO-Tree: Compositional Hierarchical Concept Trees for Enhanced Reasoning in Vision-Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to improve compositional reasoning in vision language models are resource-intensive or do not provide an interpretable reasoning process. |
| Approach: | They propose a method that augments VLM outputs with carefully designed neurosymbolic concept trees learned from LLMs to improve VLM’s linguistic reasoning. |
| Outcome: | Empirical results show that COCO-Tree significantly improves compositional generalization and provides a rationale behind VLM predictions. |
Chain-in-Tree: Back to Sequential Reasoning in LLM Tree Search (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models excel at tasks such as mathematical and commonsense reasoning, but their performance improves further when additional test-time compute is allocated. |
| Approach: | They propose a plug-in framework that decides when to branch during search instead of expanding at every step. |
| Outcome: | The proposed framework reduces token generation, model calls, and runtime by 75-85% on GSM8K and Math500, with negligible or no accuracy loss. |
Beyond Chain-of-Thought: A Survey of Chain-of-X Paradigms for LLMs (2025.coling-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown impressive reasoning abilities when prompted with Chain-of-Thought (CoT). |
| Approach: | They propose to categorize Chain-of-X methods by taxonomies of nodes, i.e., the X in CoX, and application tasks, and then categorise them by taxanomies and discuss potential future directions. |
| Outcome: | The proposed methods are categorised by taxonomies of nodes, i.e., the X in CoX, and application tasks. |
Dynamic Parallel Tree Search for Efficient LLM Reasoning (2025.acl-long)
Copied to clipboard
Yifu Ding, Wentao Jiang, Shunyu Liu, Yongcheng Jing, Jinyang Guo, Yingjie Wang, Jing Zhang, Zengmao Wang, Ziwei Liu, Bo Du, Xianglong Liu, Dacheng Tao
| Challenge: | Recent methods focus on search accuracy while overlooking computational efficiency. |
| Approach: | They propose a parallelism framework that dynamically optimizes reasoning path in inference. |
| Outcome: | The proposed framework improves efficiency by 2-4 on average while maintaining or even surpassing existing reasoning algorithms in accuracy. |
Internal Chain-of-Thought: Empirical Evidence for Layer‐wise Subtask Scheduling in LLMs (2025.emnlp-main)
Copied to clipboard
| Challenge: | et al., 2024) show large language models exhibit internal chain-of-thought, meaning they decompose and execute composite tasks layer-by-layer. |
| Approach: | They propose a method to decode hidden states using LogitLens . they also propose 'chain of thought' to decompose and execute composite tasks . |
| Outcome: | The proposed method decodes hidden states and shows consistent execution pattern . it opens avenues for fine-grained, instruction-level activation steering. |