Dynamic Early Exit in Reasoning Models
원문 초록
Recent advances in large reasoning language models (LRLMs) rely on test-time scaling, which extends long chain-of-thought (CoT) generation to solve complex tasks. However, overthinking in long CoT not only slows down the efficiency of problem solving, but also risks accuracy loss due to the extremely detailed or redundant reasoning steps. We propose a simple yet effective method that allows LLMs to self-truncate CoT sequences by early exit during generation. Instead of relying on fixed heuristics, the proposed method monitors model behavior at potential reasoning transition points (e.g.,"Wait" tokens) and dynamically terminates the next reasoning chain's generation when the model exhibits high confidence in a trial answer. Our method requires no additional training and can be seamlessly integrated into existing o1-like reasoning LLMs. Experiments on 10 reasoning benchmarks (e.g., GSM8K, MATH-500, AMC, GPQA, AIME and LiveCodeBench) show that the proposed method is consistently effective on 11 cutting-edge reasoning LLMs of varying series and sizes, reducing the length of CoT sequences by an average of 19.1% to 80.1% while improving accuracy by 0.3% to 5.0%.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AgentGroupChat-V2: Divide-and-Conquer Is What LLM-Based Multi-Agent System Need
Learning a Continue-Thinking Token for Enhanced Test-Time Scaling
Discriminative Policy Optimization for Token-Level Reward Models
EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning
Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space
Thinkless: LLM Learns When to Think
토론
이 논문과 연결된 포럼 글이 아직 없습니다.