2410.09008

# SuperCorrect: Advancing Small LLM Reasoning with Thought Template Distillation and Self-Correction **Authors**: - Bin Cui, Shuicheng Yan (Peking University, Skywork AI, National University of Singapore,) > Equal Contribution. ✉  yangling0818@163.comCorresponding authors. Abstract Large language models (LLMs) like GPT-4, DeepSeek-R1, and ReasonFlux have shown significant improvements in various reasoning tasks. However, smaller LLMs still struggle with complex mathematical reasoning because they fail to effectively identify and correct reasoning errors. Recent reflection-based methods aim to address these issues by enabling self-reflection and self-correction, but they still face challenges in independently detecting errors in their reasoning steps. To overcome these limitations, we propose SuperCorrect, a novel two-stage framework that uses a large teacher model to supervise and correct both the reasoning and reflection processes of a smaller student model. In the first stage, we extract hierarchical high-level and detailed thought templates from the teacher model to guide the student model in eliciting more fine-grained reasoning thoughts. In the second stage, we introduce cross-model collaborative direct preference optimization (DPO) to enhance the self-correction abilities of the student model by following the teacher’s correction traces during training. This cross-model DPO approach teaches the student model to effectively locate and resolve erroneous thoughts with error-driven insights from the teacher model, breaking the bottleneck of its thoughts and acquiring new skills and knowledge to tackle challenging problems. Extensive experiments consistently demonstrate our superiority over previous methods. Notably, our SuperCorrect -7B model significantly surpasses powerful DeepSeekMath-7B by 7.8%/5.3% and Qwen2.5-Math-7B by 15.1%/6.3% on MATH/GSM8K benchmarks, achieving new SOTA performance among all 7B models. 1 Introduction Large language models (LLMs) (Brown et al., 2020; Anil et al., 2023; Achiam et al., 2023; Du et al., 2022; Jiang et al., 2024; Touvron et al., 2023a; b), such as GPT-4 (Achiam et al., 2023), DeepSeek-R1 (Guo et al., 2025), and ReasonFlux (Yang et al., 2025), have demonstrated significant improvements in various reasoning tasks. However, despite being pre-trained on large-scale mathematical datasets using diverse techniques, smaller models like Llama-3-8B (Dubey et al., 2024) and Qwen2.5-Math-7B (Yang et al., 2024a) continue to struggle with complex mathematical reasoning tasks. Existing works aim to enhance the mathematical performance of LLMs through various approaches. We categorize these methods into two types: traditional fine-tuning optimization and reflection-based optimization. Traditional fine-tuning methods mainly focus on the exploration in training techniques like Supervised Fine-Tuning (SFT) (Roziere et al., 2023; Shao et al., 2024; Dubey et al., 2024), and LLM-alignment strategies like Reinforcement Learning from Human Feedback (RLHF) (Achiam et al., 2023; Ouyang et al., 2022; Bai et al., 2022a; b) and alternative methods like Direct Preference Optimization (DPO) (Rafailov et al., 2024). Although these methods have shown remarkable progress across a wide range of language tasks, their optimization objectives only focus on direct answers or simple reasoning rationales. Consequently, they struggle to locate the errors in the reasoning process and fail to revise the flawed reasoning logic of language models. Recent reflection-based methods attempt to address the shortcomings of fine-tuning methods and leverage the pre-designed prompts or general rules to instruct language models for self-reflection and self-correction during reasoning process (Shinn et al., 2024; Kim et al., 2024). Some methods (Li et al., 2023; 2024c) further employ LLMs to synthesize rule-based datasets for enhancing their self-correction abilities in training stage. However, as mentioned in Tyen et al. (2024), LLMs still struggle to independently identify errors in their reasoning steps. Without accurate error identifications, self-correction becomes more challenging. In complex mathematical reasoning, even when mistake locations are provided, LLMs often remain biased or misled by their previous reasoning context. Thus it remains difficult for language models to clarify the causes of reasoning errors within a single LLM. To address these limitations, we propose a novel two-stage framework, namely SuperCorrect, utilizing a large teacher model’s thoughts to supervise and correct both the reasoning and reflection processes of a smaller student model. As depicted in Figure 1, in the first stage, we extract hierarchical thought template from the teacher LLM to guide the student model in generating more fine-grained reasoning thoughts. The template contains a high-level thought providing a summarized and generalized solution for similar problems, and a detailed solution offering a detailed explanation of the critical reasoning steps. Compare to previous thought format such as CoT (Wei et al., 2022) and BoT (Yang et al., 2024b; 2025), our hierarchical thought templates offer deeper and more informative reasoning insights for later error corrections. In second stage, we propose cross-model collaborative DPO to optimize the student model and enhance its self-correction abilities by following the teacher’s cross-model correction traces during training. Specifically, instead of merely simulating correct answers or preferred reasoning process, we instruct teacher LLM to identify and correct the error parts in student’s thoughts. This cross-model correction trace is then used to guide the student model in performing better self-correction, enabling it to avoid and rectify specific errors. The critical insight of our cross-model DPO approach is enabling student language models to break the bottleneck of its thoughts and acquiring new error-driven insights and knowledge from teacher’s correction traces. Furthermore, we construct a high-quality fine-tuning dataset equipped with designed hierarchical thought templates containing 100k samples, and a pair-wise preference dataset for thought-level correction optimization containing 10k samples, which consists of: 1) a math problem, 2) prior reasoning steps in our pre-designed format, 3) the step with chosen analysis and corrective guidance, generated by teacher LLMs based on the ground truth solution 4) the step with rejected analysis and correction guidance, generated by student LLMs without access to the ground truth solution. We summarize our contribution as follows: (i) We propose a novel two-stage fine-tuning method SuperCorrect for improving both reasoning accuracy and self-correction ability for LLMs. (ii) We propose hierarchical thought based fine-tuning to enable small-sized LLMs to produce more accurate and fine-grained reasoning thoughts. (iii) We propose cross-model collaborative DPO, which innovatively leverage SOTA LLMs to locate and correct the specific error thoughts in the reasoning process of smaller student LLMs, thus advancing their self-correction ability and breaking their thought bottleneck. (iv) We construct two high-quality datasets and develop three powerful reasoning LLMs SuperCorrect -Qwen/DeepSeek/Llama-7B, achieving 70.2% accuracy on the MATH dataset and 89.5% on the GSM8K dataset, setting new SOTA performance among all 7B models. <details> <summary>x1.png Details</summary>  ### Visual Description # Technical Document Extraction: SuperCorrect Framework ## Diagram Overview The image depicts a two-stage framework for Large Language Model (LLM) training and correction, labeled **"SuperCorrect"**. It combines **Stage-1 SFT with Hierarchical Thought Template** and **Stage-2 Cross-model Collaborative DPO**. The diagram uses arrows, labeled components, and hierarchical structures to represent data flow and model interactions. --- ## Key Components and Flow ### Stage-1: SFT with Hierarchical Thought Template 1. **Data Input** - **Source**: Labeled as "Data" (top-left). - **Flow**: Direct arrow to **Student LLM** (gray box). 2. **Supervision Process** - **Teacher LLM** (blue box) supervises the Student LLM. - **Action**: "Supervise" arrow from Teacher LLM to Student LLM. - **Output**: "Hierarchical Thought Template" (icon: interconnected human figures + brain). 3. **Reasoning Thought Generation** - **Student LLM** generates "Reasoning Thought" (black arrow). - **Flow**: Student LLM → Teacher LLM. 4. **Teacher LLM Output** - **Output**: "Cross-model Correction Trace" (icon: red/green checkmarks). --- ### Stage-2: Cross-model Collaborative DPO 1. **Self-Correction Trace** - **Source**: Student LLM (gray box). - **Flow**: Black arrow labeled "Self-Correction Trace" to itself. 2. **Cross-model Correction Trace** - **Source**: Teacher LLM (blue box). - **Flow**: Blue arrow labeled "Cross-model Correction Trace" to Student LLM. 3. **DPO/RLHF Integration** - **Process**: Student LLM receives "DPO/RLHF" (black arrow). - **Output**: "Paired Correction Traces" (icon: stacked disks). --- ## Textual Labels and Annotations - **Stage-1 SFT with Hierarchical Thought Template** (bottom-left, blue text). - **Stage-2 Cross-model Collaborative DPO** (bottom-right, blue text). - **SuperCorrect** (center-bottom, bold black text). --- ## Spatial Grounding and Component Isolation - **Header**: Diagram title "SuperCorrect" (center-bottom). - **Main Chart**: - **Stage-1** (left): Data → Student LLM → Teacher LLM → Hierarchical Thought Template. - **Stage-2** (right): Self-Correction Trace ↔ Cross-model Correction Trace → Paired Correction Traces. - **Footer**: Stage labels (blue text). --- ## Notes on Diagram Structure - **Arrows**: - Black arrows represent reasoning/correction traces. - Blue arrows denote supervision/collaboration. - **Icons**: - Human figures + brain: Hierarchical Thought Template. - Red/green checkmarks: Cross-model Correction Trace. - Stacked disks: Paired Correction Traces. --- ## Absent Elements - No numerical data, charts, or tables present. - No non-English text detected. --- ## Summary The diagram illustrates a two-phase LLM training pipeline: 1. **Stage-1** focuses on supervised fine-tuning (SFT) using hierarchical thought templates. 2. **Stage-2** employs cross-model collaborative DPO (Direct Preference Optimization) with self-correction and paired traces. The framework emphasizes iterative refinement through teacher-student interactions and cross-model validation. </details> Figure 1: Overview of our proposed two-stage framework SuperCorrect. In the first stage, we extract hierarchical thought template from teacher LLM to supervise student LLM for producing more specific thoughts. In the second stage, we collect a dataset of paired self- and cross-correction traces for cross-model collaborative DPO. 2 Related Work Reinforcement Learning from Human Feedback for Large Language Models To improve the performance and reliability of LLMs, RLHF methods like Christiano et al. (2017) and Ouyang et al. (2022) are introduced for LLM alignment. This method is more demanding in dataset because it requires pair-wise annotated data to train a reward model thus reflecting human preferences. And then train the policy model using reinforcement learning to maximize the estimated reward. Although this method proves to be effective, due to its reliance on the quality of reward model, this process is complex and computationally intensive. To simplify this process, Direct Preference Optimization (DPO) (Rafailov et al., 2024) was proposed which directly uses pair-wise data for optimization. By defining the preference loss as a function of the policy, DPO can optimize the policy using straightforward training techniques, avoiding the complexities of reinforcement learning. However, current methods only show limited improvements in mathematical reasoning due to the design of optimization unit. Works like Step-DPO (Lai et al., 2024) establish a more fine-grained reward unit by considering each intermediate reasoning step as a basic unit. However, they fail to clarify error causes and provide explicit guidance for correcting errors. In this paper, we specifically design a cross-model teacher-student collaborative thought-based reward, which takes each correction step as a basic optimization unit. Reasoning with Self-Correction/Reflection Self-correction for reasoning has shown promise in improving LLM outputs in terms of style and quality. Previous works (Li et al., 2023; Shinn et al., 2024; Madaan et al., 2024; Saunders et al., 2022; Miao et al., 2023; Chen et al., 2023a) focus on the concept of self-correction, i.e. having an LLM correct its own outputs. However, as mentioned in Huang et al. (2023), while self-correction may prove effective for improving model outputs in terms of style and quality, when it comes to reasoning tasks, LLMs struggle to identify and fix errors without external feedback. For example, Reflexion (Shinn et al., 2024) and RCI (Kim et al., 2024) both use ground truth correctness as a signal to halt the self-correction loop. Moreover, some attempts to self-correct logical or reasoning errors can sometimes turn correct answers into incorrect ones, resulting in worse overall performances (Huang et al., 2023). While previous works typically present self-correction as a process conducted within a specific LLM, our method leverage large-sized LLMs to explicitly identify the errors and gain correction insights from the errors. With this corss-model reward, we can revise the weaknesses exposed by small-sized LLMs during reasoning tasks through fine-tuning and correction-based preference optimization. Thought Expansion for Mathematical Reasoning Thought expansion for reasoning mainly focus on pre-designed reasoning structure or template, which leverage prompting techniques to enhance mathematical reasoning capabilities of LLMs. Chain-of-Thought (CoT) prompting (Wei et al., 2022) and its variants (Kojima et al., 2022; Press et al., 2023; Arora et al., 2022), such as Least-to-Most (Zhou et al., 2022), Decomposed Prompting (Khot et al., 2022), and Auto-CoT (Zhang et al., 2022) —prompt LLMs to break down complex questions into simpler subtasks and systematically solve them before summarizing a final answer. Innovations like Tree-of-Thought (Yao et al., 2024) and Graph-of-Thought (Besta et al., 2024), have further complex this field by exploring dynamic, non-linear reasoning pathways to expand heuristic capabilities of LLMs (Chen et al., 2023b; Ning et al., 2023). Other methods like PoT (Chen et al., 2022), PAL (Gao et al., 2023b) and (Gou et al., 2023) attempt to utilize external tools such as code to avoid hallucination of LLMs in the mathematical reasoning process. However, they suffer from increased resource demands and greater time complexity, depend on manual prompt crafting, and are often tailored to specific task types. Recent BoT (Yang et al., 2024b) propose a task-agnostic paradigm with meta buffer to efficiently solve the problems based on accumulated thought templates. However, it is a training-free framework which may not essentially boost the reasoning ability of LLMs. To further improve the internal reasoning ability of LLMs, Quiet-STaR (Zelikman et al., 2024) uses RLHF-based self-teaching with LLMs’ self-generated thoughts to improve reasoning in normal tasks and simple math problems. For more complex problems that are beyond the students’ capabilities, this think-before-reasoning pattern may not work well. In this paper, we utilize a new cross-model paradigm to enable LLMs to boost both reasoning and self-correction abilities from external model feedbacks, thereby breaking the bottleneck of original thoughts of LLMs and broadening the model’s capability to address a wider range of issues. 3 Preliminary Reinforcement Learning from Human Feedback Reinforcement Learning from Human Feedback (RLHF) (Christiano et al., 2017) is an effective approach for enhancing the robustness, factuality, and safety of LLMs (Ouyang et al., 2022). RLHF consists of three training phases: 1) supervised fine-tuning (SFT); 2) reward model training, and 3) policy model fine-tuning. SFT Phase: RLHF typically begins by fine-tuning a pre-trained LM with supervised learning on high-quality data for the downstream task(s) of interest (dialogue, summarization, etc.), to obtain a model $\pi_{sft}$ . Reward Modelling Phase:given any text, the reward model will assign a scalar reward value to the last token, and the larger the reward value, the better the sample. Following Stiennon et al. (2020), training reward models often involves utilizing a dataset comprised of paired comparisons between two responses generated for the same input. The modeling loss for each pair of preferred and dis-preferred samples is: $$ \mathcal{L}(\psi)=\log\sigma(r(x,y^{+})-r(x,y^{-})), \tag{1} $$ where $\sigma$ is the sigmoid function. $r$ represents the reward model with parameters $\psi$ , and $r(x,y)$ is the a single scalar predicted reward for input prompt $x$ and response $y$ . However, this method is often considered complex due to the complex training pipeline. RL Fine-Tuning Phase: During the RL phase, the learned reward function is used to provide feedback to the language model. Following prior works (Tutor, ; Jaques et al., 2020), the optimization is formulated as $$ \max_{\pi_{\theta}}\mathbb{E}_{x\sim\mathcal{D},y\sim\pi_{\theta}(y\mid x)}% \bigl{[}r_{\phi}(x,y)\bigr{]}-\beta\mathbb{D}_{\textrm{KL}}\bigl{[}\pi_{\theta% }(y\mid x)\mid\mid\pi_{ref}(y\mid x)\bigr{]}, \tag{2} $$ where $\beta$ is a parameter controlling the deviation from the base reference policy $\pi_{ref}$ , namely the initial SFT model $\pi_{sft}$ . In practice, the language model policy $\pi_{\theta}$ is also initialized to $\pi_{sft}$ . Due to the discrete nature of language generation, this objective is not differentiable and is typically optimized with reinforcement learning. The standard approach (Ziegler et al., 2019; Bai et al., 2022a; Ouyang et al., 2022) has been to construct the reward function as metioned in Equation 1, and maximize using PPO Schulman et al. (2017). Direct Preference Optimization (DPO) As an competitive alternative for traditional RLHF method, DPO (Rafailov et al., 2024) was introduced to directly leverage pair-wise preference to optimize the policy model with an equivalent optimization objective. Specifically, given an input prompt $x$ , and a preference data pair $(y^{+},y^{-})$ , DPO aims to maximize the probability of the preferred output $y^{+}$ and minimize that of the undesirable output $y^{-}$ . The optimization objective is formulated as: $$ \displaystyle\begin{aligned} \mathcal{L}_{DPO}(\theta)=-\mathbb{E}_{(x,y^{+},y% ^{-})\sim D}[\log\sigma(\beta\log\frac{\pi_{\theta}(y^{+}|x)}{\pi_{ref}(y^{+}|% x)}-\beta\log\frac{\pi_{\theta}(y^{-}|x)}{\pi_{ref}(y^{-}|x)})],\end{aligned} \tag{3} $$ where $D$ is the pair-wise preference dataset, $\sigma$ is the sigmoid function, $\pi_{\theta}(·|x)$ is the policy model to be optimized, $\pi_{ref}(·|x)$ is the reference model kept unchanged during training, and the hyperparameter $\beta$ controls the distance from the reference model. 4 Method 4.1 Supervised Fine-tuning with Hierarchical Thought Template Constructing Hierarchical Thought Templates from Teacher LLMs The traditional instruction-response datasets for training LLMs (Ouyang et al., 2022) mainly focus on the correctness of the response, leading LLMs to merely simulate the provided solution and the answer, while ignoring the importance of the intermediate reasoning thought. Recent work such as BoT (Yang et al., 2024b) utilizes a high-level reasoning guideline (thought template) to enable LLMs to efficiently solve similar problems in a training-free manner. However, for complex and diverse mathematical reasoning tasks, we find that using only a high-level thought template is insufficient, especially for small-sized LLMs. To empower small LLMs to tackle complex reasoning tasks, we specifically design a hierarchical thought template extracted from large teacher LLMs for transfer to small student LLMs. This new hierarchical thought template comprises both a high-level thought and a detailed solution. The former provides a summarized and generalized solution for similar problems, while the latter offers a detailed explanation of the critical reasoning steps. Based on this hierarchical thought template, we can propose a new fine-tuning objective that aims to incorporate human-like hierarchical problem-solving thought structures into the model reasoning and explicitly produce hierarchical thought during reasoning process. We first collect a set $D=\{(x,\hat{y},\hat{s})\}$ of mathematical problems $x$ with ground-truth answers $\hat{y}$ and solution $\hat{s}$ . For each problem $x∈ D$ , we first utilize our pre-defined prompt denoted as $P_{tea}$ , as shown in the below text box, to extract hierarchical thought templates from teacher LLMs (e.g., SOTA LLMs like o1-preview/o1-mini). For more details about our prompt, we present all of our prompts in Appendix A. Prompt for Extracting Hierarchical Thought Template Transform the solution of the following math problem into a step-by-step XML format, each step should be enclosed within tags like $\langle\text{Step1}\rangle$ $\langle/\text{Step1}\rangle$ . For each step enclosed within the tags, determine if this step is challenging and tricky, if so, add detailed explanation and analysis enclosed within $\langle\text{Key}\rangle$ $\langle/\text{Key}\rangle$ in this step, as helpful annotations to make the student better understand this step correctly thus mastering the solution. After all the reasoning steps, summarize the common solution and reasoning steps to help him generalize to similar problems within $\langle\text{Generalized}\rangle$ $\langle/\text{Generalized}\rangle$ . Finally present the final answer enclosed within $\langle\text{Answer}\rangle$ $\langle/\text{Answer}\rangle$ . Then we can obtain the high-quality fine-tuning dataset $D_{sft}$ as: $$ D_{sft}=\pi_{tea}(P_{tea},x,\hat{s})=\{x,s_{tea},T_{tea},y_{tea}|x\in D\}, \tag{4} $$ where $s_{tea}$ is the formalized solution steps, $T_{tea}$ is the hierarchical thought for the solution, and $y_{tea}$ is the final answer extracted from $s_{tea}$ . Here we provide an example of our hierarchical thought template as shown in the below text box. For normal and easy steps, we provide brief explanation and direct solution, as for tricky and difficult reasoning steps, we provide a detailed solution and in-depth explanation within $\langle\text{Key}\rangle$ which will help student LLMs to better grasp the insight within the detailed thought. Furthermore, we provide a high-level thought within $\langle\text{Generalized}\rangle$ as a generalized guidance which helps to efficiently solve similar problems. Thought-based Supervised Fine-tuning After curating our thought-based dataset $D_{sft}$ , our optimization objective is to make student LLMs $\pi$ reasoning with hierarchical thought and have a more comprehensive understanding for each problem-solving process, which can be formulated as: $$ \mathcal{L_{\text{sft}}}={\text{argmax}}\sum_{(P_{stu},x,T_{tea},s_{tea})\in D% _{sft}}\log\pi((T_{tea},s_{tea})|(P_{stu},x)). \tag{5} $$ Starting from the base student LLM $\pi$ , $\mathcal{L_{\text{sft}}}$ maximizes the likelihood of response $(T_{tea},s_{tea})$ given prompt $P_{stu}$ and input problem $x$ , where $P_{stu}$ denotes the pre-defined prompt as $P_{tea}$ . After the fine-tuning process, we greatly enhance the reasoning ability of base student LLMs by learning the hierarchical thought from SOTA reasoning LLMs and enable the student LLMs to produce similar hierarchical thought along with final answer. Then, we obtain fine-tuned student LLMs $\pi_{ref}$ that could be used for cross-model collaborative dpo in Section 4.2. Hierarchical Thought Template $\langle\text{Step 1}\rangle$ …… $\langle\text{/Step 1}\rangle$ …… $\langle\text{Step 4}\rangle$ Calculate the Number of Ways to Roll Exactly 2 Sixes $\langle\text{Key}\rangle$ $\spadesuit$ Starting point of detailed solution $\spadesuit$ : Understanding Combinations and Independent Events The most challenging step is determining the number of ways to roll exactly two sixes. This involves two key concepts: 1. Combinations ( $\binom{5}{2}$ ): This represents the number of ways to choose which two out of the five rolls will be sixes. 2. Independent Choices for Remaining Rolls ( $5^{3}$ ): For the other three rolls that are not sixes, each has 5 possible outcomes (1 through 5). By combining these, the total number of ways to get exactly two sixes is: $\binom{5}{2}× 5^{3}$ $\spadesuit$ End point of detailed solution $\spadesuit$ : $\langle\text{/Key}\rangle$ $\langle\text{/Step 4}\rangle$ $\langle\text{Step 5}\rangle$ …… $\langle\text{/Step 5}\rangle$ $\langle\text{Step 6}\rangle$ Calculate the Probability The probability of getting at most two sixes in five rolls is the ratio of the number of favorable outcomes to the total number of possible outcomes: $\frac{\binom{5}{0}× 5^{5}+\binom{5}{1}× 5^{4}+\binom{5}{2}× 5^{% 3}}{6^{5}}=\frac{625}{648}$ $\langle\text{/Step 6}\rangle$ $\langle\text{Generalized}\rangle$ $\diamondsuit$ Starting point of high-level thought Generalizing to Similar Problems When dealing with probabilities of obtaining a certain number of specific outcomes in multiple trials (like rolling a die several times), follow these steps: 1. Identify Total Outcomes: Calculate the total number of possible outcomes using $n^{k}$ . 2. Determine Favorable Outcomes: For each desired number of specific outcomes (e.g., exactly $r$ sixes), use combinations and multiply by the number of ways the remaining trials can occur. 3. Sum Relevant Cases: If the problem asks for ”at most” or ”at least,” sum the favorable outcomes accordingly. 4. Compute Probability: Divide the total favorable outcomes by the total possible outcomes. This approach is based on the binomial probability formula, which is widely applicable in scenarios with independent trials. $\diamondsuit$ End point of high-level thought $\langle\text{/Generalized}\rangle$ $\langle\text{Answer}\rangle$ The probability of rolling a six in at most 2 of the 5 rolls is $\frac{625}{648}$ . $\langle\text{/Answer}\rangle$ <details> <summary>x2.png Details</summary>  ### Visual Description # Problematic Solution Example ## Input Problem Let \( f(x) = \frac{1}{2x - 5} \). Find the largest \( x \) which is not in the domain of \( g(x) = f(f(x)) \). --- ## Solution ### Step 1: Identify the function \( f(x) \) and its domain - Function: \( f(x) = \frac{1}{2x - 5} \) - Domain: All real numbers except \( x = \frac{5}{2} \) (denominator ≠ 0). ### Step 2: Solve for values of \( x \) that make the denominator of \( f(x) \) zero - \( 2x - 5 = 0 \Rightarrow x = \frac{5}{2} \). ### Step 3: Substitute \( f(x) \) into \( g(x) \) \[ g(x) = f(f(x)) = f\left(\frac{1}{2x - 5}\right) = \frac{1}{2\left(\frac{1}{2x - 5}\right) - 5} \] ### Step 4: Simplify the expression for \( g(x) \) **(Error Reasoning Step)** \[ g(x) = \frac{1}{\frac{2}{2x - 5} - 5} = \frac{1}{\frac{2 - 5(2x - 5)}{2x - 5}} = \frac{2x - 5}{2 - 10x + 25} = \frac{2x - 5}{27 - 10x} \] ❌ **Error**: Incorrect simplification. The denominator should be \( 1 - 5x \), not \( 27 - 10x \). ### Step 5: Identify values of \( x \) that make the denominator of \( g(x) \) zero - \( 1 - 5x = 0 \Rightarrow x = \frac{1}{5} \). ### Step 6: Identify values of \( x \) that make the denominator of \( f(x) \) zero **(Already in domain of \( g(x) \))** - \( x = \frac{5}{2} \). ### Step 7: Determine the largest \( x \) not in the domain of \( g(x) \) - Values: \( x = \frac{1}{5} \) and \( x = \frac{5}{2} \). - Largest value: \( x = \frac{5}{2} \) ❌ **Incorrect**. The correct largest value is \( x = \frac{1}{5} \). --- ## Self-Correction ### Step 1: Re-evaluate domain of \( g(x) \) - \( g(x) = \frac{1}{x - 2.5} - 5 \) ❌ **Error**: Misleading simplification. Correct simplification: \[ g(x) = \frac{1}{\frac{1}{x - 2.5} - 5} = \frac{x - 2.5}{1 - 5(x - 2.5)} = \frac{x - 2.5}{13.5 - 5x} \] ### Step 4: Correct simplification - Denominator: \( 1 - 5x + 12.5 = 13.5 - 5x \). ### Step 7: Correct largest \( x \) - Values: \( x = \frac{1}{5} \) and \( x = \frac{5}{2} \). - Largest value: \( x = \frac{5}{2} \) ❌ **Hallucination**. The correct largest value is \( x = \frac{1}{5} \). --- ## Cross-Model Correction ### Step 1: Simplify \( g(x) \) \[ g(x) = \frac{1}{\frac{1}{x - 2.5} - 5} = \frac{x - 2.5}{1 - 5(x - 2.5)} = \frac{x - 2.5}{13.5 - 5x} \] ### Step 4: Correct simplification - Denominator: \( 1 - 5x + 12.5 = 13.5 - 5x \). ### Step 7: Correct largest \( x \) - Values: \( x = \frac{1}{5} \) and \( x = \frac{5}{2} \). - Largest value: \( x = \frac{1}{5} \) ✅ **Correct Answer**. --- ## Key Errors Identified 1. **Step 4 (Original)**: Incorrect simplification of \( g(x) \). 2. **Step 7 (Original)**: Misidentification of the largest \( x \). 3. **Step 6 (Original)**: Irrelevant consideration of \( x = \frac{5}{2} \). ## Final Answer The largest \( x \) not in the domain of \( g(x) \) is \( \boxed{\frac{1}{5}} \). </details> Figure 2: An illustrative comparison between self-correction and our cross-model correction. Cross-model correction can enable more precise error localization and thought correction. 4.2 Cross-model Collaborative DPO Boosting DPO with Thought Correction While DPO proves to be effective in some areas (e.g., chat, style, etc.), its optimization objective is less effective for complex mathematical reasoning tasks. As noted in Lai et al. (2024), the issue arises because errors in solving complex mathematical problems often occur at the most challenging steps (e.g., complicated calculations, tricky transformations). This may lead to wrong optimization during training, as correct previous steps are also rejected. Furthermore, it is challenging for a single LLM to detect and correct its own errors (Tyen et al., 2024). This is akin to students struggling to gain insights from their own incorrect solutions. The root of the error lies in flawed reasoning, making it inefficient to merely imitate the correct solution without addressing the underlying thought-level mistakes. To address this, we have carefully designed novel and fine-grained optimization objectives that prioritize thought-level correction over traditional instance-level preference. Specifically, we first accurately locate the error step and then use the correction trace of this error step as the optimization unit. This approach prioritizes cross-model correction traces from teacher LLMs $\pi_{tea}$ over self-correction traces from student LLMs $\pi_{ref}$ , thereby enhancing the error detection and self-correction abilities of student LLMs. Collecting Error Thoughts and Corrections To achieve thought-level correction, we need to collect a dataset containing fine-grained paired data of self- and cross-correction traces. Specifically, we utilize the fine-tuned student LLM $\pi_{ref}$ to conduct thought-based reasoning on our sampled test dataset denoted as $D_{test}=\{x_{test},\hat{y}_{test},\hat{s}_{test}\}$ , and we obtain the test results denoted as $\pi_{sft}(x_{test})=\{x_{test},s_{test},T_{test},y_{test}|x_{test}∈ D_{test}\}$ . After filtering out erroneous problem-solution pairs that satisfy $y_{test}≠\hat{y_{test}}$ and finally obtain the erroneous dataset: $$ D_{err}=\{x_{test},\hat{y}_{test},\hat{s}_{test},s_{err},T_{err},y_{err}|x_{% test}\in D_{test}\}, \tag{6} $$ here $s_{err}$ is the error solution and $T_{err}$ is the corresponding error thought, $y_{err}$ represents the error answer extracted from $s_{err}$ . Given that each erroneous solution is explicitly presented as a sequence of reasoning steps $s_{err}=s_{1},s_{2},...,s_{n}$ , we proceed to verify the correctness of each reasoning step until we find the first error and record its step number $k$ . Here we utilize current powerful models (e.g., gpt-4o, o1-mini) in mathematical reasoning to function as an experienced teacher model $\pi_{tea}$ . To obtain the corresponding error steps and cause analysis, we design a prompt $P_{c}$ to instruct $\pi_{tea}$ to search for the logic flaws and errors in the provided reasoning steps. After searching $s_{err}$ and evaluating each reasoning steps, we could locate each error steps and annotate each error step with error cause analysis $a_{i}$ and correction guidance $c_{i}$ . Thus we could obtain an annotated dataset of pair-wise self- and cross-corrections: $$ D_{corr}=\{(x,\{s_{i}\}_{i=0}^{k-1},(a_{k}^{+},c_{k}^{+}),(a_{k}^{-},c_{k}^{-}% ),)|x\in D_{err}\}, \tag{7} $$ where $k$ denotes the first error step. Here $(a_{k}^{+},c_{k}^{+})$ is chosen as the corrected step with analysis from teacher model, $(a_{k}^{-},c_{k}^{-})$ is chosen as the rejected correction step and cause analysis from the student model, utilizing the same correction prompt as the teacher. To further ensure the quality of our dataset, we additionally propose an inspector LLM to conduct iterative evaluation which verifies the accuracy of the correction trace by comparing it against the input problem and the ground-truth solution. If issues are detected, the problematic parts are sent back to the teacher LLMs for revision. This iterative checking process continues until no errors remain, with a maximum of three iterations allowed. In our implementation, we apply inspector LLM both in the curation process of HSFT dataset and pair-wise self-and corrections dataset. For more detail, please refer to Section 5.5, we also make detailed analysis of the dataset quality in Section 5.5.2. Improving Self-correction Ability with Cross-model Correction In the second stage of our method, our proposed cross-model collaborative DPO leverages cross-model correction from teacher LLMs to enhance the error detection and self-correction ability of student LLMs. As noted in Equation 7, the previous $k-1$ correct reasoning steps $\{s_{i}\}_{i=0}^{k-1}$ are combined with input problem $x$ , our cross-model collaborative DPO aims to maximize the probability of the teacher LLM’s correction and analysis of the error step $(a_{k}^{+},c_{k}^{+})$ , while minimizing the probability of the student LLM’s self-correction and analysis $(a_{k}^{-},c_{k}^{-})$ . The optimization objective of our cross-model collaborative DPO can be formulated as: $$ \displaystyle\begin{aligned} &\mathcal{L}_{\text{Cross-DPO}}(\theta)=\\ &-\mathbb{E}_{(x,s_{1\sim k-1},(a_{k}^{+},c_{k}^{+}))\sim D_{corr}}\left[\log% \sigma\left(\beta\log\frac{\pi_{\theta}((a_{k}^{+},c_{k}^{+})|x;s_{1\sim k-1})% }{\pi_{ref}((a_{k}^{+},c_{k}^{+})|x;s_{1\sim k-1})}-\beta\log\frac{\pi_{\theta% }((a_{k}^{-},c_{k}^{-})|x;s_{1\sim k-1})}{\pi_{ref}((a_{k}^{-},c_{k}^{-})|x;s_% {1\sim k-1})}\right)\right].\end{aligned} \tag{8} $$ By prioritizing cross-model correction over self-correction, as illustrated in Figure 2, our method helps student model to accurately locate the erroneous steps of the mathematical reasoning process and effectively conduct self-correction. Furthermore, this process also helps the student LLMs to rectify its original flawed thoughts and avoid specific errors thus improving the reasoning ability and mitigate hallucination problems. Table 1: Quantitative comparison. Models are evaluated with chain-of-thought reasoning using open-source evaluation framework (Gao et al., 2023a) †. ”general” denotes whether the model is for general tasks or designed for specific tasks. ”open” denotes open-source or not. - $\;\;{}^{\dagger}$ lm-evaluation: https://github.com/EleutherAI/lm-evaluation-harness. <details> <summary>x3.png Details</summary>  ### Visual Description # Self-Correction Performance Comparison on MATH Dataset ## Chart Structure - **Title**: "Self-Correction Performance Comparison on MATH Dataset" - **X-Axis**: Model names (categorical) - **Y-Axis**: Accuracy (%) [40% to 85%] - **Legend**: Located in top-left corner - Blue: Base LLMs - Red: Self-Correction - Yellow: Self-Correction + Our Cross-DPO ## Data Series 1. **Base LLMs** (Blue) 2. **Self-Correction** (Red) 3. **Self-Correction + Our Cross-DPO** (Yellow) ## Key Data Points & Annotations | Model | Base LLMs (%) | Self-Correction (%) | Self-Correction + Cross-DPO (%) | Change vs Base LLMs | |------------------------|---------------|---------------------|----------------------------------|---------------------| | Llama3.1-8B-Instruct | 51.9 | 49.8 | - | -2.1% | | DeepSeek-Math-7B | 46.8 | 43.2 | - | -3.6% | | Qwen2.5-Math-7B | 55.1 | 55.4 | - | +0.3% | | GPT-4o | 76.6 | 77.8 | - | +1.2% | | Claude-3.5-Sonnet | 71.1 | 73.4 | - | +2.3% | | Gemini-1.5-pro | 67.7 | 69.1 | - | +1.4% | | SuperCorrect-Qwen-7B | 70.2 | 75.4 | 75.4 | +5.2% | ## Spatial Grounding - **Legend Position**: Top-left corner - **Bar Colors**: - Blue bars: Base LLMs - Red bars: Self-Correction - Yellow bar: Self-Correction + Cross-DPO (only for SuperCorrect-Qwen-7B) ## Trend Verification 1. **Llama3.1-8B-Instruct**: Base LLMs (51.9%) → Self-Correction (49.8%) [↓] 2. **DeepSeek-Math-7B**: Base LLMs (46.8%) → Self-Correction (43.2%) [↓] 3. **Qwen2.5-Math-7B**: Base LLMs (55.1%) → Self-Correction (55.4%) [↑] 4. **GPT-4o**: Base LLMs (76.6%) → Self-Correction (77.8%) [↑] 5. **Claude-3.5-Sonnet**: Base LLMs (71.1%) → Self-Correction (73.4%) [↑] 6. **Gemini-1.5-pro**: Base LLMs (67.7%) → Self-Correction (69.1%) [↑] 7. **SuperCorrect-Qwen-7B**: - Base LLMs (70.2%) → Self-Correction (75.4%) [↑] - Self-Correction + Cross-DPO (75.4%) [→] ## Critical Observations 1. **Performance Gains**: - Self-Correction improves accuracy in 5/7 models - Cross-DPO further enhances performance in SuperCorrect-Qwen-7B (+5.2%) 2. **Largest Improvement**: SuperCorrect-Qwen-7B shows the most significant gain (+5.2%) 3. **Performance Loss**: - Llama3.1-8B-Instruct and DeepSeek-Math-7B show declines (-2.1% and -3.6%) ## Language Notes - All text is in English - No non-English content detected </details> Figure 3: Comparison between different models and our SuperCorrect. Here we chose SuperCorrect -Qwen-7B as our model. The differences of the accuracy has been marked by arrows with different colors, red means accuracy decreased, and green means accuracy improved. 5 Experiments 5.1 Experimental Setup Base Models, Datasets and Evaluations We apply SuperCorrect to different base models to demonstrate its generalization ability and achieve new SOTA results, including recent powerful Qwen2.5-Math-7B (Yang et al., 2024a), Meta-Llama3.1-8B (Dubey et al., 2024), DeepSeek-Math-7B (Liu et al., 2024), these models have been recognized to be reasoning-efficient with smaller size and strong reasoning ability especially in mathematical problems. In the SFT stage, we use mathematical problems from the training set of Math (Hendrycks et al., 2021) which consists of 7500 challenging competition mathematics problems, and training set of GSM8K (Cobbe et al., 2021) consists of 7473 high quality linguistically diverse grade school math word problems. Furthermore, we additionally translated 670 challenging math problems from GaoKao Bench (Zhang et al., 2023a) which is based on Chinese 2010-2022 GAOKAO examinations. To further enrich the diversity of our dataset, we sampled some challenging problems from NuminaMath (Li et al., 2024b) and MetaMath (Yu et al., 2023). To align with our hierarchical thought reasoning process, we leverage SOTA LLMs o1-mini/gpt-4o-mini to create hierarchical thought based on the ground truth solution as mentioned in Section 4.1, and establish a hierarchical thought based dataset. In the Cross-model DPO stage, we collect 20k incorrect reasoning results from three different SFT models and processed as described in Section 4.2. For evaluation, we use the test set from MATH (Hendrycks et al., 2021) and GSM8K (Cobbe et al., 2021) datasets, and test chain-of-thought reasoning accuracy utilizing open-source evaluation framework (Gao et al., 2023a). Implementation Details We conduct our experiments on 8 NVIDIA A100-PCIE-40GB GPUs. Here we denote our hierarchical thought based supervised fine-tuning as HSFT for simplicity. Initially, we utilize the 100K HSFT data for hierarchical thought supervised fine-tuning on the base models to obtain our HSFT models. We train all of our models for 4 epochs, with training batch size set to 8 and gradient accumulation steps set to 16. The learning rate is set to $2e^{5}$ and we use AdamW optimizer along with the cosine learning rate scheduler. The warmup ratio is set to 0.02 and we use flash-attention (Dao et al., 2022) to save GPU memory. Subsequently, we perform Cross-model DPO based on the HSFT models. For Cross-model DPO, we train for 8 epochs, with a global batch size of 128 and a learning rate of $1× 10^{-6}$ . And we use the AdamW optimizer along with cosine learning rate scheduler, and the warmup ratio is set to 0.05. Table 2: Accuracy comparison between different methods, here we choose Qwen2.5-Math-Instruct as Base model denoted as Base and our Cross-model DPO is denoted as Cross-DPO. Here we separately compare our first HSFT stage with traditional SFT method and Cross-DPO stage with Reflexion (Shinn et al., 2024). We show the improved accuracy in green compare to previous methods. We provide quantitative results with more base LLMs (i.e., Llama3.1 and DeepSeek-Math) in Table 7 of Section 5.6. | Model MATH (%) Model | Base 55.1 Base | Base + SFT 57.4 Base + SFT | Base + HSFT 62.4 (+5.0) Base + HSFT | Base-HSFT + Reflexion (Shinn et al., 2024) 63.1 Base-HSFT + Reflection | Base-HSFT + Cross-DPO 70.2 (+7.1) Base-HSFT + Cross-DPO | | --- | --- | --- | --- | --- | --- | | GSM8K (%) | 83.2 | 84.3 | 87.2 (+2.9) | 86.8 | 89.5 (+2.7) | <details> <summary>x4.png Details</summary>  ### Visual Description # Accuracy Improvement with SuperCorrect Across Topics ## Chart Type Bar chart comparing accuracy improvements between Base LLM and SuperCorrect across mathematical topics. ## Axes - **X-axis**: Accuracy (ranging from 0.0 to 0.8) - **Y-axis**: Mathematical topics (listed vertically): 1. Algebra 2. Counting & Probability 3. Geometry 4. Intermediate Algebra 5. Number Theory 6. Prealgebra 7. Precalculus ## Legend - **Location**: Top-right corner - **Entries**: - **Blue**: Base LLM - **Green**: SuperCorrect Improvement ## Data Points | Topic | Base LLM Accuracy | SuperCorrect Accuracy | Improvement (%) | |------------------------|-------------------|-----------------------|-----------------| | Algebra | 0.76 | 0.885 | +12.5% | | Counting & Probability | 0.53 | 0.654 | +15.4% | | Geometry | 0.44 | 0.557 | +11.7% | | Intermediate Algebra | 0.36 | 0.471 | +21.0% | | Number Theory | 0.51 | 0.726 | +21.5% | | Prealgebra | 0.78 | 0.834 | +5.4% | | Precalculus | 0.345 | 0.58 | +23.7% | ## Key Trends 1. **SuperCorrect consistently outperforms Base LLM** across all topics. 2. **Highest improvement**: Precalculus (+23.7%). 3. **Lowest improvement**: Prealgebra (+5.4%). 4. **Intermediate Algebra** shows the largest absolute accuracy gain (0.111). 5. **Number Theory** has the highest SuperCorrect accuracy (0.726). ## Spatial Grounding - **Legend**: Top-right corner (blue = Base LLM, green = SuperCorrect). - **Bars**: Horizontal, grouped by topic on the y-axis. - **X-axis**: Accuracy values increase left-to-right. ## Component Isolation 1. **Header**: Title "Accuracy Improvement with SuperCorrect Across Topics". 2. **Main Chart**: Bar visualization with dual-color coding. 3. **Footer**: No additional text or elements. ## Verification - All legend colors match bar colors (blue = Base LLM, green = SuperCorrect). - Percentages align with calculated differences (e.g., Algebra: 0.885 - 0.76 = 0.125 = +12.5%). - No missing or misaligned data points. ## Notes - The chart uses **absolute percentage improvements** (difference in accuracy points), not relative gains. - Precalculus shows the most significant jump due to its low Base LLM accuracy (0.345) and high SuperCorrect accuracy (0.58). </details> Figure 4: Improvement comparison between different topics. Here we chose Qwen2.5-Math-7B-Instruct and our SuperCorrect -Qwen-7B to show the improvement in performance of different mathematical problem Types. The part in green is the improved part of our SuperCorrect, and the part in black is the original reasoning accuracy of Qwen2.5-Math-7B-Instruct. 5.2 Main Results Enhanced Reasoning Accuracy As shown in Table 1, our method achieves new SOTA performance among all 7B models, significantly surpassing powerful DeepSeekMath-7B by 7.8% and Qwen2.5-Math-7B by 15.1% on MATH benchmark. This promising results demonstrates our superiority and effectiveness in handling complicated reasoning tasks. Notably, we can achieve better results than larger-sized models such as Llama3-70B-Instruct (Touvron et al., 2023a) in GSM8K and MATH, and achieve accuracy comparable to GPT-4o and GPT-4o-mini with our best model SuperCorrect -Qwen-7B. We attribute this improvement in reasoning accuracy in two folds: 1) The first HSFT stage that equips student LLMs with a deeper and fine-grained reasoning process. Compare to conventional CoT reasoning process, it helps the student LLMs to think more carefully thus improving the reasoning consistency and reduce hallucinations issues on the problems that the student LLMs already mastered. 2) The second cross-model DPO stage that leverages the error-driven insights from teacher LLM to help student LLMs break the bottleneck of their thoughts thus making it possible to deal with the problems that the student LLMs in acquiring the skills and knowledge to tackle problems they were previously unable to solve. We also present some detailed examples of hierarchical reasoning in Appendix B from different datasets, please check them to have a comprehensive understanding of our SuperCorrect. Improved Self-Correction Ability Here we also show the improved self-correction ability of our SuperCorrect as shown in Figure 3. After initial reasoning stage, we let all the LLMs to verify the reasoning process and detect the logic flaws and errors within each reasoning step, and try to correct them. As a result of self-correction, our SuperCorrect further increase the accuracy by 5 $\sim$ 6%, while other LLMs are ineffective to increase the accuracy, and some LLMs even decrease the original accuracy. Because our Cross-model DPO helps the LLMs to accurately locate the errors and logic flaws within each steps by learning teacher’s correction traces, and use a fine-grained analysis and correction to help LLMs better correct them. After the Cross-model DPO process, the LLMs are not only able to consistently solve problems within its capabilities, but they are also able to solve wider range of problems with error-driven insights gained from teacher LLMs. We provide more quantitative analysis in Table 6 on how far cross-model DPO brings the student model and the teacher model closer to each other. We also provide some self-correction examples from different datasets, for more detail, please check Appendix C. <details> <summary>x5.png Details</summary>  ### Visual Description # Technical Document Extraction: Accuracy Distribution Chart ## Chart Title **Accuracy Distribution Across Multiple Reasoning Rounds for Various Models** --- ### Axis Labels - **X-Axis**: `Number of Accurate Answers (Performance)` - Range: 60 to 140 (inferred from axis limits) - **Y-Axis**: `Density` - Range: 0.00 to 0.14 --- ### Legend - **Position**: Top-left corner - **Entries**: 1. `DeepSeek-Math-Instruct-7B` (Green) 2. `SuperCorrect-DeepSeek-7B` (Orange) 3. `Qwen2.5-Math-7B-Instruct` (Blue) 4. `SuperCorrect-Qwen-7B` (Pink) --- ### Data Series & Trends 1. **DeepSeek-Math-Instruct-7B (Green)** - **Trend**: Leftmost distribution, peaks near 80. - **Key Data**: - Average Accuracy: `82` (annotated with orange dotted line). 2. **SuperCorrect-DeepSeek-7B (Orange)** - **Trend**: Overlaps with green distribution, peaks near 80. - **Key Data**: - Average Accuracy: `82` (annotated with orange dotted line). 3. **Qwen2.5-Math-7B-Instruct (Blue)** - **Trend**: Centered distribution, peaks near 100. - **Key Data**: - Average Accuracy: `100` (annotated with pink dotted line). - **Annotation**: "Higher Mean" (red arrow pointing to blue line). 4. **SuperCorrect-Qwen-7B (Pink)** - **Trend**: Rightmost distribution, peaks near 128. - **Key Data**: - Average Accuracy: `128` (annotated with pink dotted line). - **Annotation**: "Lower Variance" (red arrow pointing to pink line). --- ### Annotations - **Red Arrows**: - "Higher Mean" (points to blue line). - "Lower Variance" (points to pink line). --- ### Spatial Grounding - **Legend Coordinates**: Top-left (exact pixel values not provided). - **Axis Markers**: - X-axis ticks at 60, 80, 100, 120, 140. - Y-axis ticks at 0.00, 0.02, 0.04, 0.06, 0.08, 0.10, 0.12, 0.14. --- ### Component Isolation 1. **Header**: Chart title centered at the top. 2. **Main Chart**: - Four overlapping density curves with shaded areas. - Dotted lines marking average accuracies. 3. **Footer**: No explicit footer text. --- ### Verification - **Color Consistency**: - All legend labels match line colors (e.g., green = DeepSeek-Math-Instruct-7B). - **Trend Logic**: - Blue line (Qwen2.5-Math-7B-Instruct) has the highest mean (100) and overlaps with pink line (SuperCorrect-Qwen-7B) at higher accuracies. - Pink line (SuperCorrect-Qwen-7B) has the highest mean (128) and narrowest spread (lowest variance). --- ### Missing Information - No explicit data table or numerical values beyond averages. - No textual description of variance calculations. --- ### Final Notes - The chart compares model performance via density distributions, emphasizing mean accuracy and variance. - SuperCorrect-Qwen-7B (pink) outperforms others in mean accuracy and consistency. - Qwen2.5-Math-7B-Instruct (blue) shows moderate performance with higher variance than SuperCorrect-Qwen-7B. </details> Figure 5: Quantitative analysis on reasoning stability. The higher mean value denotes higher average accuracy rate, and lower variance denotes higher reasoning stability. Ablation Study We conduct ablation study of our SuperCorrect and put results in Table 2. As we can see, the improvement of traditional SFT is limited compare to our HSFT, which falls behind by 5% in accuracy. Based on our HSFT models, we further apply some self-correction methods such as Reflexion (Shinn et al., 2024) to compare with our Cross-DPO. From the results, we can find that our method wins again with lead of 7% in accuracy compare to Reflexion. These promising results demonstrate the effectiveness of our HSFT and cross-model DPO. Here we take an illustrative example in Table 3 of Section 5.3 for better understanding of our effective hierarchical thought reasoning. The CoT prompting method shows misunderstanding of ”empty set” as it fails to account for the fact that the 512 sets already include the empty set. Equipped with our hierarchical thought-based reasoning (denoted as HT in Appendix A), we can see that the model realizes that the 512 sets include empty set. However, it fails to correctly recall the fact that the problem requires to include the empty set in the final answer, which is caused by hallucination issue. Finally, our HSFT LLMs could correctly resolve the problem with accurate understanding of empty set and avoid the hallucination issue. SupperCorrect Breaks Thought Bottleneck The problems within MATH dataset encompass a wide range of seven topics including algebra, counting & probability, intermediate algebra, number theory, geometry, prealgebra and precalculus. During our experiments, we observe that the accuracy for each topics are quiet different. For most LLMs, they tend to show better performance on algebra and prealgebra, but for other topics, it always show degradation in accuracy because they may have some thought bottleneck on those topics. As shown in Figure 4, our SuperCorrect improves the reasoning performance on all topics. It is noted that for the topics which are originally difficult for LLMs, it shows a more significant improvement compare to topics that the models are already mastered. This is because we utilize the error-driven insights during the Cross-model DPO stage to break the original thought bottleneck of LLMs, thus enlightening them with new techniques and tricks to solve the problems that they used have no idea to solve. The results further proves that our SuperCorrect could help to break the original thought bottleneck thus significantly improve the reasoning ability of LLMs, and narrowing the performance gap for different topics. More detail reasoning and self-correction results can be found in Appendix B. and Appendix C. SuperCorrect Achieves Better Reasoning Stability The test set of MATH dataset consists of 5000 problems in 5 different difficulty levels. To further evaluate the reasoning stability of our method, we additionally sample 300 problems of level-5 (hardest) from MATH test dataset. We conduct a quantitative analysis by repeating the experiment 256 times and compute the mean and variance of accuracy as shown in Figure 5. We can observe that, compare to the base model, our SuperCorrect helps to achieve higher mean value of accuracy rate. Moreover, our SuperCorrect significantly reduce the variance of accuracy distribution of multiple reasoning times. These phenomenons demonstrate our SuperCorrect can effectively improve both accuracy and stability for difficult reasoning problems. 5.3 Detailed Qualitative Analysis In this section, we provide a detailed comparison for error-prone reasoning steps and reasoning results between three different methods, including CoT prompting, our first-stage HSFT models and our SuperCorrect. Table 3: Qualitative comparison between error-prone steps for different methods. Here we use different colors to represents different parts of reasoning. We denote the erroneous reasoning steps in purple, the error cause in red, correct reasoning steps that show improvement in black and the summary for improvement in green. | CoT HSFT SuperCorrect | ## Step 4: Account for the empty set. We need to include the empty set in our count, so we add 1 to the total number of subsets. (Error Cause: Ignore the fact that empty set has already been counted) ## Step 5: Calculate the final answer. The total number of subsets of the composite numbers is $2^{9}+1=512+1=513$ . ✗ (Error Cause: Repeatedly counted empty set) $\langle\text{Step4}\rangle$ …… which is $2^{9}=512$ . However, this includes the empty set, which is not a subset of the set of composite numbers. (Improvement:Notice the empty set is included within the 512 subsets) $\langle\text{/Step4}\rangle$ $\langle\text{Step5}\rangle$ We need to subtract 1 from 512 to exclude the empty set. Therefore, the total number of subsets of the set of composite numbers is $512-1=511$ . ✗ $\langle\text{/Step5}\rangle$ (Error Cause: Hallucination issue makes LLMs forget the fact that it is required to count empty set in the problem.) | | --- | --- | | $\langle\text{Step6}\rangle$ Calculate the number of subsets containing only composite numbers. $\langle\text{Key}\rangle$ The number of subsets of a set with n elements is $2^{n}$ . Here, with 9 composite divisors, the number of subsets is $2^{9}=512$ . This includes the empty set, which is required by the problem statement. ✓ $\langle\text{Key}\rangle$ $\langle\text{/Step6}\rangle$ Improvement: 1. Successfully notice the empty set is included within 512 subset 2. Mitigate the influence of hallucination issue | | 5.4 Comparison Between Step-DPO and Cross-model DPO We conduct qualitative analysis between Step-DPO and our Cross-model DPO. We choose Qwen2.5-Math-Instruct as base model, and we apply Step-DPO on the base model to compare the results. It should be noted that Step-DPO utilize CoT style prompt, for fair comparison, we choose the most suitable prompting method for each model. As shown in Table 4, based on the previous unsolved problems, Step-DPO could locate the error reasoning steps and make corrections (e.g. further identify another multiples of 7), but it but struggles to fully correct them. Compare to Step-DPO, our method could not only locate the erroneous steps, but also conduct accurate self-correction thus solving previous unsolvable problems. Table 4: Qualitative comparison between Step-DPO and Cross-model DPO. | Base Model Step-DPO Cross-model DPO | ### Step 1: Factors of 34 The prime factorization of 34 is: $34=2× 17$ The factors of 34 are: $1,2,17,34$ …… ### Step 4: Identify multiples of 7 from the list From the provided list, the multiples of 7 are: - 14 (since $7× 2=14$ ) (Error Cause: Ignore the fact that 56,91 is also multiples of 7) …… ### Step 7: Count the unique numbers The unique numbers that are either factors of 34 or multiples of 7 are: - $1,2,14,17$ Thus, the total count is: $4 4 4$ ✗ …… ### Step 2: Identify Multiples of 7 The multiples of 7 are the numbers that can be expressed as $7× k$ , where $k$ is an integer. Among the given numbers, the multiples of 7 are: - $14=7× 2$ - $91=7× 13$ Thus, the multiples of 7 from the list are: $14,91$ (Error Cause: Still unable to fully recognize all the multiples of 7, missing 56 here) ### Step 3: Combine the Results Now, we combine the factors of 34 and the multiples of 7, ensuring not to double-count any numbers. The unique numbers that are either factors of 34 or multiples of 7 are: - Factors of 34: $1,2,17$ - Multiples of 7: $14,91$ Combining these, we have: $1,2,14,17,91$ ### Conclusion Counting the unique numbers, we find that there are: $5 5 5$ ✗ | | --- | --- | | …… $\langle\text{Step2}\rangle$ Identify the multiples of 7 from the given list. $\langle\text{Key}\rangle$ Multiples of 7 are numbers that can be expressed as 7 multiplied by an integer. It’s important to check each number’s divisibility by 7 to determine if it qualifies. Numbers in the list: 1, 2, 3, 4, 8, 14, 17, 29, 56, 91 Multiples of 7: 14, 56, 91 (Self-Correction: Correctly identifies all the multiples of 7) $\langle\text{/Step2}\rangle$ $\langle\text{Step4}\rangle$ Count the total number of unique numbers identified. $\langle\text{Key}\rangle$ Counting accurately ensures the final answer reflects the correct quantity of numbers that meet the criteria. Total numbers: 6 $\langle\text{/Step4}\rangle$ …… $\langle\text{Answer}\rangle$ 6 $\langle\text{/Answer}\rangle$ ✓ | | 5.5 Quality Evaluation for Teacher LLM Generated Content 5.5.1 Evaluation of Inspector LLM We discuss the effectiveness of inspector LLM which further ensures the quality of the generated content of Teacher LLMs. As shown in Table 5, we compare the correctness of correction traces generated by three different teacher LLMs across three datasets. The application of the Inspector LLM significantly improves the quality of the final correction traces compared to direct generation. Notably, for LLMs with advanced capabilities that already produce high-quality outputs, it still shows clear improvements. These results demonstrate that the Inspector LLM markedly enhances the accuracy of correction traces, especially for datasets where initial performance was lower. Table 5: Quantitative analysis of inspector LLM regarding the correctness of correction traces on various datasets. | Teacher LLM (GPT-4o-mini) | 100% | 92.4% | 89.6% | | --- | --- | --- | --- | | Teacher LLM (GPT-4o-mini) + Inspector LLM (o1-preview) | 100% | 98.8% | 96.2% | | Teacher LLM (GPT-4o) | 100% | 94.4% | 91.3% | | Teacher LLM (GPT-4o) + Inspector LLM (o1-preview) | 100% | 99.2% | 97.5% | | Teacher LLM (o1-mini) | 100% | 98.2% | 94.8% | | Teacher LLM (o1-mini) + Inspector LLM (o1-preview) | 100% | 99.6% | 98.7% | 5.5.2 Analysis on the Quality of Direct Generation Based on the results in Table 5, the experimental results without the Inspector LLM demonstrate that our directly generated correction traces are already of high quality. We attribute this to our design approach, as outlined below: - 1. Leveraging Frontier Teacher LLMs: To ensure the quality of content generated by the teacher LLM, we utilize state-of-the-art LLMs, specifically o1-mini, as the teacher LLM. These models are capable of identifying logical flaws and errors, and they generate high-quality analysis and corrections, as evidenced by the quantitative results. - 2. Grounding Correction Traces with Ground-Truth Context: To ensure the accuracy of the correction traces generated by the teacher LLM, as demonstrated in Appendix A, the prompts for generating analysis ( $a_{i}$ ) and correction ( $c_{i}$ ) are based on the input question along with the ground-truth solution. This approach grounds the correction trace with the ground-truth solution as context, thereby ensuring the accuracy of the generated content. 5.6 More Ablation Studies Further Analysis on Cross-model DPO We first sample 500 erroneous solutions from our dataset, and we use o1-mini to conduct correction trace on the dataset as the ground truth to measure the model alignment (Xu et al., 2022; Zhang et al., 2023b; Khope & Elias, 2022; Guo et al., 2022). We conduct our experiments on three different models after HSFT stage, as shown in Table 6. We additionally introduce two metrics to evaluate the effectiveness of our Cross-model DPO: (1) Locate correctness: representing whether the model correctly finds the error steps. (2) Correction accuracy: representing whether the model accurately corrects the error steps. We utilize o1-preview as a judger to compare each correction trace generated by the models after Cross-model DPO with the ground truth. From the results, our cross-model DPO shows significant improvements across all models, demonstrating its effectiveness. Table 6: Quantitative analysis on the effectiveness of our Our Cross-model DPO. | Meta-Llama-3.1 + HSFT | 0.31 | 0.08 | | --- | --- | --- | | Meta-Llama-3.1 + HSFT + Cross-model DPO | 0.49 | 0.27 | | DeepSeek + HSFT | 0.23 | 0.07 | | DeepSeek + HSFT + Cross-model DPO | 0.42 | 0.23 | | Qwen2.5-Math + HSFT | 0.43 | 0.12 | | Qwen2.5-Math + HSFT+ Cross-model DPO | 0.67 | 0.46 | Ablation Study with More Base LLMs As shown in Table 7. The result shows that our SuperCorrect can generalize to different LLM architectures, and consistently achieves better performance in both HSFT stage and Cross-model DPO stage, further validating our effectiveness. Table 7: Ablation study with more base LLMs on MATH and GSM8K. Base1: Llama3.1, Base2: DeepSeek-Math. | MATH (%) GSM8K (%) Model | 51.9 84.5 Base2 | 53.7 86.2 Base2 + SFT | 55.4 87.2 Base2 + HSFT | 56.7 86.8 Base2-HSFT + Reflexion | 58.2 89.7 Base2-HSFT + Cross-DPO | | --- | --- | --- | --- | --- | --- | | MATH (%) | 46.8 | 49.2 | 50.9 | 51.2 | 54.6 | | GSM8K (%) | 82.9 | 84.5 | 85.7 | 85.8 | 88.2 | Ablation Study on Prompt Style To further evaluate the effectiveness of our meticulously designed hierarchical thought template, we additionally conduct quantitative experiments to show the impact of prompt styles and our hierarchical prompt design. Here we use five prompt styles: 1) CoT 2) CoT + Hierarchical Prompt (without generalization step) 3) CoT + Hierarchical Prompt (with generalization step) 4) Our hierarchical prompt (Not in XML) 5) Our hierarchical prompt (XML). We additionally curated four datasets based on the same 100k math problems with the first four prompt styles. We then trained Qwen2.5-Math-Instruct, Llama3.1-8B-Instruct and DeepSeek-Math-7B on these dataset with the same training settings and evaluate the accuracy on Math dataset. As shown in Table 8, the experimental results indicate that hierarchical reasoning significantly improves model accuracy compared to using CoT as a baseline. Additionally, changing the prompt style (e.g., to XML format) has a small impact on the final accuracy, further demonstrating the effectiveness of our hierarchical reasoning design. Although adding generalization steps helps the model better summarize tasks and thereby enhances its performance, our experimental results indicate that the primary contribution to performance improvements in the HSFT stage comes from the hierarchical reasoning style we designed. Table 8: Ablation study with different prompt styles. H denotes with hierarchical reasoning style and Gen denotes with generalization step. | Models/Prompt Style Qwen2.5-Math-7B Llama3.1-8B | CoT 57.4 52.6 | CoT + H (No Gen) 59.7 53.3 | CoT + H (With Gen) 60.8 53.6 | Ours (Not XML) 61.8 53.7 | Ours (XML) 62.4 54.1 | | --- | --- | --- | --- | --- | --- | | DeepSeek-Math-7B | 46.8 | 49.6 | 50.2 | 50.6 | 51.6 | 6 Conclusion In this paper, we propose SuperCorrect, a novel two-stage framework that significantly improve both reasoning and reflection processes of language models. In SuperCorrect, We propose hierarchical thought-based fine-tuning to enable LLMs to produce more fine-grained reasoning thoughts and introduce cross-model collaborative DPO to enhance the self-correction abilities of the student LLMS by following the teacher’s correction traces. Extensive experiments consistently demonstrate our superiority over previous methods, surpasses powerful DeepSeekMath-7B by 5.3% $\sim$ 7.8% and Qwen2.5-Math-7B by 6.3% $\sim$ 15.1% on MATH and GSM8K benchmarks. For future work, we will generalize this new framework to larger models and more complex datasets. Acknowledgement This work is supported by National Natural Science Foundation of China (U23B2048, U22B2037), Beijing Municipal Science and Technology Project (Z231100010323002), research grant No. SH2024JK29 and High-performance Computing Platform of Peking University and in part by NUS Start-up Grant A-0010106-00-00. References - Achiam et al. (2023) Josh Achiam, Steven Adler, Sandhini Agarwal, Lama Ahmad, Ilge Akkaya, Florencia Leoni Aleman, Diogo Almeida, Janko Altenschmidt, Sam Altman, Shyamal Anadkat, et al. Gpt-4 technical report. arXiv preprint arXiv:2303.08774, 2023. - Anil et al. (2023) Rohan Anil, Andrew M Dai, Orhan Firat, Melvin Johnson, Dmitry Lepikhin, Alexandre Passos, Siamak Shakeri, Emanuel Taropa, Paige Bailey, Zhifeng Chen, et al. Palm 2 technical report. arXiv preprint arXiv:2305.10403, 2023. - Arora et al. (2022) Simran Arora, Avanika Narayan, Mayee F Chen, Laurel Orr, Neel Guha, Kush Bhatia, Ines Chami, and Christopher Re. Ask me anything: A simple strategy for prompting language models. In The Eleventh International Conference on Learning Representations, 2022. - Bai et al. (2022a) Yuntao Bai, Andy Jones, Kamal Ndousse, Amanda Askell, Anna Chen, Nova DasSarma, Dawn Drain, Stanislav Fort, Deep Ganguli, Tom Henighan, et al. Training a helpful and harmless assistant with reinforcement learning from human feedback. arXiv preprint arXiv:2204.05862, 2022a. - Bai et al. (2022b) Yuntao Bai, Saurav Kadavath, Sandipan Kundu, Amanda Askell, Jackson Kernion, Andy Jones, Anna Chen, Anna Goldie, Azalia Mirhoseini, Cameron McKinnon, et al. Constitutional ai: Harmlessness from ai feedback. arXiv preprint arXiv:2212.08073, 2022b. - Besta et al. (2024) Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Michal Podstawski, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann, Hubert Niewiadomski, Piotr Nyczyk, et al. Graph of thoughts: Solving elaborate problems with large language models. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pp. 17682–17690, 2024. - Brown et al. (2020) Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. Language models are few-shot learners. Advances in neural information processing systems, 33:1877–1901, 2020. - Chen et al. (2023a) Pinzhen Chen, Zhicheng Guo, Barry Haddow, and Kenneth Heafield. Iterative translation refinement with large language models. arXiv preprint arXiv:2306.03856, 2023a. - Chen et al. (2022) Wenhu Chen, Xueguang Ma, Xinyi Wang, and William W Cohen. Program of thoughts prompting: Disentangling computation from reasoning for numerical reasoning tasks. arXiv preprint arXiv:2211.12588, 2022. - Chen et al. (2023b) Wenhu Chen, Xueguang Ma, Xinyi Wang, and William W Cohen. Program of thoughts prompting: Disentangling computation from reasoning for numerical reasoning tasks. Transactions on Machine Learning Research, 2023b. - Christiano et al. (2017) Paul F Christiano, Jan Leike, Tom Brown, Miljan Martic, Shane Legg, and Dario Amodei. Deep reinforcement learning from human preferences. Advances in neural information processing systems, 30, 2017. - Cobbe et al. (2021) Karl Cobbe, Vineet Kosaraju, Mohammad Bavarian, Mark Chen, Heewoo Jun, Lukasz Kaiser, Matthias Plappert, Jerry Tworek, Jacob Hilton, Reiichiro Nakano, Christopher Hesse, and John Schulman. Training verifiers to solve math word problems. arXiv preprint arXiv:2110.14168, 2021. - Dao et al. (2022) Tri Dao, Dan Fu, Stefano Ermon, Atri Rudra, and Christopher Ré. Flashattention: Fast and memory-efficient exact attention with io-awareness. Advances in Neural Information Processing Systems, 35:16344–16359, 2022. - Du et al. (2022) Zhengxiao Du, Yujie Qian, Xiao Liu, Ming Ding, Jiezhong Qiu, Zhilin Yang, and Jie Tang. Glm: General language model pretraining with autoregressive blank infilling. In Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 320–335, 2022. - Dubey et al. (2024) Abhimanyu Dubey, Abhinav Jauhri, Abhinav Pandey, Abhishek Kadian, Ahmad Al-Dahle, Aiesha Letman, Akhil Mathur, Alan Schelten, Amy Yang, Angela Fan, et al. The llama 3 herd of models. arXiv preprint arXiv:2407.21783, 2024. - Gao et al. (2023a) L Gao, J Tow, B Abbasi, S Biderman, S Black, A DiPofi, C Foster, L Golding, J Hsu, A Le Noac’h, et al. A framework for few-shot language model evaluation, 12 2023. URL https://zenodo. org/records/10256836, 7, 2023a. - Gao et al. (2023b) Luyu Gao, Aman Madaan, Shuyan Zhou, Uri Alon, Pengfei Liu, Yiming Yang, Jamie Callan, and Graham Neubig. Pal: Program-aided language models. In International Conference on Machine Learning, pp. 10764–10799. PMLR, 2023b. - Gou et al. (2023) Zhibin Gou, Zhihong Shao, Yeyun Gong, Yujiu Yang, Minlie Huang, Nan Duan, Weizhu Chen, et al. Tora: A tool-integrated reasoning agent for mathematical problem solving. arXiv preprint arXiv:2309.17452, 2023. - Guo et al. (2025) Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning. arXiv preprint arXiv:2501.12948, 2025. - Guo et al. (2022) Lihua Guo, Dawu Chen, and Kui Jia. Knowledge transferred adaptive filter pruning for cnn compression and acceleration. Science China. Information Sciences, 65(12):229101, 2022. - Hendrycks et al. (2021) Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. Measuring mathematical problem solving with the math dataset. arXiv preprint arXiv:2103.03874, 2021. - Huang et al. (2023) Jie Huang, Xinyun Chen, Swaroop Mishra, Huaixiu Steven Zheng, Adams Wei Yu, Xinying Song, and Denny Zhou. Large language models cannot self-correct reasoning yet. arXiv preprint arXiv:2310.01798, 2023. - Jaques et al. (2020) Natasha Jaques, Judy Hanwen Shen, Asma Ghandeharioun, Craig Ferguson, Agata Lapedriza, Noah Jones, Shixiang Shane Gu, and Rosalind Picard. Human-centric dialog training via offline reinforcement learning. arXiv preprint arXiv:2010.05848, 2020. - Jiang et al. (2024) Albert Q Jiang, Alexandre Sablayrolles, Antoine Roux, Arthur Mensch, Blanche Savary, Chris Bamford, Devendra Singh Chaplot, Diego de las Casas, Emma Bou Hanna, Florian Bressand, et al. Mixtral of experts. arXiv preprint arXiv:2401.04088, 2024. - Khope & Elias (2022) Sarika R Khope and Susan Elias. Critical correlation of predictors for an efficient risk prediction framework of icu patient using correlation and transformation of mimic-iii dataset. Data Science and Engineering, 7(1):71–86, 2022. - Khot et al. (2022) Tushar Khot, Harsh Trivedi, Matthew Finlayson, Yao Fu, Kyle Richardson, Peter Clark, and Ashish Sabharwal. Decomposed prompting: A modular approach for solving complex tasks. In The Eleventh International Conference on Learning Representations, 2022. - Kim et al. (2024) Geunwoo Kim, Pierre Baldi, and Stephen McAleer. Language models can solve computer tasks. Advances in Neural Information Processing Systems, 36, 2024. - Kojima et al. (2022) Takeshi Kojima, Shixiang Shane Gu, Machel Reid, Yutaka Matsuo, and Yusuke Iwasawa. Large language models are zero-shot reasoners. Advances in neural information processing systems, 35:22199–22213, 2022. - Lai et al. (2024) Xin Lai, Zhuotao Tian, Yukang Chen, Senqiao Yang, Xiangru Peng, and Jiaya Jia. Step-dpo: Step-wise preference optimization for long-chain reasoning of llms. arXiv preprint arXiv:2406.18629, 2024. - Li et al. (2024a) Chen Li, Weiqi Wang, Jingcheng Hu, Yixuan Wei, Nanning Zheng, Han Hu, Zheng Zhang, and Houwen Peng. Common 7b language models already possess strong math capabilities. arXiv preprint arXiv:2403.04706, 2024a. - Li et al. (2024b) Jia Li, Edward Beeching, Lewis Tunstall, Ben Lipkin, Roman Soletskyi, Shengyi Huang, Kashif Rasul, Longhui Yu, Albert Q Jiang, Ziju Shen, et al. Numinamath: The largest public dataset in ai4maths with 860k pairs of competition math problems and solutions. 2024b. - Li et al. (2023) Ming Li, Lichang Chen, Jiuhai Chen, Shwai He, and Tianyi Zhou. Reflection-tuning: Recycling data for better instruction-tuning. In NeurIPS 2023 Workshop on Instruction Tuning and Instruction Following, 2023. - Li et al. (2024c) Ming Li, Lichang Chen, Jiuhai Chen, Shwai He, Jiuxiang Gu, and Tianyi Zhou. Selective reflection-tuning: Student-selected data recycling for llm instruction-tuning. arXiv preprint arXiv:2402.10110, 2024c. - Liu et al. (2024) Aixin Liu, Bei Feng, Bin Wang, Bingxuan Wang, Bo Liu, Chenggang Zhao, Chengqi Dengr, Chong Ruan, Damai Dai, Daya Guo, et al. Deepseek-v2: A strong, economical, and efficient mixture-of-experts language model. arXiv preprint arXiv:2405.04434, 2024. - Lu et al. (2024) Zimu Lu, Aojun Zhou, Houxing Ren, Ke Wang, Weikang Shi, Junting Pan, Mingjie Zhan, and Hongsheng Li. Mathgenie: Generating synthetic data with question back-translation for enhancing mathematical reasoning of llms. arXiv preprint arXiv:2402.16352, 2024. - Luo et al. (2023) Haipeng Luo, Qingfeng Sun, Can Xu, Pu Zhao, Jianguang Lou, Chongyang Tao, Xiubo Geng, Qingwei Lin, Shifeng Chen, and Dongmei Zhang. Wizardmath: Empowering mathematical reasoning for large language models via reinforced evol-instruct. arXiv preprint arXiv:2308.09583, 2023. - Madaan et al. (2024) Aman Madaan, Niket Tandon, Prakhar Gupta, Skyler Hallinan, Luyu Gao, Sarah Wiegreffe, Uri Alon, Nouha Dziri, Shrimai Prabhumoye, Yiming Yang, et al. Self-refine: Iterative refinement with self-feedback. Advances in Neural Information Processing Systems, 36, 2024. - Miao et al. (2023) Ning Miao, Yee Whye Teh, and Tom Rainforth. Selfcheck: Using llms to zero-shot check their own step-by-step reasoning. arXiv preprint arXiv:2308.00436, 2023. - Ning et al. (2023) Xuefei Ning, Zinan Lin, Zixuan Zhou, Zifu Wang, Huazhong Yang, and Yu Wang. Skeleton-of-thought: Large language models can do parallel decoding. In The Twelfth International Conference on Learning Representations, 2023. - Ouyang et al. (2022) Long Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida, Carroll Wainwright, Pamela Mishkin, Chong Zhang, Sandhini Agarwal, Katarina Slama, Alex Ray, et al. Training language models to follow instructions with human feedback. Advances in neural information processing systems, 35:27730–27744, 2022. - Press et al. (2023) Ofir Press, Muru Zhang, Sewon Min, Ludwig Schmidt, Noah A Smith, and Mike Lewis. Measuring and narrowing the compositionality gap in language models. In Findings of the Association for Computational Linguistics: EMNLP 2023, pp. 5687–5711, 2023. - Rafailov et al. (2024) Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model. Advances in Neural Information Processing Systems, 36, 2024. - Reid et al. (2024) Machel Reid, Nikolay Savinov, Denis Teplyashin, Dmitry Lepikhin, Timothy Lillicrap, Jean-baptiste Alayrac, Radu Soricut, Angeliki Lazaridou, Orhan Firat, Julian Schrittwieser, et al. Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context. arXiv preprint arXiv:2403.05530, 2024. - Roziere et al. (2023) Baptiste Roziere, Jonas Gehring, Fabian Gloeckle, Sten Sootla, Itai Gat, Xiaoqing Ellen Tan, Yossi Adi, Jingyu Liu, Romain Sauvestre, Tal Remez, et al. Code llama: Open foundation models for code. arXiv preprint arXiv:2308.12950, 2023. - Saunders et al. (2022) William Saunders, Catherine Yeh, Jeff Wu, Steven Bills, Long Ouyang, Jonathan Ward, and Jan Leike. Self-critiquing models for assisting human evaluators. arXiv preprint arXiv:2206.05802, 2022. - Schulman et al. (2017) John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. - Shao et al. (2024) Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Mingchuan Zhang, YK Li, Yu Wu, and Daya Guo. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300, 2024. - Shinn et al. (2024) Noah Shinn, Federico Cassano, Ashwin Gopinath, Karthik Narasimhan, and Shunyu Yao. Reflexion: Language agents with verbal reinforcement learning. Advances in Neural Information Processing Systems, 36, 2024. - Stiennon et al. (2020) Nisan Stiennon, Long Ouyang, Jeffrey Wu, Daniel Ziegler, Ryan Lowe, Chelsea Voss, Alec Radford, Dario Amodei, and Paul F Christiano. Learning to summarize with human feedback. Advances in Neural Information Processing Systems, 33:3008–3021, 2020. - Tang et al. (2024) Zhengyang Tang, Xingxing Zhang, Benyou Wan, and Furu Wei. Mathscale: Scaling instruction tuning for mathematical reasoning. arXiv preprint arXiv:2403.02884, 2024. - Touvron et al. (2023a) Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timothée Lacroix, Baptiste Rozière, Naman Goyal, Eric Hambro, Faisal Azhar, et al. Llama: Open and efficient foundation language models. arXiv preprint arXiv:2302.13971, 2023a. - Touvron et al. (2023b) Hugo Touvron, Louis Martin, Kevin Stone, Peter Albert, Amjad Almahairi, Yasmine Babaei, Nikolay Bashlykov, Soumya Batra, Prajjwal Bhargava, Shruti Bhosale, et al. Llama 2: Open foundation and fine-tuned chat models. arXiv preprint arXiv:2307.09288, 2023b. - (53) Sequence Tutor. Conservative fine-tuning of sequence generation models with kl-control natasha jaques, shixiang gu, dzmitry bahdanau, josé miguel hernández-lobato, richard e. Turner, Douglas Eck arXiv (2016-11-09) https://arxiv. org/abs/1611.02796 v9. - Tyen et al. (2024) Gladys Tyen, Hassan Mansoor, Victor Cărbune, Yuanzhu Peter Chen, and Tony Mak. Llms cannot find reasoning errors, but can correct them given the error location. In Findings of the Association for Computational Linguistics ACL 2024, pp. 13894–13908, 2024. - Wei et al. (2022) Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Fei Xia, Ed Chi, Quoc V Le, Denny Zhou, et al. Chain-of-thought prompting elicits reasoning in large language models. Advances in neural information processing systems, 35:24824–24837, 2022. - Xu et al. (2022) Yuemei Xu, Han Cao, Wanze Du, and Wenqing Wang. A survey of cross-lingual sentiment analysis: Methodologies, models and evaluations. Data Science and Engineering, 7(3):279–299, 2022. - Yang et al. (2024a) An Yang, Beichen Zhang, Binyuan Hui, Bofei Gao, Bowen Yu, Chengpeng Li, Dayiheng Liu, Jianhong Tu, Jingren Zhou, Junyang Lin, et al. Qwen2. 5-math technical report: Toward mathematical expert model via self-improvement. arXiv preprint arXiv:2409.12122, 2024a. - Yang et al. (2024b) Ling Yang, Zhaochen Yu, Tianjun Zhang, Shiyi Cao, Minkai Xu, Wentao Zhang, Joseph E Gonzalez, and Bin Cui. Buffer of thoughts: Thought-augmented reasoning with large language models. Advances in Neural Information Processing Systems, 2024b. - Yang et al. (2025) Ling Yang, Zhaochen Yu, Bin Cui, and Mengdi Wang. Reasonflux: Hierarchical llm reasoning via scaling thought templates. arXiv preprint arXiv:2502.06772, 2025. - Yao et al. (2024) Shunyu Yao, Dian Yu, Jeffrey Zhao, Izhak Shafran, Tom Griffiths, Yuan Cao, and Karthik Narasimhan. Tree of thoughts: Deliberate problem solving with large language models. Advances in Neural Information Processing Systems, 36, 2024. - Ying et al. (2024) Huaiyuan Ying, Shuo Zhang, Linyang Li, Zhejian Zhou, Yunfan Shao, Zhaoye Fei, Yichuan Ma, Jiawei Hong, Kuikun Liu, Ziyi Wang, et al. Internlm-math: Open math large language models toward verifiable reasoning. arXiv preprint arXiv:2402.06332, 2024. - Yu et al. (2023) Longhui Yu, Weisen Jiang, Han Shi, Jincheng Yu, Zhengying Liu, Yu Zhang, James T Kwok, Zhenguo Li, Adrian Weller, and Weiyang Liu. Metamath: Bootstrap your own mathematical questions for large language models. arXiv preprint arXiv:2309.12284, 2023. - Yue et al. (2023) Xiang Yue, Xingwei Qu, Ge Zhang, Yao Fu, Wenhao Huang, Huan Sun, Yu Su, and Wenhu Chen. Mammoth: Building math generalist models through hybrid instruction tuning. arXiv preprint arXiv:2309.05653, 2023. - Yue et al. (2024) Xiang Yue, Tuney Zheng, Ge Zhang, and Wenhu Chen. Mammoth2: Scaling instructions from the web. arXiv preprint arXiv:2405.03548, 2024. - Zelikman et al. (2024) Eric Zelikman, Georges Harik, Yijia Shao, Varuna Jayasiri, Nick Haber, and Noah D Goodman. Quiet-star: Language models can teach themselves to think before speaking. arXiv preprint arXiv:2403.09629, 2024. - Zhang et al. (2023a) Xiaotian Zhang, Chunyang Li, Yi Zong, Zhengyu Ying, Liang He, and Xipeng Qiu. Evaluating the performance of large language models on gaokao benchmark. arXiv preprint arXiv:2305.12474, 2023a. - Zhang et al. (2023b) Zhao Zhang, Yong Zhang, Da Guo, Shuang Zhao, and Xiaolin Zhu. Communication-efficient federated continual learning for distributed learning system with non-iid data. Science China Information Sciences, 66(2):122102, 2023b. - Zhang et al. (2022) Zhuosheng Zhang, Aston Zhang, Mu Li, and Alex Smola. Automatic chain of thought prompting in large language models. In The Eleventh International Conference on Learning Representations, 2022. - Zhou et al. (2022) Denny Zhou, Nathanael Schärli, Le Hou, Jason Wei, Nathan Scales, Xuezhi Wang, Dale Schuurmans, Claire Cui, Olivier Bousquet, Quoc V Le, et al. Least-to-most prompting enables complex reasoning in large language models. In The Eleventh International Conference on Learning Representations, 2022. - Zhu et al. (2024) Qihao Zhu, Daya Guo, Zhihong Shao, Dejian Yang, Peiyi Wang, Runxin Xu, Y Wu, Yukun Li, Huazuo Gao, Shirong Ma, et al. Deepseek-coder-v2: Breaking the barrier of closed-source models in code intelligence. arXiv preprint arXiv:2406.11931, 2024. - Ziegler et al. (2019) Daniel M Ziegler, Nisan Stiennon, Jeffrey Wu, Tom B Brown, Alec Radford, Dario Amodei, Paul Christiano, and Geoffrey Irving. Fine-tuning language models from human preferences. arXiv preprint arXiv:1909.08593, 2019. Appendix A Additional Prompting Details Prompt for Extracting Hierarchical Thought Template Transform the solution of the following math problem into a step-by-step XML format, each step should be enclosed within tags like $\langle\text{Step1}\rangle\langle/\text{Step1}\rangle$ . For each step enclosed within the tags, determine if this step is challenging and tricky, if so, add detailed explanation and analysis enclosed within $\langle\text{Key}\rangle\langle/\text{Key}\rangle$ in this step, as helpful annotations to make the student better understand this step correctly thus mastering the solution. After all the reasoning steps, summarize the common solution and reasoning steps to help him generalize to similar problems within $\langle\text{Generalized}\rangle\langle/\text{Generalized}\rangle$ . Finally present the final answer enclosed within $\langle\text{Answer}\rangle\langle/\text{Answer}\rangle$ . Hierarchical Thought-based Reasoning Prompt (HT): Solve the following math problem in a step-by-step XML format, each step should be enclosed within tags like $\langle\text{Step1}\rangle\langle/\text{Step1}\rangle$ . For each step enclosed within the tags, determine if this step is challenging and tricky, if so, add detailed explanation and analysis enclosed within $\langle\text{Key}\rangle\langle/\text{Key}\rangle$ in this step, as helpful annotations to help you thinking and remind yourself how to conduct reasoning correctly. After all the reasoning steps, summarize the common solution and reasoning steps to help you and your classmates who are not good at math generalize to similar problems within $\langle\text{Generalized}\rangle\langle/\text{Generalized}\rangle$ . Finally present the final answer within $\langle\text{Answer}\rangle\langle/\text{Answer}\rangle$ . Grounded Correction Trace Prompt: First transform the Reasoning steps to be Checked into our required XML format as follow: for each step, the steps should be within corresponding tags like $\langle\text{Step1}\rangle\langle/\text{Step1}\rangle$ , and next based on the problem and reference solution, evaluate each steps and find the fundamental logic flaws and errors in the given reasoning steps, if error detected, using $\langle\text{Cause}\rangle\langle/\text{Cause}\rangle$ to give a Refined and Concise explanation for the error cause within the corresponding Step tags along with $\langle\text{Correction}\rangle\langle/\text{Correction}\rangle$ to correct the error step and output correct step. And finally, present the correct final answer within $\langle\text{Answer}\rangle\langle/\text{Answer}\rangle$ . Output All the transformed reasoning steps from $\langle\text{Step1}\rangle\langle/\text{Step1}\rangle$ . Correction Trace Prompt: First transform the Reasoning steps to be Checked into our required XML format as follow: for each step, the steps should be within corresponding tags like $\langle\text{Step1}\rangle\langle/\text{Step1}\rangle$ , and next based on the problem, evaluate each steps and find the fundamental logic flaws and errors in the given reasoning steps, if error detected, using $\langle\text{Cause}\rangle\langle/\text{Cause}\rangle$ to give a Refined and Concise explanation for the error cause within the corresponding Step tags along with $\langle\text{Correction}\rangle\langle/\text{Correction}\rangle$ to correct the error step and output correct step. And finally, present the correct final answer within $\langle\text{Answer}\rangle\langle/\text{Answer}\rangle$ . Output All the transformed reasoning steps from $\langle\text{Step1}\rangle\langle/\text{Step1}\rangle$ . As shown above, we present our meticulously designed prompt template used in our experiments. The prompt for extracting hierarchical thought template is designed for teacher LLMs to transform the original solution into hierarchical thought template. And for hierarchical thought-based reasoning prompt denoted as HT, we utilize this prompt during the HSFT process and the evaluation process. Grounded correction trace prompt is also designed for teacher LLMs to locate and find the error-driven insight from the erroneous reasoning process. And finally, the correction trace prompt is used during our Cross-DPO stage, and further evaluation for self-correction. Appendix B Results of Hierarchical Thought-based Reasoning In this section, we show more detailed hierarchical reasoning process produced by SuperCorrect -Qwen-7b on three datasets, including GaoKao, MATH, GSM8K. For each dataset, we present two samples for demonstration. To better present the hierarchical thought during the reasoning process, we denote detailed thought within each step in black, the high-level generalized thought in purple. I GaoKao problem: Given the function $f(x)=\begin{cases}x+1,&x≤ 0\\ 2^{x},&x>0\end{cases}$ what is the range of values of $x$ that satisfies $f(x)+f\left(x-\frac{1}{2}\right)>1?$ Solution Description: $\langle\text{Step 1:}\rangle$ Determine the value of $f(x)$ based on the value of $x$ . $\langle\text{key}\rangle$ If $x≤ 0$ , then $f(x)=x+1$ . If $x>0$ , then $f(x)=2^{x}$ . $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Determine the value of $f\left(x-\frac{1}{2}\right)$ based on the value of $x$ . $\langle\text{key}\rangle$ If $x-\frac{1}{2}≤ 0$ (i.e., $x≤\frac{1}{2}$ ), then $f\left(x-\frac{1}{2}\right)=\left(x-\frac{1}{2}\right)+1=x+\frac{1}{2}$ . If $x-\frac{1}{2}>0$ (i.e., $x>\frac{1}{2}$ ), then $f\left(x-\frac{1}{2}\right)=2^{x-\frac{1}{2}}$ . $\langle\text{/key}\rangle$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Analyze the inequality $f(x)+f\left(x-\frac{1}{2}\right)>1$ in different intervals of $x$ . $\langle\text{key}\rangle$ This crucial step involves breaking down different cases based on the value of $x$ to apply the correct piecewise definitions of the function. $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Combine the solutions from all cases. $\langle\text{key}\rangle$ We find ranges from each case to generate a comprehensive final solution, ensuring we encompass all possible intervals of $x$ . $\langle\text{/key}\rangle$ $\langle\text{/Step 4:}\rangle$ $\langle\text{Generalized}\rangle$ To solve inequalities involving piecewise functions, follow these common steps: 1. Identify the different cases based on the definitions of the piecewise function. 2. Evaluate the function expressions for each case, including any shifted or transformed inputs. 3. Set up and solve the inequality within each interval determined by the cases. 4. Combine all valid solutions from each case to form the complete solution set. This systematic approach ensures accurate and comprehensive solutions to similar problems involving piecewise-defined functions and inequalities. $\langle\text{/Generalized}\rangle$ $\langle\text{Answer:}\rangle$ $x>-\frac{1}{4}$ $\langle\text{/Answer:}\rangle$ II GaoKao Problem: The secondary product rate of a certain product is 0.02. If you randomly select one from this product, it has been placed back into the pool 100 times. Let $X$ represent the number of secondary products collected, then $D(X)=$ ? Solution Description: $\langle\text{Step 1:}\rangle$ Identify the probability of selecting a secondary product. $\langle\text{key}\rangle$ Understanding the probability $p$ is crucial as it forms the basis for calculating the variance. In this case, the secondary product rate is given as $0.02$ , which means there’s a $2\%$ chance of selecting a secondary product each time. $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Determine the number of trials. $\langle\text{key}\rangle$ Recognizing the number of trials $n$ is essential. Here, the product has been placed back into the pool 100 times, indicating that each selection is independent and the total number of trials is 100. $\langle\text{/key}\rangle$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Calculate the expected value $E(X)$ of the number of secondary products collected. $\langle\text{key}\rangle$ The expected value $E(X)$ for a binomial distribution is calculated using the formula $E(X)=n× p$ . Substituting the given values: $E(X)=100× 0.02=2$ $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Calculate the variance $D(X)$ of the number of secondary products collected. $\langle\text{key}\rangle$ The variance $D(X)$ for a binomial distribution is given by $D(X)=n× p×(1-p)$ . Plugging in the values: $D(X)=100× 0.02×(1-0.02)=100× 0.02× 0.98=1.96$ $\langle\text{/key}\rangle$ $\langle\text{/Step 4:}\rangle$ $\langle\text{Generalized:}\rangle$ To solve similar problems involving the number of successes in a fixed number of independent trials with a constant probability of success: 1. Identify the probability of success $p$ and the number of trials $n$ . 2. Calculate the expected value $E(X)=n× p$ . 3. Determine the variance $D(X)=n× p×(1-p)$ . This approach uses the properties of the binomial distribution, which is applicable when each trial has two possible outcomes (success or failure) and the probability of success remains constant. $\langle\text{/Generalized:}\rangle$ $\langle\text{Answer:}\rangle$ The variance $D(X)$ of the number of secondary products collected is $1.96$ . $\langle\text{/Answer:}\rangle$ III MATH Problem: What is the tens digit in the sum $7!+8!+9!+·s+2006!?$ Solution Description: $\langle\text{Step 1:}\rangle$ Identify the problem: We need to find the tens digit in the sum $7!+8!+9!+·s+2006!$ . $\langle\text{key}\rangle$ Understanding the problem is crucial. We are looking for a specific digit in a large sum, which means we need to focus on the contributions of each factorial to the tens place. $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Recognize that for $n≥ 10$ , $n!$ is divisible by 100. $\langle\text{key}\rangle$ This is a key insight because it means that $10!,11!,12!,...,2006!$ do not affect the tens digit of the sum. Only the factorials from $7!$ to $9!$ will influence the tens digit. $\langle\text{/key}\rangle$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Calculate $7!$ , $8!$ , and $9!$ : $7!=5040,\quad 8!=40320,\quad 9!=362880$ $\langle\text{key}\rangle$ Calculating factorials can be tedious, but it’s essential to ensure accuracy. Each factorial contributes to the overall sum, and we need their last two digits to determine the tens digit of the total sum. $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Extract the last two digits of each factorial: $7!\equiv 40±od{100},\quad 8!\equiv 20±od{100},\quad 9!\equiv 80±od{100}$ $\langle\text{key}\rangle$ Finding the last two digits involves taking the factorial modulo 100. This simplifies the problem by focusing only on the relevant digits that affect the tens place. $\langle\text{/key}\rangle$ $\langle\text{/Step 4:}\rangle$ $\langle\text{Step 5:}\rangle$ Sum the last two digits: $40+20+80=140$ $\langle\text{key}\rangle$ Adding the last two digits together gives us the intermediate sum. It’s important to keep track of the total to determine the final tens digit. $\langle\text{/key}\rangle$ $\langle\text{/Step 5:}\rangle$ $\langle\text{Step 6:}\rangle$ Determine the tens digit of the sum $140$ : $\text{Tens digit}=4$ $\langle\text{key}\rangle$ The tens digit is the second digit from the right in a number. Here, it’s clear that the tens digit of $140$ is $4$ , which is the answer we seek. $\langle\text{/key}\rangle$ $\langle\text{/Step 6:}\rangle$ $\langle\text{Generalized:}\rangle$ To solve similar problems, follow these steps: 1. Identify the range of factorials and determine which ones affect the desired digit. 2. Calculate the relevant factorials and extract the necessary digits. 3. Sum these digits and focus on the specific place value required (e.g., tens, hundreds). 4. Extract the desired digit from the final sum. $\langle\text{Generalized:}\rangle$ $\langle\text{Answer:}\rangle$ The tens digit is $\boxed{4}$ . $\langle\text{/Answer:}\rangle$ IV MATH Problem: In how many ways can the letters of the word ”COPYRIGHT” be arranged? Solution Description: $\langle\text{Step 1:}\rangle$ Identify the total number of letters in the word ”COPYRIGHT”. $\langle\text{key}\rangle$ The word ”COPYRIGHT” consists of 9 letters. It’s important to count all letters accurately to determine the total arrangements. $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Determine if any letters are repeated in the word. $\langle\text{key}\rangle$ In ”COPYRIGHT”, all letters are unique. Understanding whether letters are repeated is crucial because repeated letters reduce the number of unique arrangements. $\langle\text{/key}\rangle$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Apply the formula for permutations of unique objects. $\langle\text{key}\rangle$ Since all letters are unique, the number of arrangements is calculated using the factorial of the total number of letters: $9!$ . $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Calculate $9!$ to find the total number of arrangements. $\langle\text{key}\rangle$ $9!=9× 8× 7× 6× 5× 4× 3× 2× 1=362,880$ . This step involves multiplying a series of numbers, which can be calculated step-by-step to avoid errors. $\langle\text{/key}\rangle$ $\langle\text{/Step 4:}\rangle$ $\langle\text{Generalized:}\rangle$ To determine the number of arrangements of letters in a word, first count the total number of letters. If all letters are unique, use the factorial of the total count. If there are repeated letters, adjust the formula by dividing by the factorial of the count of each repeated letter. $\langle\text{/Generalized:}\rangle$ $\langle\text{Answer:}\rangle$ The letters of the word ”COPYRIGHT” can be arranged in 362,880 different ways. $\langle\text{/Answer:}\rangle$ V GSM8K Problem: Carlos is planting a lemon tree. The tree will cost $90 to plant. Each year it will grow 7 lemons, which he can sell for $1.5 each. It costs $3 a year to water and feed the tree. How many years will it take before he starts earning money on the lemon tree? Solution Description: $\langle\text{Step 1:}\rangle$ Calculate the revenue earned from selling lemons each year. $\langle\text{key}\rangle$ 7 lemons * $1.5 per lemon = $10.5. This step involves multiplying the number of lemons produced by the price per lemon. Understand the importance of identifying fixed production numbers (in this case, 7 lemons) and their respective market price ($1.5). The multiplication here gives us the total income from the lemons before accounting for expenses. $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Calculate the net earnings after deducting annual costs for watering and feeding the tree. $\langle\text{key}\rangle$ $10.5 - $3 = $7.5. This step is about understanding how to subtract fixed expenses from total revenue to find net income. It’s crucial to separate income from costs to ascertain true profit. The $3 cost for watering and feeding is constant each year, impacting the net returns from the lemon sales. $\langle\text{/key}\rangle$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Determine how many years it takes to cover the initial cost of planting the tree. $\langle\text{key}\rangle$ $90 / $7.5 = 12. In this step, you’re figuring out how long it takes to break even on the initial investment of $90. This involves dividing the total investment by the annual net earnings. Remember that this result indicates the breakeven year, but does not count the year in which the profits actually start. $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Identify the year when he starts earning profit from the lemon tree. $\langle\text{key}\rangle$ 12 (years to break even) + 1 = 13. This final calculation shifts the perspective from a breakeven analysis to profitability. Since he reaches the breakeven point at the end of year 12, he only begins to profit in year 13. This step emphasizes the importance of understanding financial timelines in cash flow analysis. $\langle\text{/key}\rangle$ $\langle\text{/Step 4:}\rangle$ $\langle\text{Generalized:}\rangle$ The solution involves calculating total income from sales, subtracting operating costs to find net earnings, and determining the break-even point by dividing the initial investment by annual net earnings. Finally, knowing when profit occurs adds critical insight into business investment analysis. For similar problems, follow these steps: identify revenues, calculate net profits, find break-even time, and ascertain the timeline for profitability. $\langle\text{/Generalized}\rangle$ $\langle\text{Answer:}\rangle$ 13 $\langle\text{/Answer}\rangle$ VI GSM8K Problem: Tommy is fundraising for his charity by selling brownies for $3 a slice and cheesecakes for $4 a slice. If Tommy sells 43 brownies and 23 slices of cheesecake, how much money does Tommy raise? Solution Description: $\langle\text{Step 1:}\rangle$ Calculate the total money raised from selling brownies. $\langle\text{key}\rangle$ To find the total money raised from brownies, we multiply the number of brownies sold by the price per brownie. This is a straightforward multiplication problem. Here, Tommy sold 43 brownies at $3 each. The calculation is: $43× 3=129$ . Understanding multiplication is crucial as it forms the basis for calculating total revenue from sales. $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Calculate the total money raised from selling cheesecakes. $\langle\text{key}\rangle$ Similar to the previous step, we need to multiply the number of cheesecakes sold by the price per cheesecake. Tommy sold 23 slices of cheesecake at $4 each. The calculation is: $23× 4=92$ . This step reinforces the concept of multiplication and helps in understanding how to calculate total sales from different products. $\langle\text{/key}\rangle$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Add the total money raised from both brownies and cheesecakes. $\langle\text{key}\rangle$ Now, we need to combine the total amounts raised from both products to find the overall total. This involves simple addition: $129$ (from brownies) + $92$ (from cheesecakes) = $221$ . This step is important as it teaches how to aggregate totals from different sources, a common task in finance and fundraising. $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Generalized}\rangle$ To calculate the total funds raised from selling different items, follow these common steps: 1. Identify the number of items sold for each product. 2. Determine the price per item for each product. 3. Calculate the total revenue for each product by multiplying the number of items sold by the price per item. 4. Sum all individual revenues to find the overall total funds raised. This systematic approach ensures accurate calculation of total revenue from multiple sources, which is essential in various financial and fundraising scenarios. $\langle\text{/Generalized}\rangle$ $\langle\text{Answer:}\rangle$ Tommy raises $221. $\langle\text{/Answer}\rangle$ Appendix C Improved Self-Correction Results In this section, we select three different self-correction results each from different datasets including MATH, GaoKao, and GSM8K. It should be noted that we split the incorrect reasoning steps with error cause analysis and teacher correction into two parts for better presentation. We denote the error cause in brown and we denoted the origianl error answer in red, and the correction along with correct answer are denoted in green. I GSM8K Problem: Carlos is planting a lemon tree. The tree will cost $90 to plant. Each year it will grow 7 lemons, which he can sell for $1.5 each. It costs $3 a year to water and feed the tree. How many years will it take before he starts earning money on the lemon tree? Correct reasoning process before error steps: $\langle\text{Step 1:}\rangle$ Calculate the total revenue from selling lemons each year. $\langle\text{key}\rangle$ To find the total revenue from selling lemons, multiply the number of lemons by the price per lemon. Here, Carlos sells 7 lemons at $1.5 each. This step is straightforward but crucial as it sets the foundation for understanding the income generated from the lemon tree. $\langle\text{/key}\rangle$ Total Revenue = 7 lemons * $1.5 per lemon = $10.5 $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Calculate the total cost of feeding and watering the tree each year. $\langle\text{key}\rangle$ This step involves identifying the annual costs of maintaining the lemon tree. The cost of feeding and watering is $3 per year. Understanding this cost helps in determining the net profit after accounting for all expenses. $\langle\text{/key}\rangle$ Total Cost = $3 $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Calculate the net profit per year. $\langle\text{key}\rangle$ Net profit is calculated by subtracting the total costs from the total revenue. This step shows how much money Carlos earns each year after all expenses are accounted for. $\langle\text{/key}\rangle$ Net Profit = Total Revenue - Total Cost = $10.5 - $3 = $7.5 $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Identify the initial cost of planting the tree. $\langle\text{key}\rangle$ The initial cost of planting the tree is a one-time expense of $90. This represents the initial investment that needs to be recovered through profits over multiple years. $\langle\text{/key}\rangle$ Initial Cost = $90 $\langle\text{/Step 4:}\rangle$ I Self-Correction For GSM8K Problem: Theses steps below are incorrect in the original reasoning steps $\langle\text{Step 5:}\rangle$ Calculate the number of years it will take to break even. $\langle\text{key}\rangle$ This step involves dividing the initial investment by the annual net profit to find out how many years it will take for the net profit to cover the initial cost. $\langle\text{/key}\rangle$ Years to Break Even = Initial Cost / Net Profit = $90 / $7.5 = 12 years $\langle\text{cause}\rangle$ While this calculation correctly determines that Carlos will break even after 12 years, it does not answer the question of when he starts earning money. The break-even point occurs at the end of the 12th year, meaning he hasn’t earned a profit yet within those 12 years. $\langle\text{/cause}\rangle$ $\langle\text{/Step 5:}\rangle$ $\langle\text{Step 6:}\rangle$ Determine when Carlos starts earning money from the lemon tree. $\langle\text{key}\rangle$ Since Carlos breaks even at the end of year 12, he will start earning profit from year 13 onwards. $\langle\text{/key}\rangle$ Year when profit starts = Years to Break Even + 1 = 12 + 1 = 13 years $\langle\text{correction}\rangle$ Therefore, Carlos will start earning money on the lemon tree in 13 years, not 12 years. $\langle\text{/correction}\rangle$ $\langle\text{/Step 6:}\rangle$ $\langle\text{Answer:}\rangle$ 13 $\langle\text{/Answer:}\rangle$ II MATH Problem: How many different bracelets have 3 identical orange beads, 3 identical black beads, and 1 teal bead, if rotating or flipping a bracelet does not change it? Correct reasoning process before error steps: $\langle\text{Step 1:}\rangle$ Identify the total number of beads and their types. $\langle\text{key}\rangle$ Understanding the composition of the bracelet is crucial. Here, we have 3 identical orange beads, 3 identical black beads, and 1 teal bead, making a total of 7 beads. $\langle\text{/key}\rangle$ $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Calculate the total number of arrangements without considering rotations or reflections. $\langle\text{key}\rangle$ Since the orange and black beads are identical within their groups, we use the formula for permutations of a multiset: $\frac{7!}{3!× 3!× 1!}.$ This accounts for the indistinguishability of the identical beads. $\langle\text{/key}\rangle$ Total Arrangements = $\frac{7!}{3!× 3!}=140.$ $\langle\text{/Step 2:}\rangle$ $\langle\text{Step 3:}\rangle$ Apply Burnside’s Lemma to account for rotational and reflectional symmetries. $\langle\text{key}\rangle$ Burnside’s Lemma is essential in counting distinct arrangements when symmetries (like rotations and reflections) are considered. It requires evaluating the number of arrangements fixed by each symmetry operation and averaging over the total number of symmetries. $\langle\text{/key}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Determine the number of arrangements fixed by each rotation. $\langle\text{key}\rangle$ - Identity rotation (0°): All 140 arrangements are fixed. - Nontrivial rotations (rotations by $\frac{360^{\circ}}{7}$ and its multiples): No arrangement is fixed because rotating the bracelet changes the positions of the beads, and with the given bead counts, it’s impossible to have a configuration that looks the same after such rotations. $\langle\text{/key}\rangle$ Number of fixed arrangements under rotations: - Identity rotation: 140 - Other rotations: 0 $\langle\text{/Step 4:}\rangle$ II Self-Correction For MATH Problem: Theses steps below are incorrect in original reasoning steps. $\langle\text{Step 5:}\rangle$ Determine the number of arrangements fixed by each reflection. $\langle\text{key}\rangle$ For reflections, each reflection fixes one bead (the center of reflection) and swaps the remaining beads in pairs. To have an arrangement fixed under reflection, the colors of the beads in each swapped pair must be the same. $\langle\text{/key}\rangle$ $\langle\text{cause}\rangle$ With 3 orange beads and 3 black beads (both odd counts), it’s impossible to pair all beads of the same color. Each pair requires 2 beads of the same color, so we need even counts of each color. Therefore, no arrangements are fixed under reflections because the color counts do not allow for all swapped pairs to be identical in color. $\langle\text{/cause}\rangle$ Number of fixed arrangements under reflections: 0 $\langle\text{/Step 5:}\rangle$ $\langle\text{Step 6:}\rangle$ Apply Burnside’s Lemma to find the number of distinct bracelets. The original error answer is 20 $\langle\text{key}\rangle$ According to Burnside’s Lemma, the number of distinct arrangements is the average number of arrangements fixed by each symmetry operation. The total number of symmetries in a bracelet with 7 beads is 14 (7 rotations and 7 reflections). $\langle\text{/key}\rangle$ Calculation: $\text{Number of distinct bracelets}=\frac{\text{Total fixed arrangements}}{% \text{Number of symmetries}}=\frac{140}{14}=10.$ $\langle\text{correction}\rangle$ Therefore, the correct number of different bracelets is **10**, not 20. The error in the original calculation was assuming that there were arrangements fixed under reflections, but due to the odd counts of identical beads, no such fixed arrangements exist. $\langle\text{/correction}\rangle$ $\langle\text{/Step 6:}\rangle$ $\langle\text{Answer:}\rangle$ There are 10 different bracelets. $\langle\text{/Answer:}\rangle$ III GaoKao Problem: Set point $O$ as the origin, the vertical line $x=a$ , and the two branches of the hyperbola $C:\frac{x^{2}}{a^{2}}-\frac{y^{2}}{b^{2}}=1$ (where $a>0$ and $b>0$ ) intersect at points $D$ and $E$ . If the area of quadrilateral $ODE$ is 8, then the minimum value of the distance between the two branches of $C$ is ( ) A. 4 B. 8 C. 16 D. 32 Correct reasoning process before error steps: $\langle\text{Step 1:}\rangle$ Set point $O$ as the origin and the vertical line $x=a$ . $\langle\text{/Step 1:}\rangle$ $\langle\text{Step 2:}\rangle$ Identify the two branches of the hyperbola $C:\frac{x^{2}}{a^{2}}-\frac{y^{2}}{b^{2}}=1$ , where $a>0$ and $b>0$ . $\langle\text{/Step 2:}\rangle$ III Self-Correction For GaoKao Problem: Theses steps below are incorrect in original reasoning steps. $\langle\text{Step 3:}\rangle$ Determine the points $D$ and $E$ where the vertical line $x=a$ intersects the hyperbola $C$ . $\langle\text{cause}\rangle$ Substituting $x=a$ into the hyperbola equation yields $y=0$ , resulting in only one intersection point $(a,0)$ . The assumption that there are two distinct points $D(a,b)$ and $E(a,-b)$ is incorrect. $\langle\text{/cause}\rangle$ $\langle\text{correction}\rangle$ Substitute $x=a$ into the hyperbola equation: $\frac{a^{2}}{a^{2}}-\frac{y^{2}}{b^{2}}=1\implies 1-\frac{y^{2}}{b^{2}}=1% \implies\frac{y^{2}}{b^{2}}=0\implies y=0$ Therefore, the vertical line $x=a$ intersects the hyperbola $C$ only at the point $D(a,0)$ . Point $E$ does not exist as there is only one intersection point. $\langle\text{/correction}\rangle$ $\langle\text{/Step 3:}\rangle$ $\langle\text{Step 4:}\rangle$ Calculate the area of quadrilateral $ODE$ . $\langle\text{cause}\rangle$ Since there is only one intersection point $D(a,0)$ , the quadrilateral $ODE$ does not exist. The area calculation based on non-existent points $E(a,b)$ and $A(a,-b)$ is invalid. $\langle\text{/cause}\rangle$ $\langle\text{correction}\rangle$ Reevaluate the problem statement. If the vertical line $x=a$ intersects the hyperbola at only one point $D(a,0)$ , the area calculation of quadrilateral $ODE$ is not applicable. It is likely that there is a misunderstanding in the problem setup. $\langle\text{/correction}\rangle$ $\langle\text{/Step 4:}\rangle$ $\langle\text{Step 5:}\rangle$ Find the minimum value of the distance between the two branches of the hyperbola. The original error answer is A = 4 $\langle\text{cause}\rangle$ The reasoning that the distance between the two branches is $2a$ is incorrect. Additionally, the approach to minimize $2a$ under the condition $ab=4$ does not align with the correct geometric interpretation of the hyperbola. $\langle\text{/cause}\rangle$ $\langle\text{correction}\rangle$ The distance between the two branches of the hyperbola $C$ is determined by the minimum vertical distance between corresponding points on the branches. To find this, consider the closest points on each branch: $\text{Distance}=2b.$ Given that the area condition was misapplied, we refer to the correct relationship from the Reference Solution where the minimum distance is found using optimization techniques. The correct minimum distance of the hyperbola $C$ is $8$ . $\langle\text{/correction}\rangle$ $\langle\text{/Step 5:}\rangle$ $\langle\text{Answer:}\rangle$ The minimum value of the distance of the hyperbola $C$ is $8$ . $\langle\text{/Answer:}\rangle$ ✓