
HW
Huifei Wang, Xinying Huang, Yiheng Sun, Yifan Yuan
· 1 min read
ResearcharXiv cs.CL
ReMCTS: Reflection-Enhanced Monte Carlo Tree Search for Code Generation
arXiv:2609.34717v1 Announce Type: new
Abstract: Open-weight large language models (LLMs) can generate function-level programs from natural-language prompts, but plausible candidates still fail on hidden semantics and repeat mistakes across repair attempts. We present ReMCTS, an execution-grounded, memory-augmented, LLM-guided MCTS-style search framework. It organizes program candidates as tree states, retains branch-local debugging context, retrieves failure experience across branches, and distinguishes failed checks from unavailable evidence. On HumanEval and MBPP-Sanitized, visible-test ReMCTS improves over direct generation in 8 of 10 model-dataset pairs under held-out evaluation, whereas proxy-only search is less stable. Controlled tree-search, sampling, repair, and memory ablations characterize the source and limits of these gains. A 30-task HumanEval-X C++ pilot further demonstrates compatibility with compiler-backed execution, but does not constitute a broad multilingual evaluation.
Original source
This story was published by arXiv cs.CL and written by Huifei Wang, Xinying Huang, Yiheng Sun, Yifan Yuan. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


