Submitted:
07 October 2025
Posted:
08 October 2025
You are already at the latest version
Abstract
Large Language Models (LLMs) have shown im- pressive reasoning abilities with the use of chain-of-thought (CoT) prompting. However, reasoning is still brittle: small errors early on propagate forward to lead to confidently asserted but erroneous conclusions. This paper presents AutoCrit, a meta- reasoning system that incorporates structured self-criticism and iterative error-fixing directly into the CoT procedure. AutoCrit integrates a reasoning agent, a critique agent, and an execution monitor in an active feedback loop to detect and correct in- consistency proactively step by step. On mathematical reasoning benchmarks (GSM8K), commonsense inference (CSQA2), and interactive planning (ALFWorld) benchmarks, AutoCrit achieves accuracy improvements of 12–18% over baseline CoT and reduces error propagation rates by half. Theoretical analysis of AutoCrit as an iterative fixed-point system formally establishes it rigorously and provides error-propagation limits that demon- strate its scalability. This work advances LLM reliability by showing that incorporating critique into reasoning outperforms post-hoc validation, the foundation for future reasoning-intensive applications in AI-assisted decision-making.
Keywords:
I. Introduction
II. Related Work
A. Chain-of-Thought Reasoning
B. Self-Consistency and Majority Voting
C. Critique and Reflection in LLMs
III. The Autocrit Framework

IV. Experimental Setup
V. Results and Analysis
A. Error Correction Dynamics
| Error Type | Detection Rate (%) | Correction Success (%) | Residual Error (%) |
| Arithmetic mistake | 82.4 | 46.1 | 9.5 |
| Logical contradiction | 71.8 | 38.2 | 13.4 |
| Factual inconsistency | 65.7 | 29.6 | 18.1 |
| Instruction violation | 59.3 | 26.8 | 21.4 |
B. Ablation Study
VI. Theoretical Foundations
A. Meta-Reasoning as Fixed-Point Iteration
B. Error Correction Dynamics
- Proposition 1 (AutoCrit reduces linear error growth). As- sume a horizon of n reasoning steps. Suppose AutoCrit runs critique–repair cycles at exponentially spaced checkpoints
- 1, 2, 4, 8, . . . , 2⌊log2 n⌋, and at each checkpoint an existing error is detected and repaired with probability p ∈ (0, 1], independently of past attempts. Then the expected number
- of surviving erroneous segments after processing n steps is O log n , and thus long-horizon fragility is alleviated com- pared to vanilla CoT’s O(n).
| Error Type | Detection Rate (%) | Correction Success (%) | Residual Error (%) |
| Arithmetic mistake | 82.4 | 46.1 | 9.5 |
| Logical contradiction | 71.8 | 38.2 | 13.4 |
| Factual inconsistency | 65.7 | 29.6 | 18.1 |
| Instruction violation | 59.3 | 26.8 | 21.4 |
C. Interpretability and Transparency
VII. Discussion
A. Meta-Reasoning and Cognitive Analogy
B. Limitations and Open Questions
C. Extending the Framework
D. Societal and Ethical Implications
VIII. Conclusion
References
- C. Wang and H. T. Quach, “Exploring the effect of sequence smoothness on machine learning accuracy,” in International Conference On Inno- vative Computing And Communication, pp. 475–494, Springer Nature Singapore Singapore, 2024. [CrossRef]
- C. Li, H. Zheng, Y. Sun, C. Wang, L. Yu, C. Chang, X. Tian, and B. Liu, “Enhancing multi-hop knowledge graph reasoning through reward shaping techniques,” in 2024 4th International Conference on Machine Learning and Intelligent Systems Engineering (MLISE), pp. 1– 5, IEEE, 2024. [CrossRef]
- M. Liu, M. Sui, Y. Nian, C. Wang, and Z. Zhou, “Ca-bert: Leveraging context awareness for enhanced multi-turn chat interaction,” in 2024 5th International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE), pp. 388–392, IEEE, 2024. [CrossRef]
- C. Wang, M. Sui, D. Sun, Z. Zhang, and Y. Zhou, “Theoretical analysis of meta reinforcement learning: Generalization bounds and convergence guarantees,” in Proceedings of the International Conference on Model- ing, Natural Language Processing and Machine Learning, pp. 153–159, 2024. [CrossRef]
- Z. Gao, “Modeling reasoning as markov decision processes: A theoret- ical investigation into nlp transformer models,” 2025.
- C. Wang, Y. Yang, R. Li, D. Sun, R. Cai, Y. Zhang, and C. Fu, “Adapting llms for efficient context processing through soft prompt compression,” in Proceedings of the International Conference on Modeling, Natural Language Processing and Machine Learning, pp. 91–97, 2024. [CrossRef]
- Z. Zhang, “Unified operator fusion for heterogeneous hardware in ml inference frameworks,” 2025.
- Z. Gao, “Feedback-to-text alignment: Llm learning consistent natural language generation from user ratings and loyalty data,” 2025. [CrossRef]
- Z. Gao, “Theoretical limits of feedback alignment in preference-based fine-tuning of ai models,” 2025. [CrossRef]
- S. Lin, “Hybrid fuzzing with llm-guided input mutation and semantic feedback,” 2025.
- S. Lin, “Abductive inference in retrieval-augmented language models: Generating and validating missing premises,” 2025.
- T. Wu, Y. Wang, and N. Quach, “Advancements in natural language processing: Exploring transformer-based architectures for text under- standing,” in 2025 5th International Conference on Artificial Intelligence and Industrial Technology Applications (AIITA), pp. 1384–1388, IEEE, 2025.
- N. Quach, Q. Wang, Z. Gao, Q. Sun, B. Guan, and L. Floyd, “Rein- forcement learning approach for integrating compressed contexts into knowledge graphs,” in 2024 5th International Conference on Computer Vision, Image and Deep Learning (CVIDL), pp. 862–866, 2024. [CrossRef]
- Y. Sang, “Robustness of fine-tuned llms under noisy retrieval inputs,” 2025.
- Y. Sang, “Towards explainable rag: Interpreting the influence of retrieved passages on generation,” 2025.
- S. Lin, “Llm-driven adaptive source–sink identification and false positive mitigation for static analysis,” 2025. [CrossRef]
- X. Wang, J. Wei, D. Schuurmans, Q. Le, E. Chi, S. Narang, A. Chowdh- ery, and D. Zhou, “Self-consistency improves chain of thought reasoning in language models,” 2023.
| Configuration | GSM8K | CSQA2 | ALFWorld |
| Full AutoCrit | 75.1 | 73.6 | 54.8 |
| w/o Critique Agent (CA) | 66.9 | 64.7 | 48.5 |
| w/o Execution Monitor (EM) | 68.2 | 66.3 | 47.9 |
| w/o CA + EM | 57.6 | 61.9 | 45.1 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).