Detecting errors at the sub-claim level in LLM reasoning chains
Develop a method to identify and certify errors within sub-claim components of large language model–generated reasoning chains, eliminating the assumption that claims are pre-decomposed into atomic units and enabling fine-grained soundness assessment while addressing the associated computational costs.
References
Additionally, our approach assumes that the claims are already decomposed and, therefore, cannot detect errors at the sub-claim level. We leave this for future work, noting it would increase computational costs.
Finally, to compute reasoning calibration and the frequency of shallow reasoning, we utilize LLM-as-a-judge. However, we observe that using LLM-as-a-judge to assess the correctness of the reasoning process can introduce errors. We leave the development of more accurate LLM-based evaluation methods for reasoning correctness to future work.
Several directions remain open. Most false alarms on the NLP reviews arise in decomposition, so a decomposer that stays closer to what the reviewer said is a natural next step.