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. |
Similar Papers
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 . |
Reason-Code: Reliable Code Generation via Test-Driven Monte Carlo Tree Search (2026.acl-industry)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are widely used for code generation, but their performance degrades on complex tasks. |
| Approach: | They propose an inference-time framework that formulates code generation as a search process guided by execution feedback. |
| Outcome: | The proposed framework improves reliability without paying full cost of additional sampling under strict latency budgets. |
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. |
FastMCTS: A Simple Sampling Strategy for Data Synthesis (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for generating multi-step reasoning data rely on rejection sampling, which generates trajectories independently and suffers from inefficiency and imbalanced sampling across problems of varying difficulty levels. |
| Approach: | They propose a data synthesis strategy inspired by Monte Carlo Tree Search . it offers step-level evaluation signals and promotes balanced sampling . |
| Outcome: | Experiments show that FastMCTS generates 30% more correct reasoning paths than rejection sampling. |
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 . |
CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | coding tasks require generated code to be fully executable and functionally correct . current agentic approaches struggle with multi-stage planning, generating, and debugging . |
| Approach: | They propose a framework for LLM agents to efficiently explore the search space in different stages of the code generation process. |
| Outcome: | The proposed framework achieves top results on 7 code generation benchmarks and a 31.9% solving rate on the SWEBench benchmark. |
Tree-of-Code: A Self-Growing Tree Framework for End-to-End Code Generation and Execution in Complex Tasks (2025.findings-acl)
Copied to clipboard
| Challenge: | Effectively and efficiently handling complex realworld problems has become a key focus across industry and academia. |
| Approach: | They propose a tree-of-code framework that generates nodes through self-supervision and combines prompt and model exploration in a GT-free setting. |
| Outcome: | Experiments on two datasets with ten popular zero-shot LLMs show that Tree-of-Code boosts accuracy by nearly 20% over CodeAct with fewer than 1/4 turns. |
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. |
Think More, Hallucinate Less: Mitigating Hallucinations via Dual Process of Fast and Slow Thinking (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have focused on the issue of hallucination in large language models. |
| Approach: | They propose a framework that allows an explicit slow thinking generation process for mitigating hallucinations during inference. |
| Outcome: | The proposed framework outperforms baseline approaches on English and Chinese datasets. |
MCTS-RAG: Enhancing Retrieval-Augmented Generation with Monte Carlo Tree Search (2025.findings-emnlp)
Copied to clipboard
| Challenge: | MCTS-RAG combines structured reasoning with adaptive retrieval . compared to conventional MCTLs, MCTR-RAg relies on internal model knowledge without external facts . |
| Approach: | a new approach integrates retrieval-augmented generation and Monte Carlo Tree Search to enhance reasoning capabilities of small language models. |
| Outcome: | MCTS-RAG integrates retrieval-augmented generation and Monte Carlo Tree Search to improve reasoning paths. |