Are Your LLMs Capable of Stable Reasoning?

Junnan Liu, Hongwei Liu, Linchen Xiao, Ziyi Wang, Kuikun Liu, Songyang Gao, Wenwei Zhang, Songyang Zhang, Kai Chen

TL;DR

Current LLM evaluation metrics fail to account for reasoning stability—how consistently a model can generate correct answers across multiple attempts. This paper introduces G-Pass@$k$, a novel evaluation metric that uses varying correctness thresholds to measure both a model's peak potential and its operational consistency. The authors reveal that even state-of-the-art models experience severe performance degradation when strict reasoning consistency is required, though long-Chain-of-Thought (Long-CoT) models show significantly better robustness.

What Problem Does This Paper Address?

When deploying Large Language Models (LLMs) in the real world, we typically use sampling parameters (like temperature and top-$p$) to diversify responses. If a user gets an incorrect answer, they often hit "regenerate" until they get a satisfactory result.

Traditional evaluation metrics fail to capture this dynamic reliably:

  • Greedy Accuracy only evaluates a single, deterministic path.
  • Pass@$k$ measures the probability of generating at least one correct answer in $k$ attempts.

The flaw? Pass@$k$ can drastically overestimate a model's practical utility. If a model has a success rate of only 10%, Pass@$k$ might still yield a high score because the model got lucky once out of many tries. In production, an unpredictable model that requires constant regenerations is highly unstable. This paper tackles the challenge of defining and measuring reasoning stability—the probability that a model consistently generates correct solutions across multiple independent attempts.

Methods

The authors propose G-Pass@$k_\tau$ (Generalized Pass@$k$), which introduces a correctness threshold parameter, $\tau \in (0, 1]$.

Instead of asking if a model got at least one answer right, G-Pass@$k_\tau$ calculates the probability that a model generates at least $\lceil \tau \cdot k \rceil$ correct solutions within $k$ attempts.

  • When $\tau \to 0$, the metric mathematically relaxes and converges to the standard Pass@$k$ (measuring pure potential).
  • When $\tau = 1.0$, the metric becomes ultra-stringent, requiring all $k$ generations to be correct (measuring absolute stability).

To provide a single, unified metric, they introduce mG-Pass@$k$, which calculates the area under the G-Pass@$k_\tau$ curve integrated across thresholds from $\tau = 0.5$ to $1.0$. This captures both high accuracy and high stability.

Datasets

The authors evaluate models across several benchmarks, including a brand-new dataset:

  • LiveMathBench (New): A tough, bilingual (English and Chinese) mathematics benchmark curated from the latest 2024/2025 competitions and examinations to ensure zero data contamination. It includes subsets from the China National Mathematical Olympiad (CNMO), China’s College Entrance Examination (CCEE), the American Mathematics Competition (AMC), and the William Lowell Putnam Mathematical Competition (WLPMC).
  • MATH500-L5: A subset of the hardest (Level 5) problems from the standard MATH dataset.
  • AIME2024-45 & AIME2025: Questions from the American Invitational Mathematics Examination.

Key Insights and Ideas

  • The Illusion of Competence via SFT: Supervised Fine-Tuning (SFT) on contaminated or specific datasets artificially inflates a model's Greedy Accuracy. However, under the hood, its stability deteriorates drastically. The model effectively memorizes superficial patterns rather than developing robust reasoning capabilities.
  • Scaling Parameters Don't Fix Instability: Simply doubling or tripling parameter size (e.g., moving from Qwen2.5-32B to 72B) yields minimal improvements in stability metrics. The base capabilities remain bottlenecked; true stability requires better training paradigms or test-time scaling rather than raw parameter expansion.
  • Long-CoT as a Stabilizer: "o1-like" models (such as QwQ and DeepSeek-R1) exhibit remarkably flat G-Pass curves across varying sampling temperatures and top-$p$ settings. Their internal backtracking and self-reflection mechanisms act as a buffer, allowing them to catch and correct errors introduced by random sampling.
Figure 3: G-Pass@kτ performance of LLMs w.r.t. sam- pling parameters, i.e., top-p, top-k, and tempreature.

Key Results

The authors ran extensive evaluations across general, mathematical, and o1-like reasoning models.

As the correctness threshold $\tau$ becomes more stringent, performance plummets across the board. Even DeepSeek-R1, the most robust model tested, drops from an 81.1% Greedy Accuracy to 69.5% when absolute consistency ($\tau = 1.0$) is demanded on LiveMathBench. Standard models fare much worse; Qwen2.5-72B-Instruct drops from 51.7% down to 29.0%.

The full breakdown of this stability degradation on LiveMathBench can be seen in the main results table:

Table 1: Performance of models on LiveMathBench. We perform 48 runs and report results of greedy accuracy, and G-Pass@16{0.5,0.75,1.0} and mG-Pass@16. A more detailed performance can be found in Table 6 at Appendix I.1.

Limitations and Future Work

While insightful, the paper notes a few limitations:

  • Domain Specificity: The experiments focus entirely on mathematical reasoning. While math is an excellent proxy for logical reasoning, the metric's behavior on code generation or open-ended symbolic logic remains unproven.
  • API Constraints: Some closed-source models have incomplete data due to API rate limits, costs, and service instabilities during large-scale sampling runs.
  • Language Scope: The benchmarks are strictly limited to English and Chinese.

Future work points toward expanding G-Pass@$k$ to broader reasoning domains and designing training objectives that explicitly incentivize reasoning stability rather than single-shot accuracy.

Summary updated

Abstract

The rapid advancement of large language models (LLMs) has shown remarkable progress in complex reasoning tasks. However, a significant disparity exists between benchmark performances and real-world applications. We attribute this gap primarily to current evaluation protocols and metrics, which inadequately capture the full spectrum of LLM capabilities, especially in complex reasoning tasks where both accuracy and consistency are essential. In this paper, we introduce G-Pass@$k$, a novel evaluation metric that continuously assesses model performance across multiple sampling attempts, quantifying both the model's performance potential and its stability. Through extensive experiments on various public and newly constructed benchmarks, we employ G-Pass@$k$ in conjunction with state-of-the-art large language models to provide comprehensive insights into their potential capabilities and operational consistency. Our findings reveal a significant opportunity to enhance the realistic reasoning abilities of LLMs, underscoring the necessity for more robust evaluation metrics.
BibTeX
@inproceedings{liu2025are,
  author = {Junnan Liu and Hongwei Liu and Linchen Xiao and Ziyi Wang and Kuikun Liu and Songyang Gao and Wenwei Zhang and Songyang Zhang and Kai Chen},
  title = {{Are Your LLMs Capable of Stable Reasoning?}},
  booktitle = {Annual Meeting of the Association for Computational Linguistics},
  year = {2025},
  url = {https://openreview.net/forum?id=qgXCeWT0q6},
}
Figure