LLMs cannot find reasoning errors, but can correct them given the error location
Open accessAbstract
While self-correction has shown promise in improving LLM outputs in terms of style and quality (e.g.Chen et al., 2023b;Madaan et al., 2023), recent attempts to self-correct logical or reasoning errors often cause correct answers to become incorrect, resulting in worse performances overall (Huang et al., 2023).In this paper, we show that poor self-correction performance stems from LLMs' inability to find logical mistakes, rather than their ability to correct a known mistake.Firstly, we benchmark several state-of-the-art LLMs on their mistake-finding ability and demonstrate that they generally struggle with the task, even in highly objective, unambiguous cases.Secondly, we test the correction abilities of LLMs -separately from mistake finding -using a backtracking setup that feeds ground truth mistake location information to the model.We show that this boosts downstream task performance across our 5 reasoning tasks, indicating that LLMs' correction abilities are robust.Finally, we show that it is possible to obtain mistake location information without ground truth labels or in-domain training data.We train a small classifier with out-of-domain data, which exhibits stronger mistake-finding performance than prompting a large model.We release our dataset of LLM-generated logical mistakes, BIG-Bench Mistake, to enable further research into locating LLM reasoning mistakes.
AI snapshot
Written from the paper’s full text.
TL;DR
This paper separates self-correction into mistake finding and output correction, showing that state-of-the-art LLMs struggle to locate logical errors in chain-of-thought traces but can correct them when given the error location. It releases BIG-Bench Mistake, a dataset of 2,186 annotated CoT traces across five reasoning tasks, and shows that oracle mistake locations improve downstream accuracy, while a small out-of-domain classifier can outperform few-shot prompting at mistake finding.
Key findings
- LLMs generally fail at mistake finding: GPT-4 achieved the best overall accuracy at 52.87 with direct step-level prompting, while GPT-3.5-Turbo reached 14.78, Gemini Pro 16.14, and PaLM 2 Unicorn 23.67 overall.
- Given oracle mistake locations, backtracking improved accuracy on originally incorrect traces across all five tasks: word sorting +23.53, tracking shuffled objects +43.92, logical deduction +36.86, multistep arithmetic +18.04, and Dyck languages +18.06; losses on originally correct traces were smaller: -11.11, -6.67, -11.43, -0.00, and -6.82 respectively.
- Random mistake locations produced smaller gains than oracle locations, supporting that the improvement depends on correct error localization.
- A small classifier (PaLM 2 Otter) trained on out-of-domain data improved mistake-finding over 3-shot PaLM 2 Unicorn prompting on 4 of 5 held-out tasks: word sorting +11.66, tracking shuffled objects +19.67, logical deduction -0.67, multistep arithmetic +4.00, and Dyck languages +22.59.
- Backtracking remains effective below perfect mistake-finding accuracy: losses begin to plateau at 65%, and for most tasks gains exceed losses around 60–70% classifier accuracy.
Methods
- Dataset: BIG-Bench Mistake contains 2,186 CoT-style traces generated with PaLM 2 Unicorn at temperature 0 across five BIG-Bench tasks: word sorting, tracking shuffled objects, logical deduction, multistep arithmetic, and Dyck languages. Each trace is annotated with the first logical error; four tasks use human annotation with at least 3 annotators and majority label, while Dyck languages uses mostly automatic annotation.
- Mistake-finding benchmark: five LLMs (GPT-4-Turbo, GPT-4, GPT-3.5-Turbo, Gemini Pro, PaLM 2 Unicorn) are evaluated with 3-shot prompting under three methods: direct trace-level prompting, direct step-level prompting, and CoT step-level prompting.
- Correction test: a backtracking method feeds oracle mistake locations, regenerates the mistaken step at temperature 1 up to 8 times, then regenerates remaining steps at temperature 0. A classifier experiment fine-tunes PaLM 2 Otter for 20k steps with batch size 32 and learning rate 1e-5, holding out one task at a time.
Limitations
- The paper states that its tasks are artificial and unrealistic for real-world applications, chosen to minimize ambiguity and subjectivity.
- The paper states that it does not experiment on the original full BIG-Bench datasets, only on a limited, skewed sample designed to maximize annotator value; the dataset contains 15% correct-answer and 85% incorrect-answer traces for four tasks.
- The paper states that the trained classifiers do not meet the threshold required for effective backtracking, and more data may be necessary.
- The text makes evident that correction experiments use PaLM 2 Unicorn to correct traces it originally generated, and the authors note that using PaLM 2 itself for mistake finding may produce biased results; further work is needed on cross-model versus self-evaluation.
- The text also makes evident that some model results are missing due to cost and usage limits, indicated by “-” in the tables.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
13 of 17 cited sources checked · 6 supported · 1 flagged · accuracy not yet measured
- Premisecitation
Huang et al. (2023) demonstrate that improvements from Reflexion and RCI are only from using oracle correctness ans information.
“also builds upon results from Huang et al. (2023), who demonstrate that improvements from Reflexion (Shinn et al., 2023) and RCI (Kim et al., 2023) are only from using oracle correctness ans information.”
Quote in the paperSubstantial claim3 of 3 sources checked- cites Huang et al., 2023 source
- cites Shinn et al., 2023 source
- cites Kim et al., 2023 source
The Introduction reports that RCI outperformed other approaches on computer tasks without a task-specific reward function, and B.3 attributes improved reasoning to self-critiquing with implicit feedback. C.2 does say the reasoning-task experiments used correct labels to decide when to stop the RCI loop, but it does not say that improvements from RCI and Reflexion came only from oracle correctness information. The source is Kim et al.’s RCI paper, not a demonstration by Huang et al. (LLM, conf=0.85)
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measured
- Findingcitation
BIG-Bench Mistake contains 2186 sets of CoT-style traces generated with PaLM 2 Unicorn and annotated with the location of the first logical error.
“BIG-Bench Mistake contains 2186 sets of CoTstyle traces.Each trace is generated with PaLM 2 Unicorn (Anil et al., 2023), and annotated with the location of the first logical error.”
Quote in the paperSubstantial claim1 of 1 sources checked- cites Anil et al., 2023 source
The Introduction identifies PaLM 2 as a model family, and the Model Card (Additional information; page unavailable) describes its small, medium, and large variants. Our copy does not identify a variant called “Unicorn,” so it supports the PaLM 2 identification but not the specific model name. The citation is attached to the model name, not to the citing paper’s dataset count or annotations. (LLM, conf=0.82)
Experimental — accuracy not yet measured
- Premisecitation
Prompting-only setups require external feedback for reasoning tasks.
“It has been demonstrated that prompting-only setups can work well for stylistic or qualitative improvements (e.g.Madaan et al., 2023;Chen et al., 2023b), but would require external feedback for reasoning tasks (Huang et al., 2023;Shinn et al., 2023;Kim et al., 2023;Madaan et al., 2023).”
Quote in the paperSubstantial claim3 of 3 sources checked- cites Huang et al., 2023 source
The Conclusion and Discussion (p. 8) says current LLMs struggle to self-correct reasoning without external feedback and can benefit from valid external feedback. This supports the point about prompting-only self-correction, but the claim is broader: the paper does not say that external feedback is required for reasoning tasks generally. (LLM, conf=0.84)
Experimental — accuracy not yet measured - cites Shinn et al., 2023 source
In §4.2, the paper uses an external binary success signal from the environment to improve performance on HotPotQA reasoning questions. Its analysis of Figure 4 reports that self-reflection improves on a chain-of-thought baseline. This supports the value of feedback in that setup, but not the broader claim that prompting-only setups require external feedback for reasoning tasks generally. (LLM, conf=0.85)
Experimental — accuracy not yet measured - cites Kim et al., 2023 source
Section 3.1 (page not provided) reports that RCI prompting without external feedback matched zero-shot performance on half the reasoning benchmarks but underperformed on the others. External feedback helped this particular method; the paper does not establish that prompting-only approaches generally require it for reasoning tasks. (LLM, conf=0.87)
Experimental — accuracy not yet measured
- Premisecitation
Prompting-only setups can work well for stylistic or qualitative improvements.
“It has been demonstrated that prompting-only setups can work well for stylistic or qualitative improvements (e.g.Madaan et al., 2023;Chen et al., 2023b), but would require external feedback for reasoning tasks (Huang et al., 2023;Shinn et al., 2023;Kim et al., 2023;Madaan et al., 2023).”
Quote in the paperNot a substantial claim1 of 2 sources checked- cites Madaan et al., 2023 source
- cites Chen et al., 2023b
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Premisecitation
PaLM 2 performs poorly on the selected tasks.
“These tasks are selected because 1)Anil et al. (2023) demonstrate that PaLM 2 performs poorly on these tasks, so it is likely to generate mistakes in CoT traces;”
Quote in the paperSubstantial claim1 of 1 sources checked- cites Anil et al., 2023 source
The citing sentence does not identify the selected tasks, so they cannot be matched to the report’s evaluations. The report’s §4.3 Reasoning and BIG-Bench Hard sections describe improvements over PaLM, but the passages found do not establish that PaLM 2 performs poorly on the citing paper’s selected tasks. I searched for poor performance and errors in reasoning and chain-of-thought tasks. (LLM, conf=0.72)
Experimental — accuracy not yet measured
- Rests on an assumption: Mistakes in the selected tasks are likely to be unambiguous, minimising subjectivity during annotation.
- Rests on an assumption: Identifying mistakes for these tasks does not require expertise knowledge.
- Findingown data
A small classifier trained with out-of-domain data exhibits stronger mistake-finding performance than prompting a large model.
“We train a small classifier with out-of-domain data, which exhibits stronger mistake-finding performance than prompting a large model.”
- Also stated in: § 1 Introduction · plain
“As a proof-of-concept, we train a small mistakefinding classifier using out-of-domain data, which performs better than prompting a large model.”
Quote in the paperSubstantial claim - Also stated in: § 1 Introduction · plain
- Findingown data
It is possible to obtain mistake location information without ground truth labels or in-domain training data.
“Finally, we show that it is possible to obtain mistake location information without ground truth labels or in-domain training data.”
- Also stated in: § 1 Introduction · boosted
“We demonstrate that LLMs' low accuracy at few-shot mistake-finding can be improved upon without using in-domain training data.”
Quote in the paperSubstantial claim - Also stated in: § 1 Introduction · boosted
- Findingown data
The naive baseline of predicting all traces as incorrect achieves a weighted F1 average of 78.
“Note that the naive baseline of predicting all traces as incorrect achieves a weighted F1 average of 78.”
Quote in the paperNot a substantial claim - Findingown data
Feeding oracle mistake location information to LLMs through a backtracking setup boosts downstream task performance across the paper's 5 reasoning tasks.
“Secondly, we test the correction abilities of LLMs -separately from mistake finding -using a backtracking setup that feeds ground truth mistake location information to the model.We show that this boosts downstream task performance across our 5 reasoning tasks, indicating that LLMs' correction abilities are robust.”
- Also stated in: § 4.2 Discussion · plain
“Our results show that, with mistake location information available, LLMs can correct their own outputs and improve overall downstream performance.”
Quote in the paperSubstantial claim - Also stated in: § 4.2 Discussion · plain
- Findingown data
State-of-the-art LLMs generally struggle with mistake-finding in CoT traces, even in highly objective, unambiguous cases.
“Firstly, we benchmark several state-of-the-art LLMs on their mistake-finding ability and demonstrate that they generally struggle with the task, even in highly objective, unambiguous cases.”
- Also stated in: § 3.1 Discussion · hedged
“All five models appear to struggle with our mistake finding dataset.”
- Also stated in: § 3.1 Discussion · boosted
“We show that state-of-the-art LLMs clearly struggle with mistake finding, even in the most simple and unambiguous cases.”
Quote in the paperSubstantial claim - Also stated in: § 3.1 Discussion · hedged
- Findingown data
The random baseline also obtained improvements, but they are considerably smaller than if the true mistake location was used.
“Additionally, while the random baseline also obtained improvements, they are considerably smaller than if the true mistake location was used.”
Quote in the paperSubstantial claim - Findingreasoning
The accuracy on traces with no mistakes decreases considerably from direct, trace-level prompting to CoT, step-level prompting.
“As we compare results across the three methods, we find that the accuracy on traces with no mistakes goes downfoot_6 considerably from direct, trace-level prompting to CoT, step-level prompting.”
Quote in the paperSubstantial claim - Findingown data
LLMs generally struggle to find mistakes.
“We find that LLMs generally struggle to find mistakes, but, when given mistake location information, are able to correct outputs to boost performance.”
Quote in the paperSubstantial claim - Findingnone given
BIG-Bench Mistake covers a wider range of tasks than PRM800K to explore the reasoning capabilities of LLMs more thoroughly.
“Our dataset BIG-Bench Mistake covers a wider range of tasks to explore the reasoning capabilities of LLMs more thoroughly.”
Quote in the paperNot a substantial claim - Findingown data
The trained classifier does not reach the threshold required for effective backtracking.
“Despite this, the performance of our classifiers do not meet the threshold required for effective backtracking, as demonstrated in subsection 5.1.”
- Also stated in: § 7 Conclusion · plain
“While the classifier does not reach the threshold required for effective backtracking, our results show that it is possible to improve on mistake-finding accuracy using standard machine learning techniques.”
Quote in the paperSubstantial claim - Also stated in: § 7 Conclusion · plain
- Findingown data
The traces in BIG-Bench Mistake are sampled to contain more incorrectans traces than correctans traces.
“Note that the traces in BIG-Bench Mistake are sampled to contain more incorrectans traces than correctans traces (and therefore more incorrectmis traces than correctmis traces), so the overall mistake location accuracy appears higher for per-step prompting in Table4, despite the poor accuracy for correctmis traces.”
Quote in the paperSubstantial claim - Findingown data
When given mistake location information, LLMs are able to correct outputs to boost performance.
“We find that LLMs generally struggle to find mistakes, but, when given mistake location information, are able to correct outputs to boost performance.”
Quote in the paperSubstantial claim - Interpretationreasoning
Using PaLM 2 itself to do mistake finding will produce different and likely biased results.
“Therefore, we expect that using PaLM 2 itself to do mistake finding will produce different and likely biased results.”
Quote in the paperSubstantial claim - Interpretationown data
Poor self-correction performance on reasoning tasks stems from LLMs' inability to find logical mistakes rather than their ability to correct a known mistake.
“In this paper, we show that poor self-correction performance stems from LLMs' inability to find logical mistakes, rather than their ability to correct a known mistake.”
- Also stated in: § 4.2 Discussion · hedged
“This suggests that the main bottleneck in self-correction methods is the identification of mistakes, rather than the correction process.”
Quote in the paperSubstantial claim - Also stated in: § 4.2 Discussion · hedged
- Premisenone given
With Chain-of-Thought prompting, any task can be turned into a mistake-finding task.
“With Chain-of-Thought prompting, any task can be turned into a mistake-finding task.”
Quote in the paperNot a substantial claim - Interpretationown data
Changes in overall accuracy from backtracking depend on the original accuracy achieved on the task.
“While our numbers do show that our gains are higher than our losses, it should be noted that changes in the overall accuracy depends on the original accuracy achieved on the task.”
Quote in the paperNot a substantial claim - Interpretationreasoning
Tasks involving fewer steps are more likely to improve performance in the random baseline, as the true mistake location is more likely to be identified.
“Note that tasks involving fewer steps are more likely to improve performance in the random baseline, as the true mistake location is more likely to be identified.”
Quote in the paperNot a substantial claim - Interpretationown data
Prompting for mistakes is likely a poor strategy for determining the correctness of the final answer.
“The weighted F1 scores show that prompting for mistakes is likely a poor strategy for determining the correctness of the final answer.”
Quote in the paperSubstantial claim - Interpretationown data
It may be possible to train classifiers to assist in backtracking.
“This suggests that it may be possible to train classifiers to assist in backtracking, and that these classifiers do not have to be large.”
Quote in the paperSubstantial claim - Interpretationown data
It is possible to improve on mistake-finding accuracy using standard machine learning techniques.
“While the classifier does not reach the threshold required for effective backtracking, our results show that it is possible to improve on mistake-finding accuracy using standard machine learning techniques.”
Quote in the paperSubstantial claim - Interpretationown data
Such a classifier can work on out-of-distribution mistakes.
“Further, such a classifier can work on out-of-distribution mistakes.”
Quote in the paperSubstantial claim - Interpretationcitation
PaLM 2 is likely to generate mistakes in CoT traces on these tasks.
“These tasks are selected because 1)Anil et al. (2023) demonstrate that PaLM 2 performs poorly on these tasks, so it is likely to generate mistakes in CoT traces;”
Quote in the paperSubstantial claim- Rests on an assumption: Mistakes in the selected tasks are likely to be unambiguous, minimising subjectivity during annotation.
- Rests on an assumption: Identifying mistakes for these tasks does not require expertise knowledge.
- Interpretationown data
These classifiers do not have to be large.
“This suggests that it may be possible to train classifiers to assist in backtracking, and that these classifiers do not have to be large.”
Quote in the paperSubstantial claim
- May combine two claims. 10
- Classified as probably not a substantial claim. 19
- The quote only partly states this claim. 3
May combine two claims.
InterpretationreasoningThe main bottleneck in self-correction methods can be overcome by using ground truth feedback or by training a classifier.
“This bottleneck can be overcome by using ground truth feedback (as in Reflexion (Shinn et al., 2023) or RCI (Kim et al., 2023)), or by training a classifier (see section 5).”
Quote in the paperSubstantial claim2 of 2 sources checked- Rests on an assumption: Oracle labels are typically not available in downstream tasks.
Classified as probably not a substantial claim.
PremisecitationHuang et al. (2023) show that existing self-correction strategies are ineffective on reasoning errors.
“Our findings are in line with and builds upon results from Huang et al. (2023), who show that existing self-correction strategies are ineffective on reasoning errors.”
Quote in the paperSubstantial claim1 of 1 sources checked- cites Huang et al., 2023 source
The Introduction (pp. 1–2) and Background (p. 2) report that the evaluated self-correction strategies generally fail to improve LLM reasoning without external feedback, and can reduce performance. The claim omits that condition: the Introduction (p. 1) says improvements occur when oracle labels guide correction, so the paper does not establish that existing strategies are ineffective in all settings. (LLM, conf=0.87)
Experimental — accuracy not yet measured
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationPRM800K uses a generator LLM that was heavily fine-tuned for math-specific problems.
“Additionally, our dataset explores the more general case of prompting API-based LLMs, whereas PRM800K uses a generator LLM that was heavily fine-tuned for math-specific problems.”
Quote in the paperNot a substantial claim1 of 1 sources checked- cites Lightman et al., 2023 source
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingown dataHumans can identify mistakes without specific expertise and have a high degree of agreement.
“(For comparison, humans can identify mistakes without specific expertise, and have a high degree of agreement, as shown in Table 3.)”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
FindingcitationThe traces in BIG-Bench Mistake span five tasks: word sorting, tracking shuffled objects, logical deduction, multi-step arithmetic, and Dyck languages.
“Our traces span across a set of 5 tasks from the BIG-bench dataset (Srivastava et al., 2023): word sorting, tracking shuffled objects, logical deduction, multi-step arithmetic, and Dyck languagesfoot_3 .”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Srivastava et al., 2023
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Classified as probably not a substantial claim. May combine two claims.
Findingnone givenThe traces in the dataset are generated using PaLM 2 Unicorn and are sampled according to whether the final answer was correct or not.
“Note that the traces in our dataset are generated using PaLM 2 Unicorn and are sampled according to whether the final answer was correct or not.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Findingnone givenBIG-Bench Mistake is the first dataset of its kind that goes beyond problems in mathematics.
“To our knowledge, BIG-Bench Mistake is the first dataset of its kind that goes beyond problems in mathematics.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingnone givenThe dataset is highly skewed and only contains 45 correct ans traces per task.
“As our dataset is highly skewed and only contains 45 correct ans traces per task, we leave to future work a more comprehensive assessment of backtracking, as well as the development of more sophisticated ways to incorporate mistake location information into the self-correction loop.”
Quote in the paperNot a substantial claimThe quote only partly states this claim.
Findingown dataBacktracking is still effective even without gold standard mistake location labels, at around 60-70% classifier mistake-finding accuracy.
“This demonstrates that while higher accuracies produce better results, backtracking is still effective even without gold standard mistake location labels.”
Quote in the paperSubstantial claim- Rests on an assumption: A trained classifier is unlikely to reach 100% mistake-finding accuracy.
May combine two claims.
Findingown dataGPT-4 attains the best mistake-finding accuracy among the five evaluated models but only reaches an overall accuracy of 52.87 with direct step-level prompting.
“GPT-4 attains the best results but only reaches an overall accuracy of 52.87 with direct step-level prompting.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataDuring annotation of the multistep arithmetic task, the first CoT step given in the original BIG-Bench Hard prompt examples was incorrect.
“During annotation of the multistep arithmetic task, we found that the first CoT step given in the original BIG-Bench Hard prompt examples (Suzgun et al., 2022) was incorrect.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Suzgun et al., 2022
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
May combine two claims.
Findingown dataThe classifiers trained are significantly smaller than the inference model and are trained on out-of-domain data.
“Note the classifiers we train are significantly smaller than our inference model, and is trained on out-of-domain data.”
- Also stated in: § C Training mistake-finding classifiers · plain
“Note that PaLM 2 Otter is significantly smaller than PaLM 2 Unicorn, and is trained on out-of-domain data.”
Quote in the paperSubstantial claim- Also stated in: § C Training mistake-finding classifiers · plain
Probably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataFor the logical deduction task, the notation used in the original prompt with question marks is often inconsistent.
“For the logical deduction task, we find that the notation used in the original prompt with question marks is often inconsistent.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataBIG-Bench Mistake explores the more general case of prompting API-based LLMs.
“Additionally, our dataset explores the more general case of prompting API-based LLMs, whereas PRM800K uses a generator LLM that was heavily fine-tuned for math-specific problems.”
Quote in the paperNot a substantial claimThe quote only partly states this claim.
Findingown dataA small classifier trained on out-of-domain data improves mistake-finding accuracy over few-shot prompting on 4 of 5 tasks.
“We see gains for 4 out of 5 of the tasks.”
- Also stated in: § 7 Conclusion · boosted
“We train a small, baseline classifier on outof-domain data and demonstrate improvement over few-shot prompting results.”
Quote in the paperSubstantial claim- Also stated in: § 7 Conclusion · boosted
May combine two claims.
Interpretationown dataLLMs' correction abilities are robust, effectively correcting outputs that are originally incorrect with minimal effect on outputs that are originally correct.
“We demonstrate that LLMs' correction abilities are robust, effectively correcting outputs that are originally incorrect, with minimal effect on outputs that are originally correct.”
- Also stated in: § 4.2 Discussion · plain
“The scores show that the gains from correcting incorrect ans traces are larger than losses from changing originally correct answers.”
Quote in the paperSubstantial claim- Also stated in: § 4.2 Discussion · plain
Probably not a substantial claim: may not pass S4 (based).
Interpretationnone givenTraining a small classifier is far more efficient in terms of computing resources and available data than fine-tuning the larger generator model.
“Training a small classifier is far more efficient in terms of computing resources and available data.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim. May combine two claims.
InterpretationreasoningOnce the classifier is trained, it can be used with any LLM as the generator and be updated independently.
“Once the classifier is trained, it can be used with any LLM as the generator and be updated independently.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S1 (asserted).
InterpretationreasoningMistake finding is an important bottleneck preventing self-correction strategies from performing well on reasoning tasks.
“We therefore hypothesise that mistake finding is an important bottleneck preventing self-corrections strategies from performing well on reasoning tasks.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductcitationKrippendorff's alpha is calculated to measure inter-rater reliability.
“We calculate Krippendorff's alpha (Hayes and Krippendorff, 2007) to measure inter-rater reliability (see Table 3).”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Hayes and Krippendorff, 2007 source
Classified as probably not a substantial claim. May combine two claims.
Study design and conductnone givenEach trace is annotated by at least 3 annotators, and disagreements are resolved by majority label.
“Each trace is annotated by at least 3 annotators.If there are any disagreements, we take the majority label.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductown dataDue to limited data, the training included CoT steps after the first mistake step, considered incorrect for training despite not being human-annotated as such.
“Due to the limited data, we include in training the CoT steps that occur after the first mistake step.These steps are considered incorrect for the purposes of training (despite not being human-annotated as such).”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductown dataThe paper does not experiment with backtracking on the original datasets on BIG-Bench, only showing results on the limited set sampled in a skewed manner.
“Another limitation is that our paper does not experiment with backtracking on the original datasets on BIG-Bench, only showing results on the limited set that we sampled in a skewed manner, in order to maximise the value of the human annotators' time.”
Quote in the paperNot a substantial claimThe quote only partly states this claim.
Study design and conductown dataHuman annotations for the five tasks had high inter-rater reliability (Krippendorff's alpha 0.979 to 0.998).
“Inter-rater reliability for the human-annotated tasks, measured by Krippendorff's alpha.”
- Also stated in: § C Training mistake-finding classifiers · plain
“| Task Krippendorff's α Word sorting 0.979 Tracking shuffled objects 0.998 Logical deduction 0.996 Multistep arithmetic 0.984 |”
Quote in the paperNot a substantial claim- Also stated in: § C Training mistake-finding classifiers · plain
Probably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningOne main limitation of the dataset is that it features tasks that are artificial and unrealistic for real-world applications.
“One main limitation of our dataset is that it features tasks that are artificial and unrealistic for real-world applications.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Study design and conductnone givenAll models are given the same 3-shot prompts.
“All models are given the same 3-shot prompts 5 .”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Study design and conductown dataThe backtracking results are compared to a random baseline where a mistake location is randomly selected for each trace.
“To show that performance increases are not due to randomly resampling outputs, we compare our results to a random baseline, where a mistake locationfoot_7 is randomly selected for each trace and we perform backtracking based on the random location.”
Quote in the paperSubstantial claim
The paper relies on this without support.
Oracle labels are typically not available in downstream tasks.
“However, these experimental results are based on oracle labels, which are typically not available in downstream tasks.”
The paper relies on this without support.
A trained classifier is unlikely to reach 100% mistake-finding accuracy.
“A trained classifier is unlikely to reach 100% mistake-finding accuracy.”
The paper relies on this without support.
Sufficient in-domain training data typically guarantees a performance boost, but can be hard to obtain.
“Sufficient in-domain training data typically guarantees a performance boost, but can be hard to obtain.”
The authors state this as an assumption.
For Dyck languages, if a model-generated step conforms to the format and the symbols do not match, the trace is incorrect.
“If so, we compare the two and assume that the trace is incorrect if the symbols do not match.”
The paper relies on this without support.
Mistakes in the selected tasks are likely to be unambiguous, minimising subjectivity during annotation.
“mistakes in these tasks are likely to be unambiguous, therefore minimising subjectivity during annotation”
The paper relies on this without support.
Identifying mistakes for these tasks does not require expertise knowledge.
“identifying mistakes for these tasks does not require expertise knowledge.”
The paper relies on this without support.
The only publicly available dataset containing mistake annotations in LLM outputs is PRM800K.
“To our knowledge, the only publicly available dataset containing mistake annotations in LLM outputs is PRM800K (Lightman et al., 2023), which is a dataset of solutions to Olympiad-level math questions.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The average blind spot in non-mathematical domains including logical deduction and object tracking from BIG-Bench Mistake is 62.8%.
“We also demonstrate the 62.8% average blind spot in non-mathematical domains including logical deduction and object tracking from BIG-Bench Mistake (Tyen et al., 2024) (See Table 8).”
From Self-Correction Bench: Uncovering and Addressing the Self-Correction Blind Spot in Large Language Models (2025) · cites this paper as Tyen et al., 2024
The Introduction identifies BIG-Bench Mistake as this paper’s dataset, and Table 4 in Section 3.1 includes logical deduction and tracking shuffled objects among its tasks. The paper reports mistake-finding results, but the searched passages do not report a 62.8% average “blind spot” for non-mathematical domains. That figure appears to be the citing authors’ own calculation rather than a result established by this source. (LLM, conf=0.85)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Word-sorting classifier improvement is miscalculated
MinorThe difference between the reported classifier accuracy of 22.33 and prompting accuracy of 11.67 is 10.66, not 11.66 percentage points.
Reported 11.66 · recomputed 10.66
“| Held-out task Word sorting Tracking shuffled objects Logical deduction Multi-step arithmetic Dyck languages | Trained classifier accuracymis (Otter) 22.33 37.67 6.00 26.00 33.57 | 3-shot prompting accuracymis (Unicorn) 11.67 18.00 6.67 22.00 10.98 | Difference +11.66 +19.67 -0.67 +4.00 +22.59 |”
Cites
The publisher hasn’t deposited this paper’s reference list.
Research works printed but not linked: 3
- Aarohi Srivastava, Abhinav Rastogi, Abhishek Rao, Abu Awal Md Shoeb, Abubakar Abid, Adam Fisch, Adam R Brown, Adam Santoro, Aditya Gupta, Adrià Garriga-Alonso, et al. 2023. Beyond the im- itation game: Quantifying and extrapolating the ca- pabilities of language models. Transactions on Ma- chine Learning Research.
- Michihiro Yasunaga and Percy Liang. 2020. Graph- based, self-supervised program repair from diagnos- tic feedback. In International Conference on Ma- chine Learning, pages 10799-10808.
- PMLR.
Cited by
Sorted by citations
Kamoi, R., Zhang, Y., Zhang, N., Han, J., & Zhang, R. (2024) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00713 · Cited by 82 · see citing works
Lee, S., Sim, W., Shin, D., Seo, W., Park, J., Lee, S. C., Hwang, S., Kim, S., & Kim, S. (2025) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3712701 · Cited by 33 · see citing works
CXXCrafter: An LLM-Based Agent for Automated C/C++ Open Source Software Building
Yu, Z., Zhang, Y., Wen, M., Nie, Y., Zhang, W., & Yang, M. (2025) · Proceedings of the ACM on software engineering. · doi:10.1145/3729386 · Cited by 13 · see citing works
Critic-V: VLM Critics Help Catch VLM Errors in Multimodal Reasoning
Zhang, D., Lei, J., Li, J., Wang, X., Liu, Y., Yang, Z., Li, J., Wang, W., Yang, S., Wu, J., et al. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.00846 · Cited by 16 · see citing works
Confidence v.s. Critique: A Decomposition of Self-Correction Capability for LLMs
Yang, Z., Zhang, Y., Wang, Y., Xu, Z., Lin, J., & Sui, Z. (2025) · Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2025.acl-long.203 · Cited by 5 · see citing works
Collaborative intelligence in AI: Evaluating the performance of a council of AIs on the USMLE
Shaikh, Y., Jeelani-Shaikh, Z. A., Jeelani, M., Javaid, A., Mahmud, T., Gaglani, S. M., Gibbons, M., Cheema, M., Cross, A., Livingston, D., et al. (2025) · PLOS Digital Health · doi:10.1371/journal.pdig.0000787 · Cited by 4 · see citing works
Li, K., Qian, C., & Yang, X. (2024) · Education and Information Technologies · doi:10.1007/s10639-024-12851-4 · Cited by 4 · see citing works
Step-by-Step Correction of LLM-based Math Word Problems Solutions
Li, Y., Ubaidali, D. M., Wang, L., & Zhang, W. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10889273 · Cited by 2 · see citing works
Infusing Human Feedback into Intermediate Prompting Steps of Large Language Models
Li, W., Gendron, C., & Toxtli, C. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-85628-0_4 · Cited by 1 · see citing works
Using large language models to address the bottleneck of georeferencing natural history collections
Xie, Y., Park, D., Sinnott‐Armstrong, M. A., Ho, J., Chen, T., Weakley, A. S., Aguirre‐López, L. J., Choi, J., Laitinen, M. M., Steeves, N. A., et al. (2025) · Nature Plants · doi:10.1038/s41477-025-02162-y · Cited by 2 · see citing works
Uncertainty-Aware Semantic Decoding for LLM-Based Sequential Recommendation
Yin, C., Li, F., Wang, J., Hu, D., Zhang, H., Zhang, C., & Xiang, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-5719-6_25 · Cited by 2 · see citing works
Collaborative intelligence in AI: Evaluating the performance of a council of AIs on the USMLEPreprint
Shaikh, Y., Asiya, Z., Jeelani, M. M., et al. (2025) · medRxiv · doi:10.1101/2025.02.17.25322388
Agentic Correlates of Consciousness and the Pursuit of Artificial General Intelligence
Gray, S., Tambouratzis, G., Venugopal, S., Raghavan, S., Tong, R. J., & Han, Z. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-00686-8_21
Selitskiy, S., & Inoue, C. (2025) · International Conference on Foundation and Large Language Models (FLLM) · doi:10.1109/fllm67465.2025.11391110
Contributions to evaluating and improving the faithfulness for text generation
Zhang, K. (2025) · theses.fr (ABES) · doi:10.70675/28453a20z78f2z4fa2za6edz700065e69e97
A System-Level Taxonomy of Failure Modes in Large Language Model Applications
Vinay, V. (2026) · IEEE Conference on Artificial Intelligence (CAI) · doi:10.1109/cai68641.2026.11536235
Anomalies in AI Outputs Beyond Input Data Quality: The Significance of Reasoning
Royo, J. [. ]. A., Martín, Ó., Martínez, E., Montalvo, F. J. F., & Blanco‐Fernández, J. (2026) · Applied Sciences · doi:10.3390/app16115491
When the Chain Breaks: Interactive Diagnosis of LLM Chain‐of‐Thought Reasoning Errors
Chen, S., Sritharan, N., Wen, X., Zhang, C., Wang, X., & Wang, Y. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70439
Sirgebayeva, A., Yergazy, Y., Jaxylykova, A., & Pak, A. A. (2026) · PeerJ Computer Science · doi:10.7717/peerj-cs.3862
Progressively Mitigating API Hallucination in LLM-Generated Code via Knowledge Graph Reasoning
Li, Y., Ma, Z., Zou, Y., Wang, Y., Yang, L., & Xie, B. (2026) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner67736.2026.00086
Dutta, A., Ramamoorthy, A., Lakshmi, M. G., & Kumar, P. K. (2026) · Iran Journal of Computer Science · doi:10.1007/s42044-026-00404-6
Zhu, D., Shen, P., & Shen, S. (2026) · Memetic Computing · doi:10.21203/rs.3.rs-10492304/v1
Mask-Proof: An LLM-based Automated Data Curation Pipeline on Mathematical Proofs
Zhang, J., Tan, S., Li, X., Lin, L., Li, D., Gu, C., Li, X., Hao, Y., Liang, S., Ren, Y., et al. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3818886
Divanis, K., Foscolou, A., Prosalentis, G., Mylonas, C., Antoniou, M. I., Krokou, A., Filias, A.-N., Papagiannopoulou, E., Dousis, P. D., Polychronidou, A. D., et al. (2026) · Nutrients · doi:10.3390/nu18162661
Liu, J., Wang, C., & Li, H. (2026) · Symmetry · doi:10.3390/sym18091437
- Authors
- Tyen, G., Mansoor, H., Carbune, V., Chen, P., & Mak, T.
- Affiliations
- University of Cambridge (GB)
- Google (United States) (US)
- ORCID
- Tyen, Gladys
- Venue
- Findings of the Association for Computational Linguistics ACL 2024
- Published
- 2024
- Pages
- 13894-13908
- OpenAlex
- W4402670356
- Cited by
- 24
- References
- 0
- Citations by year
- 2026: 11 · 2025: 11 · 2024: 2
- FWCI
- 7.76
- Type
- conference paper
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Keywords
- error location, backtracking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-07.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-07.
Cited sources are checked by gpt-6-sol.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review