Skip to content

SMRC: Aligning Large Language Models with Student Reasoning for Mathematical Error Correction

Nov 2025 · arXiv.org · Vol abs/2511.14684 · 0 citations · 33 references
Computer Science

TL;DR

This work formulates student reasoning as a multi-step sequential decision problem and introduces Monte Carlo Tree Search (MCTS) to explore optimal correction paths and proposes a dual evaluation protocol centered on solution accuracy and correct-step retention, offering a comprehensive measure of educational applicability.

Abstract

Large language models (LLMs) often make reasoning errors when solving mathematical problems, and how to automatically detect and correct these errors has become an important research direction. However, existing approaches \textit{mainly focus on self-correction within the model}, which falls short of the"teacher-style"correction required in educational settings, \textit{i.e.}, systematically guiding and revising a student's problem-solving process. To address this gap, we propose \texttt{SMRC} (\textit{\underline{S}tudent \underline{M}athematical \underline{R}easoning \underline{C}orrection}), a novel method that aligns LLMs with student reasoning. Specifically, \texttt{SMRC} formulates student reasoning as a multi-step sequential decision problem and introduces Monte Carlo Tree Search (MCTS) to explore optimal correction paths. To reduce the cost of the annotating process-level rewards, we leverage breadth-first search (BFS) guided by LLMs and final-answer evaluation to generate reward signals, which are then distributed across intermediate reasoning steps via a back-propagation mechanism, enabling fine-grained process supervision. Additionally, we construct a benchmark for high school mathematics, MSEB (Multi-Solution Error Benchmark), consisting of 158 instances that include problem statements, student solutions, and correct reasoning steps. We further propose a dual evaluation protocol centered on \textbf{solution accuracy} and \textbf{correct-step retention}, offering a comprehensive measure of educational applicability. Experiments demonstrate that \texttt{SMRC} significantly outperforms existing methods on two public datasets (ProcessBench and MR-GSM8K) and our MSEB in terms of effectiveness and overall performance. The code are available at https://github.com/ECNU-RAIL/SMRC-EMNLP2026.

View source

Similar papers

Open access Aug 2026

ChatGPT vs. Gemini: Which model generates more comprehensible texts and more solvable tasks?

The results show that the students had more correct answers to the tasks generated by ChatGPT than to those generated by Gemini, suggesting that ChatGPT responds more quickly and directly to prompts, thereby generating teaching materials without verbose explanations.

Lukas Paun · 1 citation
#natural language process... Preprint Sep 2026

Cognitive Enhancement: Rethinking the Necessity of Role-Playing for Large Language Models

Role-playing prompting has become a popular yet simple technique for improving LLM reasoning and output quality. However, whether it consistently boosts performance across diverse domains remains unclear, as systematic validation is lacking. To fill this gap, we run multi-model, cross-domain, and multilingual experimen...

Xing-Jie Zhuang, Jia-Long Tang, Chu-Lun Zhou et al. · 0 citations
Preprint Aug 2026

PromptResponse: Optimizing Prompts for LLM Coding Tasks

A controlled study examining how formatting and LLM-based tuning of coding task prompts affect the resulting code's performance, efficiency, and stability suggests that low-effort reformatting alone can yield measurable improvements, while tuning must account for model alignment.

Erik Thureck, Robert Kühnen, Tim Jacobowitz · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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