ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling
About
Large language models (LLMs) excel at function calling, but inference scaling has been explored mainly for unstructured generation. We propose an inference-scaling framework for structured outputs that combines fine-grained beam search with \textbf{ToolPRM}, a process reward model scoring each intra-call decision (function name and argument filling). We build the first fine-grained intra-call supervision dataset via function masking, rollout collection, and step-level annotation. ToolPRM outperforms outcome and coarse-grained reward models in predictive accuracy and yields consistent test-time gains on multiple function-calling benchmarks. We further show that structured generation follows ``\textbf{explore more but retain less}'', since early JSON errors are unrecoverable.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Function Calling | Tool-Alpaca | F1 Score73.36 | 40 | |
| Function Calling | BFCL | Success Rate (Simple)80.5 | 29 | |
| Tool Calling | API-Bank L-1 v1 (test) | -- | 12 | |
| Tool Use | API-Bank L2 cleaned (test) | F1 (API Matching)87.32 | 5 |