LLM reasoning / chain-of-thought
PRM
Superseded baseline#6 of 772 most-superseded · first seen May 31, 2023
Superseded — cited as a baseline and beaten by newer methods
7 papers critique it · 3 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites PRM as a baseline.
although PRMs can validate the output of LLMs more accurately than ORMs, they often require high quality annotated data
“However, key challenges remain, such as the difficulty of obtaining high-quality labels and the limited effectiveness of current PRM approaches”
“In our experiments, we find, however, that even state-of-the-art PRMs can be miscalibrated, assigning overly optimistic scores---particularly on challenging, out-of-distribution problems.”
“PRMs poorly approximate state values and reliability degrades with reasoning depth, suggesting credit assignment issues”
“Process Reward Models (PRMs) are bound by prohibitive annotation costs, while verifier-free proxies frequently yield sparse signals that lack awareness of the intermediate reasoning process.”
“PRM-based approaches require substantial computational resources for training step-level reward models and conducting multi-step inference processes”
“obtaining high-quality step-by-step annotations is challenging: current efforts relying on human annotation, Monte Carlo sampling, or LLM-as-a-judge are either costly or noisy.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating PRM. Values are copied from the source paper's tables — verify against the cited paper.
ReST-RL beats PRM
0.689 vs 0.516
ReST-MCTS (Value) beats PRM
20.2 vs 17.4
Accuracy · [GPT-3.5-turbo]
ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree SearchSCPRM beats PRM
92.91 vs 89.37
Pairwise ranking accuracy · [Qwen3-4B]
SCPRM: A Schema-aware Cumulative Process Reward Model for Knowledge Graph Question Answering
What to use instead
Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.
- May 27, 2026
- Tree-of-ThoughtsTree of Thoughts as a Classical Heuristic Search Problem: Formal Foundations and Design PatternsMay 27, 2026
- May 22, 2026
- May 22, 2026
- Novelty-based Tree-of-Thought SearchNovelty-based Tree-of-Thought Search for LLM Reasoning and PlanningMay 7, 2026
- Decoding-Time Debiasing via Process Reward ModelsDecoding-Time Debiasing via Process Reward Models: From Controlled Fill-in to Open-Ended GenerationMay 4, 2026
- Apr 27, 2026
- Apr 22, 2026
- CoT-PoT ensemblingSelf-Consistency from Only Two Samples: CoT-PoT Ensembling for Efficient LLM ReasoningApr 19, 2026
- AtroposAtropos: Improving Cost-Benefit Trade-off of LLM-based Agents under Self-Consistency with Early Termination and Model HotswapApr 16, 2026
- Apr 1, 2026
- Learning When to SampleLearning When to Sample: Confidence-Aware Self-Consistency for Efficient LLM Chain-of-Thought ReasoningMar 17, 2026