Skip to content

LSR-Ben: A Logical and Scientific Reasoning Benchmark for Evaluating Process Reward Models

May 2026 · 0 citations · 36 references
Computer Science

TL;DR

LSR-Ben is introduced, a process-level benchmark specifically designed for assessing PRM's performance across two primary reasoning domains (scientific and logical reasoning) and nine subdomains and it is hoped LSR-Ben can foster future researches on PRMs for broader domains, thereby enhancing the reasoning capabilities of LLMs.

Abstract

Currently, process reward models (PRMs) have exhibited remarkable potential for test-time scaling. Since large language models (LLMs) regularly generate flawed intermediate reasoning steps when tackling a broad spectrum of reasoning and decision-making tasks, PRMs are required to possess capabilities for detecting process-level errors in real-world scenarios. However, existing benchmarks primarily focus on mathematical reasoning, thereby failing to comprehensively evaluate the error detection ability of PRMs across diverse reasoning scenarios. To mitigate this gap, we introduce LSR-Ben, a process-level benchmark specifically designed for assessing PRM's performance across two primary reasoning domains (scientific and logical reasoning) and nine subdomains. We conduct extensive experiments on a diverse set of 22 models, encompassing both PRMs and LLMs, and derive two key findings: (1) In domains beyond mathematical reasoning, the error-detection ability of existing PRMs and LLMs is found to be markedly weaker by comparison. (2) In general, LLMs exhibit a tendency toward over-identification of errors compared to PRMs, whereas PRMs exhibit an inherent tendency to overlook errors compared to LLMs. We hope LSR-Ben can foster future researches on PRMs for broader domains, thereby enhancing the reasoning capabilities of LLMs.

View source

Similar papers

#natural language process... Preprint Sep 2026

Rewarding Novel Deductions: Solver-guided Process Rewards for Logical Reasoning

S PRING uses SMT solver as a training-time verifier of intermediate reasoning steps to provide process-level supervision and introduces the notion of a novel reasoning step, namely, a step that is logically valid, consistent with the evolving reasoning state, and not already implied by previously accepted non-contradic...

Muhammad Asif Ali, Wen-Qing Wang, Huan Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning

Recent progress in large language model reasoning has been driven by benchmarks and reinforcement learning environments with automatically verifiable rewards, particularly in mathematics, code, and formal logic. These settings make model accuracy easier to evaluate and optimize, but it remains unclear how far success u...

Ibrahim Ethem Deveci, Funda Tan Çalık, Barış Deniz Sağlam et al. · 0 citations
Preprint Aug 2026

Recursive Agentic Reasoning

Analysis shows that BRANCH's advantage arises not only from exploring multiple reasoning paths, but also from recovering from truncation: its gains strongly correlate with the baseline rate of empty, budget-exhausted outputs, weakening the hypothesis that different problems require routing among test-time reasoning ope...

Sheng Zhang, Xiao-Min Wu, Xi-Yang Wu et al. · 0 citations
Preprint Sep 2026

Rewarding Novel Deductions: Solver-guided Process Supervision for Logical Reasoning

Logical reasoning remains a major challenge for large language models (LLMs), particularly on structured problems that require precise constraint tracking, consistency preservation, and multi-step deduction. This challenge is especially acute for small-scale LLMs, which are more prone to producing inconsistent, redunda...

Muhammad Asif Ali, Wen-Qing Wang, Huan Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

State of Thought Enables Endogenous Reasoning

State of Thought is proposed, a new reasoning paradigm that enables endogenous reasoning in LLMs, with the model's internal reasoning state governing how reasoning unfolds, and provides a generalizable and efficient alternative to existing test-time reasoning paradigms.

Z. Gong, Yi-Kun Hou, Zi-Hao Zeng et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Jailbreaks for Black-Box Uncertainty Quantification in Large Reasoning Models

While Large Reasoning Models (LRMs) excel at complex reasoning, alignment through reinforcement learning often induces systemic overconfidence. In production environments, where logits may be unavailable, robust black-box uncertainty quantification (UQ) is essential for trustworthiness and safety. Focusing on question-...

Lucas Biechy, Cédric Eichler, Adrien Boiret et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.