Challenge: Recent studies have raised concerns regarding the hallucination and flaws in their reasoning process.
Approach: They propose a framework to learn planning-based reasoning through Direct Preference Optimization on collected trajectories, which are ranked according to synthesized process rewards.
Outcome: The proposed model surpasses GPT-3.5-Turbo on logical reasoning benchmarks on a set of logically-based reasoning tasks.

Similar Papers

Enhancing Logical Reasoning in Language Models via Symbolically-Guided Monte Carlo Process Supervision (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models have shown strong performance in many reasoning benchmarks, but lack robust planning or symbolic abstractions.
Approach: They propose to synthesize high-quality symbolic reasoning trajectories with stepwise pseudo-labels at scale via Monte Carlo estimation.
Outcome: The proposed method can be trained on high-quality symbolic reasoning trajectories with stepwise pseudo-labels at scale using Monte Carlo estimation.
Reasoning with Language Model is Planning with World Model (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable reasoning capabilities, particularly with Chain-of-Thought-style prompts.
Approach: They propose a framework that repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search)
Outcome: The proposed framework repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search) it achieves optimum balance between exploration and exploitation, while achieving high-reward reasoning paths efficiently.
Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards (2026.acl-long)

Copied to clipboard

Challenge: Existing PRM datasets are expensive to construct and limited to the mathematical domain.
Approach: They propose a method to generate a corpus of one million reasoning steps using the Planning Domain Definition Language.
Outcome: The proposed model generates a corpus of approximately one million reasoning steps across various PDDL domains and trains them.
A Comprehensive Survey of Process Reward Models: Data Generation, Model Construction, and Usage (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have advanced reasoning ability, yet conventional alignment remains dominated by outcome reward models that judge only final answers.
Approach: They summarize applications across math, code, text, multimodal reasoning, robotics, and agents . goal is to clarify design spaces, reveal open challenges, and guide future research toward fine-grained, robust reasoning alignment.
Outcome: The proposed model enables finer credit assignment, richer diagnostics, and improved robustness.
Teaching LLMs to Plan, Not Just Solve: Plan Learning Boosts LLMs Generalization in Reasoning Tasks (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for reinforcement learning (RL) on self-generated data are limited in many domains.
Approach: a new framework combines plan-based search with Step-level Advantage Preference Optimization to optimize plan learning.
Outcome: The proposed framework improves in-domain performance and out-of-domain benchmarks.
Reasoning Paths Optimization: Learning to Reason and Explore From Diverse Paths (2024.findings-emnlp)

Copied to clipboard

Challenge: Advanced models such as OpenAI o1 exhibit impressive problem-solving capabilities, but they may still falter on more complex problems, making errors that disrupt their reasoning paths.
Approach: They propose a framework that encourages favorable branches at each reasoning step while penalizing unfavorable ones, enhancing the model’s overall problem-solving performance.
Outcome: The proposed framework improves reasoning performance on multi-step reasoning tasks such as math word problems and science-based exam questions.
LLM Reasoning as Trajectories: Step-Specific Representation Geometry and Correctness Signals (2026.acl-long)

Copied to clipboard

Challenge: Existing models generate tokens by updating high-dimensional representations and decoding from them at each timestep.
Approach: They propose a framework that allows reasoning correction and length control based on derived ideal trajectories.
Outcome: The proposed model can predict correctness and length control based on ideal trajectories.
R-PRM: Reasoning-Driven Process Reward Modeling (2025.emnlp-main)

Copied to clipboard

Challenge: Existing Process Reward Models (PRMs) output evaluation scores directly, limiting both learning efficiency and evaluation accuracy.
Approach: They propose a Reasoning-Driven Process Reward Modeling (R-PRM) which activates inherent reasoning to enhance process-level evaluation.
Outcome: The proposed model outperforms baseline models on ProcessBench and PRMBench by 13.9 and 8.5 F1 scores.
PLAN-TUNING: Post-Training Language Models to Learn Step-by-Step Planning for Complex Problem Solving (2025.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that decomposing complex problems into simple subtasks has significantly boosted the performance of large language models (LLMs).
Approach: They propose a unified post-training framework that distills synthetic task decompositions and fine-tunes smaller LLMs via supervised and reinforcement-learning objectives to improve complex reasoning.
Outcome: The proposed framework outperforms strong baselines on GSM8k and MATH benchmarks and shows that it can improve generalization capabilities on out-of-domain datasets.
An Efficient and Precise Training Data Construction Framework for Process-supervised Reward Model in Mathematical Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for constructing process supervision training data are costly or suffer from poor quality.
Approach: They propose a framework called EpicPRM which annotates each intermediate reasoning step based on its quantified contribution and uses an adaptive binary search algorithm to enhance annotation precision and efficiency.
Outcome: The proposed framework improves annotation precision and efficiency and can be used to train a high-quality training dataset with 50k annotated intermediate steps.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations