Circular Reasoning: Understanding Self-Reinforcing Loops in Large Reasoning Models
Zenghao Duan, Liang Pang, Zihao Wei, Wenbin Duan, Yuxin Tian, Shicheng Xu, Jingcheng Deng, Zhiyi Yin, Xueqi Cheng
TL;DR
The paper identifies Circular Reasoning as a self-reinforcing loop in Large Reasoning Models, observable as token-level and sentence-level repetitions that emerge at a phase-transition in internal dynamics. It introduces LoopBench, a two-pronged benchmark with 700 samples across high-precision arithmetic and complex recursive tasks, to systematically study loop triggers, persistence, and model robustness. A mechanistic analysis reveals a deterministic state collapse and a characteristic V-shaped attention pattern, with semantic circularity preceding explicit repetition. To counteract this pathology, the authors propose a Predict–Intervene framework using real-time CUSUM-based detection on hidden states and soft prompt interventions, achieving early warning and substantial reductions in loop incidence across diverse models. The work advances understanding of reasoning stability in LRMs and offers a practical approach to mitigating computational waste in long-horizon reasoning tasks.
Abstract
Despite the success of test-time scaling, Large Reasoning Models (LRMs) frequently encounter repetitive loops that lead to computational waste and inference failure. In this paper, we identify a distinct failure mode termed Circular Reasoning. Unlike traditional model degeneration, this phenomenon manifests as a self-reinforcing trap where generated content acts as a logical premise for its own recurrence, compelling the reiteration of preceding text. To systematically analyze this phenomenon, we introduce LoopBench, a dataset designed to capture two distinct loop typologies: numerical loops and statement loops. Mechanistically, we characterize circular reasoning as a state collapse exhibiting distinct boundaries, where semantic repetition precedes textual repetition. We reveal that reasoning impasses trigger the loop onset, which subsequently persists as an inescapable cycle driven by a self-reinforcing V-shaped attention mechanism. Guided by these findings, we employ the Cumulative Sum (CUSUM) algorithm to capture these precursors for early loop prediction. Experiments across diverse LRMs validate its accuracy and elucidate the stability of long-chain reasoning.
