paper-with-me

Papers

Dynamic Rollout Editing for Reducing Overthinking in RL-Trained Reasoning Models

2026-06-16 · Zihao Wei, Wenjie Shi, Liang Pang, Jingcheng Deng, Shicheng Xu, Shasha Guo, Zenghao Duan, Jiahao Liu, Jingang Wang, Huawei Shen, Xueqi Cheng arxiv

Long-form chain-of-thought reasoning can improve LLM performance on complex tasks, but models often continue generating unnecessary reasoning after a correct answer has emerged. We refer to this behavior as overthinking. We study this phenomenon from the perspective of GRPO-style reinforcement learning (RL) post-training, framing it as a training-time credit-assignment problem rather than merely a decoding-time stopping problem. In rollouts sampled at the onset of GRPO training, we observe that successful trajectories can exhibit a slightly higher degree of overthinking than unsuccessful trajectories for the same prompts. This early imbalance provides a starting point for an undesirable feedback loop: because GRPO assigns sequence-level credit, it cannot distinguish the solution-reaching prefix from the unnecessary continuation that lengthens a successful trajectory. Both receive positive update signal, allowing the initial imbalance to grow into more severe overthinking during training. To address this issue, we introduce Dynamic Rollout Editing (DRE), a training-time intervention for successful trajectories that continue thinking after answer emergence. DRE preserves the accepted verified prefix, edits the remaining thinking, and prefers the edited trajectory within the same RL group, weakening the preference signal for unnecessary thinking without penalizing the reasoning needed to reach the answer. Experiments across diverse tasks show the effectiveness of DRE.

📄 PDF Abstract BibTeX arXiv:2606.17890

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

REChart: Reasoning-Efficient Chart Editing with Large Reasoning Models

2026-08-18 · Yuanbang Liu, Chenxi Ruan, Yihan Hou, Qiong Luo 외 arxiv

Chart editing requires inferring and modifying visualization code from a reference chart image based on an editing instruction, challenging fine-grained visual reasoning, instruction following, and executable code synthe…

Reinforcement LearningInstruction FollowingVisual Reasoning

NEAT: Neuron-Based Early Exit for Large Reasoning Models

2026-02-02 · Kang Liu, Yongkang Liu, Xiaocui Yang, Peidong Wang 외 arxiv

Large Reasoning Models (LRMs) often suffer from \emph{overthinking}, a phenomenon in which redundant reasoning steps are generated after a correct solution has already been reached. Existing early reasoning exit methods …

Implicit Compression Regularization: Concise Reasoning via Internal Shorter Distributions in RL Post-Training

2026-05-08 · Chen Wang, Hexuan Deng, Yining Zhang, Yuchen Zhang 외 arxiv

Reinforcement learning with verifiable rewards improves LLM reasoning but often induces overthinking, where models generate unnecessarily long reasoning traces. Existing methods mainly rely on length penalties or early-e…

Reinforcement Learning

Adaptive Dual Reasoner: Large Reasoning Models Can Think Efficiently by Hybrid Reasoning

2025-10-11 · Yujian Zhang, Keyu Chen, Zhifeng Shen, Ruizhi Qiao 외 arxiv

Although Long Reasoning Models (LRMs) have achieved superior performance on various reasoning scenarios, they often suffer from increased computational costs and inference latency caused by overthinking. To address these…

Reinforcement LearningMathematical Reasoning

Do Thinking Tokens Help or Trap? Towards More Efficient Large Reasoning Model

2025-06-30 · Bowen Ding, Yuhan Chen, Futing Wang, Lingfeng Ming 외

Large Reasoning Models (LRMs) excel at solving complex problems but face an overthinking dilemma. When handling simple tasks, they often produce verbose responses overloaded with thinking tokens (e.g., wait, however). Th…

Math