RIDE: Difficulty Evolving Perturbation with Item Response Theory for Mathematical Reasoning

Xinyuan Li, Murong Xu, Wenbiao Tao, Hanlun Zhu, Yike Zhao +2 more
11/6/2025
cs.CL

No official code found. Best implementation: LiXinyuan1015/RIDE (0 stars, Apache-2.0, last commit 2025-10-31).

Abstract

Large language models (LLMs) achieve high performance on mathematical reasoning, but these results can be inflated by training data leakage or superficial pattern matching rather than genuine reasoning. To this end, an adversarial perturbation-based evaluation is needed to measure true mathematical reasoning ability. Current rule-based perturbation methods often generate ill-posed questions and impede the systematic evaluation of question difficulty and the evolution of benchmarks. To bridge this gap, we propose RIDE, a novel adversarial question-rewriting framework that leverages Item Response Theory (IRT) to rigorously measure question difficulty and to generate intrinsically more challenging, well-posed variations of mathematical problems. We employ 35 LLMs to simulate students and build a difficulty ranker from their responses. This ranker provides a reward signal during reinforcement learning and guides a question-rewriting model to reformulate existing questions across difficulty levels. Applying RIDE to competition-level mathematical benchmarks yields perturbed versions that degrade advanced LLM performance, with experiments showing an average 21.73% drop across 26 models, thereby exposing limited robustness in mathematical reasoning and confirming the validity of our evaluation approach.

View on arXivView PDF

Code Implementations(1)

LiXinyuan1015/RIDECommunity65%
Apache-2.0

Code and data for the paper "RIDE: Difficulty Evolving Perturbation with Item Response Theory for Mathematical Reasoning".

00Oct 31, 202511 months agoApache-2.0

Similar Papers

Cite this paper

@article{li2025ride,
  title  = {RIDE: Difficulty Evolving Perturbation with Item Response Theory for Mathematical Reasoning},
  author = {Xinyuan Li and Murong Xu and Wenbiao Tao and Hanlun Zhu and Yike Zhao and Jipeng Zhang and Yunshi Lan},
  year   = {2025},
  eprint = {2511.04120},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.04120v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.04120.svg)](https://codeofpaper.com/paper/2511.04120)

Discussion