Challenge: Reward-guided search methods have shown potential in enhancing tool-using agents . however, there is a lack of reliable evaluation benchmarks for PRMs in tool-use settings .
Approach: They propose a large-scale benchmark specifically designed to evaluate PRMs for tool-using agents.
Outcome: The proposed benchmark shows that tool reward models perform better in tool-using environments.

Similar Papers

PRMBench: A Fine-grained and Challenging Benchmark for Process-Level Reward Models (2025.acl-long)

Copied to clipboard

Challenge: Recent large language models (LLMs) have achieved significant performance in complex reasoning tasks such as mathematics and code generation.
Approach: They propose a process-level benchmark specifically designed to assess the fine-grained error detection capabilities of PRMs.
Outcome: The proposed model measures the accuracy, soundness, and sensitivity of 25 models across open-source and closed-source large language models.
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.
ToolRM: Towards Agentic Tool-Use Reward Modeling (2026.findings-acl)

Copied to clipboard

Challenge: lack of reliable reward models for tool-use tasks has limited progress toward agentic AI . recent advances in agentic artificial intelligence are driven by tool-using capabilities of large language models.
Approach: They propose a pipeline that constructs pairwise preference data using rule-based scoring and multidimensional sampling to build lightweight reward models.
Outcome: The proposed model outperforms existing models on tool calling tasks with higher accuracy.
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.
Aligning Agents via Planning: A Benchmark for Trajectory-Level Reward Modeling (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) evolve into agentic systems capable of autonomous tool invocation and complex reasoning.
Approach: They propose a trajectory-level preference benchmark to evaluate judges' ability to distinguish preferred versus distractor agent trajectories in tool-integrated environments.
Outcome: The proposed benchmark evaluates how well judges distinguish preferred versus distractor agent trajectories in complex tool-using scenarios.
PRInTS: Reward Modeling for Long-Horizon Information Seeking (2026.acl-long)

Copied to clipboard

Challenge: Existing PRMs cannot capture richer dimensions of information-seeking steps, such as tool interactions and reasoning over tool outputs.
Approach: They propose a generative PRM trained with dual capabilities that compresses the growing context while preserving essential information for step evaluation.
Outcome: PRInTS improves on FRAMES, GAIA, and WebWalkerQA models while preserving essential information for step evaluation.
ToolHop: A Query-Driven Benchmark for Evaluating Large Language Models in Multi-Hop Tool Use (2025.acl-long)

Copied to clipboard

Challenge: Effective evaluation of multi-hop tool use is critical for analyzing the understanding, reasoning, and function-calling capabilities of large language models.
Approach: They propose a dataset that provides rigorous evaluation of multi-hop tool use.
Outcome: The proposed model achieves 49.04% accuracy across five model families.
ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling (2026.acl-long)

Copied to clipboard

Challenge: Existing research on inference scaling focuses on unstructured output generation tasks, such as mathematical problems.
Approach: They propose an inference-scaling framework that combines fine-grained beam search with ToolPRM, a process reward model scoring each intra-call decision.
Outcome: The proposed framework outperforms outcome and coarse-grained reward models in predictive accuracy and yields consistent test-time gains on multiple function-calling benchmarks.
The Lessons of Developing Process Reward Models in Mathematical Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: a recent study shows that process reward models can make mistakes, leading to wrong conclusions.
Approach: They propose a consensus filtering mechanism that integrates MC estimation with LLM-as-a-judge to improve model performance and data efficiency.
Outcome: The proposed model outperforms existing open-source alternatives and provides practical guidelines for future research.
Dynamic and Generalizable Process Reward Modeling (2025.acl-long)

Copied to clipboard

Challenge: Existing Process Reward Models lack cross-domain generalization and focus on feedback results.
Approach: They propose a process reward model that uses a reward tree to capture and store fine-grained, multi-dimensional reward criteria.
Outcome: The proposed model performs on prevailing benchmarks and out-of-distribution scenarios.

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