| Challenge: | Critical Step Optimization (CSO) focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success. |
| Approach: | They propose a method which focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success. |
| Outcome: | The proposed method outperforms the existing methods on GAIA-Text-103 and XBench-DeepSearch while requiring supervision at only 16% of trajectory steps. |
Similar Papers
Watch Every Step! LLM Agent Learning via Iterative Step-level Process Refinement (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent approaches to enhance agent performance focus on outcome rewards, which may lead to errors or suboptimal actions due to the absence of process supervision signals. |
| Approach: | They propose a step-level framework that provides detailed step-by-step guidance to enhance agent training by using Monte Carlo methods. |
| Outcome: | The proposed framework outperforms strong baselines on three tasks and shows that it is effective in augmenting efficiency and its applicability to diverse models. |
ATLAS: Agent Tuning via Learning Critical Steps (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing agent tuning approaches employ supervised finetuning on entire expert trajectories, but behavior-cloning of full traitories introduces expert bias and weakens generalization to states not covered by the expert data. |
| Approach: | They propose a method that finetunes LLMs on critical steps in expert trajectories and identifies and finetuns them on these steps with reduced costs. |
| Outcome: | The proposed method outperforms existing methods and open-source LLM agents on only 30% critical steps in extensive experiments. |
StepSearch: Igniting LLMs Search Ability via Step-Wise Proximal Policy Optimization (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent work has demonstrated unprecedented capabilities in sophisticated linguistic comprehension and generative tasks. |
| Approach: | They propose a framework for search LLMs that trains with step-wise proximal policy optimization method to improve QA performance. |
| Outcome: | The proposed framework outperforms global-reward benchmarks on multi-hop QA with a stepwise proximal policy optimization method and richer and more detailed intermediate search rewards and token-level process supervision. |
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. |
Process-Supervised Reward Models for Verifying Clinical Note Generation: A Scalable Approach Guided by Domain Expertise (2025.emnlp-main)
Copied to clipboard
Hanyin Wang, Chufan Gao, Qiping Xu, Bolun Liu, Guleid Hussein, Hariprasad Reddy Korsapati, Mohamad El Labban, Kingsley Iheasirim, Mohamed Hassan, Gokhan Anil, Brian Bartlett, Jimeng Sun
| Challenge: | Currently, no automated, scalable method exists to evaluate the quality of LLM-generated clinical notes, leaving manual evaluation the gold standard. |
| Approach: | They propose a framework for training PRMs to deliver step-level reward signals for LLM-generated clinical notes. |
| Outcome: | The proposed framework outperforms reasoning and non-reasoning models on key evaluations and selects physician-preferred clinical notes with 56.2% accuracy. |
STeCa: Step-level Trajectory Calibration for LLM Agent Learning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing work focuses on behavior cloning from expert demonstrations or preference learning through exploratory trajectory sampling, but these methods often struggle to address long-horizon tasks where suboptimal actions accumulate step by step, causing agents to deviate from correct task trajectories. |
| Approach: | They propose a framework for LLM-based agent learning that identifies suboptimal actions through a step-level reward comparison during exploration and constructs calibrated trajectories using LLM reflection. |
| Outcome: | The proposed framework outperforms existing methods in long-horizon tasks where suboptimal actions accumulate step by step, causing agents to deviate from correct task trajectories. |
Step Potential Advantage Estimation: Harnessing Intermediate Confidence and Correctness for Efficient Mathematical Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to RLVR provide sparse supervision since reward arrives only after the full generation is complete. |
| Approach: | They propose a step-level reward system that extracts confidence and correctness and combines them into a Step Potential signal that explicitly estimates reasoning state at each step. |
| Outcome: | The proposed method outperforms existing methods on multiple benchmarks and improves accuracy while reducing response length. |
SALT: Step-level Advantage Assignment for Long-horizon Agents via Trajectory Graph (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable capabilities, but their application to complex, multi-step, and long-horizon tasks remains challenging. |
| Approach: | They propose a framework that provides a finer-grained advantage assignment derived solely from outcome rewards. |
| Outcome: | The proposed framework provides a finer-grained advantage assignment, derived solely from outcome rewards. |
Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing (2024.emnlp-main)
Copied to clipboard
| 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. |
Save the Good Prefix: Precise Error Penalization via Process-Supervised RL to Enhance LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods rely on sparse outcome rewards, which fail to credit correct intermediate steps in partially successful solutions. |
| Approach: | They propose a process reward model that rewards correct steps only when they detect errors . they propose VPPO, which rewards the correct prefix and an erroneous suffix . |
| Outcome: | a new approach outperforms sparse-reward RL and prior PRM-guided baselines on Pass@1 and Pass@K . a process reward model (PRM) outperformed sparser-rebound RL on multiple reasoning benchmarks . |