ThoughtSculpt: Reasoning with Intermediate Revision and Search (2025.findings-naacl)
Copied to clipboard
| Challenge: | THOUGHTSCULPT is a general reasoning and search method for tasks with outputs that can be decomposed into components. |
| Approach: | They propose a general reasoning and search method for tasks with outputs that can be decomposed into components. |
| Outcome: | THOUGHTSCULPT outperforms state-of-the-art reasoning methods on three tasks . authors show that distinct prompting strategies can influence the performance of LLMs . |
Similar Papers
RethinkMCTS: Refining Erroneous Thoughts in Monte Carlo Tree Search for Code Generation (2025.emnlp-main)
Copied to clipboard
Qingyao Li, Wei Xia, Xinyi Dai, Kounianhua Du, Weiwen Liu, Yasheng Wang, Ruiming Tang, Yong Yu, Weinan Zhang
| Challenge: | Existing tree search methods neglect the underlying reasoning process, resulting in poor search quality. |
| Approach: | They propose a framework that systematically explores and refines the reasoning process for code generation by using a tree search engine and a reflection mechanism. |
| Outcome: | The proposed framework outperforms existing methods in the code generation domain. |
Socratic-MCTS: Test-Time Visual Reasoning by Asking the Right Questions (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent research in vision-language models has centered around the possibility of equipping them with implicit long-form chain-of-thought reasoning via distillation and reinforcement learning. |
| Approach: | They propose a Monte Carlo Tree Search-inspired algorithm that injects subquestion–subanswer pairs into the model’s output stream to elicit hidden knowledge and induce long reasoning traces. |
| Outcome: | The proposed method yields a 2% improvement on MMMU-PRO, including a significant 9% gain in Liberal Arts. |
DSG-MCTS: A Dynamic Strategy-Guided Monte Carlo Tree Search for Diversified Reasoning in Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown strong potential in complex reasoning tasks, but their performance often degrades, resulting in hallucinations, errors, and logical inconsistencies. |
| Approach: | They propose a framework that integrates multiple reasoning strategies to expand the reasoning space and a dynamic strategy selection mechanism that adapts to the task context. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods on a set of reasoning benchmarks. |
Monte Carlo Thought Search: Large Language Model Querying for Complex Scientific Reasoning in Catalyst Design (2023.findings-emnlp)
Copied to clipboard
| Challenge: | a goal-driven combinatorial search using large language models has not been explored in detail. |
| Approach: | They propose a Monte Carlo Tree Search-based approach that improves beyond state-of-the-art chain-of thought prompting variants to augment scientific reasoning. |
| Outcome: | The proposed approach improves over the best baseline by 25.8% and can augment scientist’s reasoning and discovery process with novel insights. |
From Complex to Simple: Unraveling the Cognitive Tree for Reasoning with Small Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to solve complex logical reasoning problems are cumbersome for language models. |
| Approach: | They propose to use iterative methodology to construct a cognitive tree using language models . they propose to generate multiple responses by utilizing in-context examples . |
| Outcome: | The proposed model achieves a performance level comparable to that of GPT-3.5 . the proposed model contains fewer parameters than 5% of the model with 175B parameters . |
PRISM-MCTS: Learning from Reasoning Trajectories with Metacognitive Reflection (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reasoning models are limited by inefficiency and computational redundancy . PRISM-MCTS integrates a process reward model with a dynamic shared memory . |
| Approach: | They propose a reasoning framework that integrates a process reward model with a dynamic shared memory. |
| Outcome: | PRISM-MCTS integrates a process reward model with a dynamic shared memory . it halves trajectory requirements on GPQA while surpassing MCTS-RAG and Search-o1 . |
Recursion of Thought: A Divide-and-Conquer Approach to Multi-Context Reasoning with Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to generate intermediate steps (CoT) are limited by the maximum context size due to various reasons. |
| Approach: | They propose a new inference framework that introduces several special tokens that the models can output to trigger context-related operations. |
| Outcome: | Extensive experiments with multiple architectures including GPT-3 show that the proposed framework significantly improves LMs’ inference capability. |
CoAT: Chain-of-Associated-Thoughts Framework for Enhancing Large Language Models Reasoning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | OpenAI-o1 enables ‘slow thinking’ because it is closer to the human thought process . |
| Approach: | They propose a new framework that integrates the Monte Carlo Tree Search algorithm and a dynamic mechanism for integrating new key information, termed ‘associative memory’. |
| Outcome: | The proposed framework improves performance on open-source multi-hop reasoning datasets and more than 15% gain on proprietary CRB dataset. |
Thought calibration: Efficient and confident test-time scaling (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for teaching language models to be economical with their token budgets have failed to achieve the desired results. |
| Approach: | They propose to calibrate a language model's growing body of thoughts to determine when new reasoning plateaus. |
| Outcome: | The proposed framework preserves model performance with up to 60% reduction in thinking tokens on in-distribution data, and up to 20% in out-of-difference data. |
Reason from Future: Reverse Thought Chain Enhances LLM Reasoning (2025.findings-acl)
Copied to clipboard
Yinlong Xu, Yanzhao Zheng, Shuoshuo Sun, Shuaihan Huang, Baohua Dong, Zhu Hangcheng, Ruohui Huang, Gang Yu, Hongxia Xu, Jian Wu
| Challenge: | Existing reasoning paradigms that focus on local optimum reasoning lack global perspective. |
| Approach: | They propose a bidirectional reasoning paradigm that generates reasoning paths by bidirectional planning and bottom-up reasoning accumulation. |
| Outcome: | The proposed reasoning paradigm outperforms conventional paradigms with higher accuracy and less searching space to solve complex tasks. |