| 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. |
Similar Papers
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. |
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. |
LongDPO: Unlock Better Long-form Generation Abilities for LLMs via Critique-augmented Stepwise Information (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in large language models have improved their capacity to handle long text inputs, but current models still exhibit unsatisfactory performance in long-form generation. |
| Approach: | They propose a method to enhance long-form text generation through step-level supervision by leveraging Monte Carlo Tree Search to collect stepwise preference pairs and employ a global memory pool to maintain factual accuracy. |
| Outcome: | The proposed method improves performance on long-form generation benchmarks while maintaining lossless performance on several general benchmarks. |
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. |
FastDiSS: Few-step Match Many-step Diffusion Language Model on Sequence-to-Sequence Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing models that correct errors in the model but lack a high quality of output . a novel training framework that matches inference noise to the model's inference signal improves performance . |
| Approach: | They propose a training framework that matches inference noise to model errors by perturbing the self-conditioning signal to match inference errors. |
| Outcome: | The proposed framework surpasses standard continuous diffusion models while providing 400x faster inference speed. |
Learning from Contrasts: Synthesizing Reasoning Paths from Diverse Search Trajectories (2026.acl-long)
Copied to clipboard
| Challenge: | MCTS methods retain only the single highest-reward trajectory, discarding comparative signals present in the many explored paths. |
| Approach: | They propose a framework that transforms supervision extraction into a synthesis procedure. |
| Outcome: | The proposed framework matches or exceeds baselines on 60K CRPS-synthesized examples on out-of-domain benchmarks. |
The Data Frontier for Large Language Models: Selection, Synthesis, and Tools (2026.acl-tutorials)
Copied to clipboard
| Challenge: | acquiring and curating high-quality training data remains a significant bottleneck . acquiring such high-quality data is a key challenge for researchers and practitioners . |
| Approach: | This tutorial provides a comprehensive and practical guide to the state-of-the-art in data research directions for LLMs. |
| Outcome: | The tutorial covers methods for curating the most valuable information from vast, noisy datasets and the synthetic data revolution. |
Let’s Synthesize Step by Step: Iterative Dataset Synthesis with Large Language Models by Extrapolating Errors from Small Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | *Data Synthesis* is a promising way to train a small model with very little labeled data. |
| Approach: | They propose a framework that iteratively extrapolates the errors of a small model trained on a real-world validation dataset using a large language model. |
| Outcome: | The proposed framework reduces the gap between the synthesized dataset and the real data . it improves on multiple NLP tasks and on large models with human-annotated data. |
KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing code-focused resources typically fail to ensure either the breadth of coverage or verifiable correctness. |
| Approach: | They propose a synthetic dataset that provides high-quality, verifiable training data for Large Language Models for coding. |
| Outcome: | The proposed dataset surpasses Qwen2.5-Coder-32B-Instruct and DeepSeek-R1-Distill-Llama-70B in performance on coding benchmarks. |
MuTIS: Enhancing Reasoning Efficiency through Multi Turn Intervention Sampling in Reinforcement Learning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for training large reasoning models with long chain-of-thought (CoT) are limited by the number of parameters and the complexity of the model. |
| Approach: | They propose a framework that leverages multi-turn interventions to produce concise reasoning chains and demonstrates strong scalability. |
| Outcome: | The proposed framework breaks the accuracy-efficiency trade-off by producing concise reasoning chains and demonstrating strong scalability on 7B models. |