🤖 AI Summary
This work addresses key limitations of existing long chain-of-thought (Long CoT) methods in mathematical reasoning—namely, excessively lengthy inference sequences, high computational overhead, and context loss due to unidirectional reasoning. To overcome these challenges, the authors propose the Cognitive Loop of Thought (CLoT) framework, which introduces a reversible hierarchical Markov chain to decompose problems into structured subproblems and incorporates a human cognition-inspired, layer-wise backward verification mechanism. Coupled with a dynamic KV cache pruning strategy that eliminates redundant low-level reasoning paths after high-level validation, CLoT effectively transcends the memory and unidirectional constraints of conventional CoT approaches. The method achieves state-of-the-art performance across four mathematical reasoning benchmarks, attaining 99.0% accuracy on the AddSub dataset with GPT-4o-mini—outperforming standard CoT and CoT-SC by 4.1% and 2.9%, respectively.
📝 Abstract
Multi-step Chain-of-Thought (CoT) has significantly advanced the mathematical reasoning capabilities of LLMs by leveraging explicit reasoning steps. However, the widespread adoption of Long CoT often results in sequence lengths that exceed manageable computational limits. While existing approaches attempt to alleviate this by reducing KV Cache redundancy via Markov chain-like structures, they introduce two critical limitations: inherent memorylessness (loss of context) and limited backward reasoning capability. To address these limitations, we propose a novel Chain-of-Thought framework based on Reversible Hierarchical Markov Chain, termed Cognitive Loop of Thought (CLoT), and a backward reasoning dataset CLoT-Instruct. In CLoT, problems are decomposed into sub-problems with hierarchical dependencies. Inspired by human cognitive processes, we introduce a backward verification mechanism at each hierarchical layer. Furthermore, we implement a pruning strategy: once higher-level sub-problems are verified, redundant lower-level sub-problems are pruned to maximize efficiency. This approach effectively mitigates error propagation and enhances reasoning robustness. Experiments on four mathematical benchmarks demonstrate the effectiveness of our method. Notably, on the AddSub dataset using GPT-4o-mini, CLoT achieves 99.0% accuracy, outperforming traditional CoT and CoT-SC by 4.1% and 2.9%, respectively.